A universally composable mix-net

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

Volumn 2951, Issue , 2004, Pages 317-335

  Wikström, Douglas ^a,b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DECISION DIFFIE-HELLMAN PROBLEM; DISTRIBUTED KEY GENERATION; ELECTRONIC VOTING; HYBRID MODEL; STAND -ALONE; UNIVERSALLY COMPOSABLE; UNIVERSALLY COMPOSABLE SECURITY;

CRYPTOGRAPHY;

EID: 35048873776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_18     Document Type: Article

References (47)

1. M. Abe, Universally Verifiable mix-net with Verification Work Independent of the Number of Mix-centers, Eurocrypt '98, pp. 437-447, LNCS 1403, 1998.
2. M. Abe, Flaws in Some Robust Optimistic Mix-Nets, In Proceedings of Information Security and Privacy, 8th Australasian Conference, LNCS 2727, pp. 39-50, 2003.
3. D. Beaver, Foundations of secure interactive computation, Crypto '91, LNCS 576, pp. 377-391, 1991.
4. R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, Crypto '97, LNCS 1294, pp. 455-469, 1997.
5. R. Canetti, Security and composition of multi-party cryptographic protocols, Journal of Cryptology, Vol. 13, No. 1, winter 2000.
6. R. Canetti, Universally Composable Security: A New Paradigm for Cryptographic Protocols, http://eprint.iacr.org/2000/067 and ECCC TR 01-24. Extended abstract appears in 42nd FOCS, IEEE Computer Society, 2001.
7. D. Chaum, Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms, Communications of the ACM - CACM '81, Vol. 24, No. 2, pp. 8-4-88, 1981.
8. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally Composable Two-Party and Multi-Party Secure Computation, 34th STOC, pp. 494-503, 2002.
9. R. Cramer, V. Shoup, A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack, Crypto '98, pp. 13-25, LNCS 1462, 1998.
10. Y. Desmedt, K. Kurosawa, How to break a practical MIX and design a new one, Eurocrypt 2000, pp. 557-572, LNCS 1807, 2000.
11. D. Dolev, C. Dwork, M. Naor, Non-Malleable Cryptography, 23rd STOC, pp. 542-552, 1991.
12. T. El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469-472, 1985.
13. P. Feldman, A practical scheme for non-interactive verifiable secret sharing, In Proceedings of the 28th FOCS, pages 427-438, 1987.
14. A. Fujioka, T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, Auscrypt '92, LNCS 718, pp. 244-251, 1992.
15. J. Furukawa, K. Sako, An efficient scheme for proving a shuffle, Crypto 2001, LNCS 2139, pp. 368-387, 2001.
16. J. Furukawa, H. Miyauchi, K. Mori, S. Obana, K. Sako, An implementation of a universally verifiable electronic voting scheme based on shuffling, Financial Cryptography '02, 2002.
17. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Eurocrypt '99, LNCS 1592, pp. 295-310, 1999.
18. O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, 19th STOC, pp. 218-229, 1987.
19. S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, Crypto '90, LNCS 537, pp. 77-93, 1990.
20. S. Goldwasser, Y. Lindell, Secure Multi-Party Computation Without Agreement, In Proceedings of the 16th DISC, LNCS 2508, pp. 17-32, 2002.
21. S. Goldwasser, S. Micali, Probabilistic Encryption, Journal of Computer and System Sciences (JCSS), Vol. 28, No. 2, pp. 270-299, 1984.
22. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, A. Juels, Optimistic Mixing for Exit-Polls, Asiacrypt 2002, LNCS, 2002.
23. N. Groth, A Verifiable Secret Shuffle of Homomorphic Encryptions, PKC 2003, pp. 145-160, LNCS 2567, 2003.
24. M. Jakobsson, A Practical Mix, Eurocrypt '98, LNCS 1403, pp. 448-461, 1998.
25. M. Jakobsson, Flash Mixing, In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing - PODC '98, pp. 83-89, 1998.
26. M. Jakobsson, A. Juels, Millimix: Mixing in small batches, DIMACS Techical report 99-33, June 1999.
27. M. Jakobsson, A. Juels, An optimally robust hybrid mix network, In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing - PODC '01, pp. 284-292, 2001.
28. Y. Lindell, A. Lysyanskaya, T. Rabin, On the Composition of Authenticated Byzantine Agreement, 34th STOC, pp. 514-523, 2002.
29. S. Micali, C. Rackoff, B. Sloan, The notion of security for probabilistic cryptosystems, SIAM Journal of Computing, Vol. 17, No. 2, pp. 412-426, 1988.
30. S. Micali, P. Rogaway, Secure Computation, Crypto '91, LNCS 576, pp. 392-404, 1991.
31. M. Michels, P. Horster, Some remarks on a reciept-free and universally verifiable Mix-type voting scheme, Asiacrypt '96, pp. 125-132, LNCS 1163, 1996.
32. M. Mitomo, K. Kurosawa, Attack for Flash MIX, Asiacrypt 2000, pp. 192-204, LNCS 1976, 2000.
33. A. Neff, A verifiable secret shuffle and its application to E-Voting, In Proceedings of the 8th ACM Conference on Computer and Communications Security - CCS 2001, pp. 116-125, 2001.
34. A. Neff, Personal communication, 2003.
35. V. Niemi, A. Renvall, How to prevent buying of votes in computer elections, Asiacrypt'94, LNCS 917, pp. 164-170, 1994.
36. W. Ogata, K. Kurosawa, K. Sako, K. Takatani, Fault Tolerant Anonymous Channel, Information and Communications Security - ICICS '97, pp. 440-444, LNCS 1334, 1997.
37. C. Park, K. Itoh, K. Kurosawa, Efficient Anonymous Channel and All/Nothing Election Scheme, Eurocrypt '93, LNCS 765, pp. 248-259, 1994.
38. T. Pedersen, A threshold cryptosystem without a trusted party, Eurocrypt '91, LNCS 547, pp. 522-526, 1991.
39. B. Pfitzmann, Breaking an Efficient Anonymous Channel, Eurocrypt '94, LNCS 950, pp. 332-340, 1995.
40. B. Pfitzmann, A. Pfitzmann, How to break the direct RSA-implementation of mixes, Eurocrypt '89, LNCS 434, pp. 373-381, 1990.
41. B. Pfitzmann, M. Waidner, Composition and Integrity Preservation of Secure Reactive Systems, 7th Conference on Computer and Communications Security of the ACM, pp. 245-254, 2000.
42. C. Rackoff, D. Simon, Noninteractive zero-knowledge proofs of knowledge and chosen ciphertext attacks, 22nd STOC, pp. 433-444, 1991.
43. K. Sako, J. Killian, Reciept-free Mix-Type Voting Scheme, Eurocrypt '95, LNCS 921, pp. 393-403, 1995.
44. C. Schnorr, M. Jakobsson, Security of Signed El Gamal Encryption, Asiacrypt 2000, LNCS 1976, pp. 73-89, 2000.
45. Y. Tsiounis, M. Yung, On the Security of El Gamal based Encryption, International workshop on Public Key Cryptography, LNCS 1431, pp. 117-134, 1998.
46. D. Wikström, Five Practical Attacks for "Optimistic Mixing for Exit-Polls", to appear in proceedings of Selected Areas of Cryptography (SAC), LNCS, 2003.
47. D. Wikström, A Universally Composable Mix-Net, manuscript will be available at http://eprint.iacr.org/.