Breaking and mending resilient mix-nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2760, Issue , 2003, Pages 66-80

  Nguyen, Lan ^a   Safavi Naini, Rei ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MIX-NET; MIXNETS; SECURITY ANALYSIS;

DATA PRIVACY;

EID: 33749003289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40956-4_5     Document Type: Article

References (25)

1. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, pages 437-447. Springer-Verlag, 1998. LNCS No. 1403.
2. M. Abe. A mix-network on permutation networks. In K.Y. Lam, C. Xing, and E. Okamoto, editors, ASIACRYPT '99, pages 258-273, 1999. LNCS no. 1716.
3. M. Abe and F. Hoshino. Remarks on Mix-Network Based on Permutation Networks. Public Key Cryptography 2001, pages 317-324.
4. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
5. Y. Desmedt and K. Kurosawa. How to break a practical mix and design a new one. In B. Preneel, editor, EUROCRYPT '00, pages 557-572. Springer-Verlag, 2000. LNCS no. 1807.
6. J. Furukawa and K. Sako. An Efficient Scheme for Proving a Shuffle, pages 368 ff. J. Kilian (Ed.), CRYPTO 2001. LNCS 2139
7. E. Gabber, P. Gibbons, Y. Matias, and A. Mayer. How to make personalized Web browsing simple, secure, and anonymous. In R. Hirschfeld, editor, Financial Cryptography '97, pages 17-31, 1997.
8. M. Jakobsson. A practical mix. In K. Nyberg, editor, EUROCRYPT '98, pages 448-461. Springer-Verlag, 1998. LNCS No. 1403.
9. M. Jakobsson and D. M'Raihi. Mix-based electronic payments. In E. Tavares S and H. Meijer, editors, SAC '93, pages 057-473. Springer-Verlag, 1998. LNCS no. 1505.
10. M. Jakobsson. Flash mixing. In PODC '99, pages 83-89. ACM, 1999.
11. M. Jakobsson and A. Juels. Millimix: Mixing in small batches, 1999. DIMACS Technical Report 99-33.
12. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via cipher-texts. In T. Okamoto, editor, ASIACRYPT '00, pages 162-177, 2000. LNCS No. 1976.
13. M. Jakobsson, A. Juels, "An Optimally Robust Hybrid Mix Network", PODC '01
14. M. Jakobsson, A. Juels and R. Rivest, "Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking", USENIX Security '02.
15. A. Juels. Targeted advertising and privacy too. In D. Naccache, editor, RSA Conference Cryptographers' Track, 2801.
16. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press 1996.
17. Markus Michels, Patrick Horster: Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme. ASIACRYPT 1996, pages 125-132.
18. M. Mitomo and K. Kurosawa. Attack for flash mix. In T. Okamoto, editor, ASI-ACRYPT '00, pages 192-204, 2000. LNCS No. 1976.
19. A. Neff, A verifiable secret shuffle and its application to e-voting. In P. Samarati, editor, ACM CCS '01, pages 116-125. ACM Press, 2001.
20. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Proc. ICICS '97, pages 440-444, 1997. LNCS No. 1334.
21. M. Ohkubo and M. Abe. A length-invariant hybrid mix. In T. Okamoto, editor, ASIACRYPT '00, pages 178-191, 2000. LNCS No. 1976.
22. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In T. Helleseth, editor, EUROCRYPT '93, pages 248-259. Springer-Verlag, 1993. LNCS No. 765.
23. B. Pfitzmann. Breaking an Efficient Anonymous Channel. EUROCRYPT '94, pages 332-340. Springer-Verlag, 1995. LNCS No. 950.
24. K. Sako and J. Kilian. Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth. In L.C. Guillou and J.-J. Quisquater, editors, EUROCRYPT '95. Springer-Verlag, 1995. LNCS No. 921.
25. A. Waksman. A permutation network. J. ACM, 15(1):159-163, 1968.