An efficient Scheme for Proving a Shuffle
![](https://secure.gravatar.com/avatar/d41e5e1f3ce832fcc5c4324526f48093.jpg?s=120&d=mm&r=g)
31 Aug
2001
31 Aug
'01
4:47 p.m.
"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@tce.com Thomson multimedia, Inc. Indianapolis IN "Display some adaptability." -- Doug Shaftoe, _Cryptonomicon_
8560
Age (days ago)
8560
Last active (days ago)
0 comments
1 participants
participants (1)
-
Fisher Mark