A sender verifiable mix-net and a new proof of a shuffle

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

Volumn 3788 LNCS, Issue , 2005, Pages 273-292

  Wikström, Douglas ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; KNOWLEDGE BASED SYSTEMS; NETWORK PROTOCOLS; SERVERS;

DECRYPTION-PERMUTATION SHUFFLE; DIFFIE-HELLMAN ASSUMPTION; MIX-SERVERS; ZERO-KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 33646794034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_15     Document Type: Conference Paper

References (50)

1. M. Abe, S. Fehr, Adoptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography, to appear at Crypto 2004. (full version at Cryptology ePrint Archive, Report 2004/118, http://eprint.iacr.org/, May, 2004).
2. M. Abe, Universally Verifiable mix-net with Verification Work Independent of the Number of Mix-centers, Eurocrypt '98, pp. 437-447, LNCS 1403, 1998.
3. 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.
4. R. C. Baker and G. Harman, The difference between consecutive primes, Proc. Lond. Math. Soc., series 3, 72 (1996) 261-280.
5. D. Beaver, Foundations of secure interactive computation, Grypto '91, LNCS 576, pp. 377-391, 1991.
6. D. Boneh, and M. Franklin, Efficient generation of shared RSA keys, Crypto' 97, LNCS 1233, pp. 425-439, 1997.
7. J. Buus Nielsen, Universally Composable Zero-Knowledge Proof of Membership, manuscript, http://www.brics.dk/~buus/, April, 2005.
8. R. Canetti, Security and composition of multi-party cryptographic protocols, Journal of Cryptology, Vol. 13, No. 1, winter 2000.
9. 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.
10. D. Chaum, Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms, Communications of the ACM - CACM '81, Vol. 24, No. 2, pp. 84-88, 1981.
11. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally Composable Two-Party and Multi-Party Secure Computation, 34th STOC, pp. 494-503, 2002.
12. I. Damgård, E. Fujisaki, A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order, Asiacrypt 2002, LNCS 2501, pp. 125-142, 2002.
13. Y. Desmedt, K. Kurosawa, How to break a practical MIX and design a new one, Eurocrypt 2000, pp. 557-572, LNCS 1807, 2000.
14. T. El Gamal, A Public Key Cryptosystem and a Signiture Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469-472, 1985.
15. P. Feldman, A practical scheme for non-interactive verifiable secret sharing, 28th FOCS, pp. 427-438, 1987.
16. P. Fouque and J. Stern, Fully Distributed Threshold RSA under Standard Assumptions, Cryptology ePrint Archive, Report 2001/008, 2001.
17. A. Fujioka, T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, Auscrypt '92, LNCS 718, pp. 244-251, 1992.
18. E. Fujisaki, T. Okamoto, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Crypto 97, LNCS 1294, pp. 16-30, 1997.
19. J. Furukawa, K. Sako, An efficient scheme for proving a shuffle, Crypto 2001, LNCS 2139, pp. 368-387, 2001.
20. 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.
21. J. Furukawa, Efficient, Verifiable Shuffle Decryption and its Requirements of Unlinkability, PKC 2004, LNCS 2947, pp. 319-332, 2004.
22. O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, 19th STOC, pp. 218-229, 1987.
23. O. Goldreich, Foundations of Cryptography, Cambridge University Press, 2001.
24. S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, Crypto '90, LNCS 537, pp. 77-93, 1990.
25. S. Goldwasser, S. Micali, Probabilistic Encryption, Journal of Computer and System Sciences (JCSS), Vol. 28, No. 2, pp. 270-299, 1984.
26. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, A. Juels, Optimistic Mixing for Exit-Polls, Asiacrypt 2002, LNCS, 2002.
27. N. Groth, A Verifiable Secret Shuffle of Homomorphic Encryptions, PKC 2003, pp. 145-160, LNCS 2567, 2003.
28. N. Groth, Personal Communication, 2004.
29. J. Buchmann, S. Hamdy, A Survey on IQ Cryptography, In Public-Key Cryptography and Computational Number Theory, Walter de Gruyter, pp. 1-15, 2001.
30. M. Jakobsson, A Practical Mix, Eurocrypt '98, LNCS 1403, pp. 448-461, 1998.
31. M. Jakobsson, Flash Mixing, In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing - PODC '98, pp. 83-89, 1998.
32. M. Jakobsson, A. Juels, Millimix: Mixing in small batches, DIMACS Techical report 99-33, June 1999.
33. 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.
34. S. Micali, P. Rogaway, Secure Computation, Crypto '91, LNCS 576, pp. 392-404, 1991.
35. 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.
36. M. Mitomo, K. Kurosawa, Attack for Flash MIX, Asiacrypt 2000, pp. 192-204, LNCS 1976, 2000.
37. 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.
38. A. Neff, Verifiable Mixing (Shuffling) of ElGamal Pairs, preliminary full version of [37], http://www.votehere.com/documents.html, Mars, 2005.
39. V. Niemi, A. Renvall, How to prevent buying of votes in computer elections, Asiacrypt'94, LNCS 917, pp. 164-170, 1994.
40. W. Ogata, K. Kurosawa, K. Sako, K. Takatani, Fault Tolerant Anonymous Channel, Information and Communications Security - ICICS '97, pp. 440-444, LNCS 1334, 1997.
41. P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Eurocrypt '99, LNCS 1592, pp. 223-238, 1999.
42. C. Park, K. Itoh, K. Kurosawa, Efficient Anonymous Channel and All/Nothing Election Scheme, Eurocrypt '93, LNCS 765, pp. 248-259, 1994.
43. B. Pfitzmann, Breaking an Efficient Anonymous Channel, Eurocrypt '94, LNCS 950, pp. 332-340, 1995.
44. B. Pfitzmann, A. Pfitzmann, How to break the direct RSA-implementation of mixes, Eurocrypt '89, LNCS 434, pp. 373-381, 1990.
45. 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.
46. P. Ribenboim, The new book of prime number records, 3rd ed., ISBN 0-38794457-5, Springer-Verlag, 1996.
47. K. Sako, J. Killian, Reciept-free Mix-Type Voting Scheme, Eurocrypt '95, LNCS 921, pp. 393-403, 1995.
48. D. Wikström, Five Practical Attacks for "Optimistic Mixing for Exit-Polls", In proceedings of Selected Areas of Cryptography (SAC), LNCS 3006, pp. 160-174, 2003.
49. D. Wikström, A Universally Composable Mix-Net, Proceedings of First Theory of Cryptography Conference (TCC '04), LNCS 2951, pp. 315-335, 2004.
50. D. Wikström, A Sender Verifiable Mix-Net and a New Proof of a Shuffle, Cryptology ePrint Archive, Report 2005/137, 2005, http://eprint.iacr. org/.