Parallel mixing

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2004, Pages 220-226

  Golle, Philippe ^a   Juels, Ari ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b RSA   (United States)

Author keywords

Anonymity; Mixnet; Parallel execution; Permutation; Privacy

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA PRIVACY; PARALLEL PROCESSING SYSTEMS; SECURITY OF DATA; SERVERS;

ANONYMITY; DECRYPTION; MIXNET; PARALLEL EXECUTION; PERMUTATION;

CRYPTOGRAPHY;

EID: 14844293910     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1030083.1030113     Document Type: Conference Paper

References (25)

1. M. Abe. Mix-networks on permutation networks. In ASIACRYPT '99, pages 258-273.
2. M. Abe and F. Hoshino. Remarks on mix-network based on permutation networks. In PKC '01, pages 317-324.
3. G. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: practical asynchronous Byzantine agreement using cryptography (extended abstract). In PODC '00, pages 123-132.
4. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
5. G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In IEEE Symposium on Security and Privacy '03, pages 2-15.
6. Y. Desmedt and K. Kurosawa. How to break a practical mix and design a new one. In EUROCRYPT '00, pages 557-572.
7. R. Dingledine, V. Shmatikov, and P. Syverson. Synchronous batching: From cascades to free routes. In Privacy Enhancing Technologies '04- To appear.
8. J. Furukawa, H. Miyauchi, K. Mori, S. Obana, and K. Sako. An implementation of a universally verifiable electronic voting scheme based on shuffling. In Financial Cryptography '02, pages 16-30.
9. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In CRYPTO '01, pages 368-387.
10. P. Golle and D. Boneh. Almost entirely correct mixing with applications to voting. In ACM CCS '02, pages 68-77.
11. M. Jakobsson. Flash mixing. In PODC '99, pages 83-89.
12. M. Jakobsson. A practical mix. In EUROCRYPT '98, pages 448-461.
13. M. Jakobsson and A. Juels. An optimally robust hybrid mix network. In PODC '01, pages 284-292.
14. M. Jakobsson and A. Juels. Millimix: Mixing in small batches, 1999. DIMACS Technical Report 99-33.
15. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In USENIX'02, pages 339-353.
16. A. Kiayias and M. Yung. The vector-ballot e-voting approach. In Financial Cryptography '04, pages 72-89.
17. D. Knuth. The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley, 1998.
18. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1995.
19. A. Neff. A verifiable secret shuffle and its application to e-voting. In ACM CCS '01, pages 116-125.
20. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS '97, pages 440-444.
21. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In ASIA CRYPT '00, pages 178-191.
22. C. Rackoff and D. R. Simon. Cryptographic defense against traffic analysis. In ACM Symposium on Theory of Computing, pages 672-681, 1993.
23. A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Privacy Enhancing Technologies '02, pages 41-53.
24. A. Waksman. A permutation network. JACM, 15(1):159-163, 1968.
25. M. Wright, M. Adler, B. N. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In NDSS '02, pages 39-50.