An efficient Scheme for Proving a Shuffle
Fisher Mark
fisherm at tce.com
Fri Aug 31 13:24:58 PDT 2001
"An efficient Scheme for Proving a Shuffle", Crypto 2001, Jun Furukawa and
Kazue Sako (NEC Corporation), apparently could be used to show that a
remailer is processing all messages without revealing the header or contents
of any message. (Apparently because I haven't read the paper -- just heard
of it on the nymip-res-group list.)
===============================================
Mark Leighton Fisher fisherm at tce.com
Thomson multimedia, Inc. Indianapolis IN
"Display some adaptability." -- Doug Shaftoe, _Cryptonomicon_
More information about the cypherpunks-legacy
mailing list