Almost entirely correct mixing with applications to voting

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2002, Pages 68-77

  Boneh, Dan ^a   Golle, Philippe ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Electronic voting; Mix networks

Indexed keywords

ASYMPTOTIC STABILITY; CRYPTOGRAPHY; PROBABILITY; SERVERS;

ELECTRONIC VOTING; MIX NETWORKS; MIX SERVER;

COMPUTER NETWORKS;

EID: 0038687763     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/586119.586121     Document Type: Conference Paper

References (27)

1. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In Proc. of Eurocrypt '98, pp. 437-447. Springer-Verlag, 1998. LNCS 1403.
2. M. Abe. Mix-networks on permutation networks. In Proc. of Asiacrypt '99, pp. 258-273, 1999. LNCS 1716.
3. M. Abe. Remarks on mix-networks based on permutation networks.
4. M. Bellare, J. Garay and T. Rabin. Batch Verification with Applications to Cryptography and Checking. In Proc. of Eurocrypt '98, pp. 170-182. Springer Verlag, 1998. LNCS 1380.
5. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM, 24(2):84-88, 1981.
6. D. Chaum and T. Pedersen. Wallet databases with observers. In Proc. of Crypto'92, pp. 89-105. Springer-Verlag, 1993. LNCS 740.
7. Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. In Proc. of Eurocrypt'2000, pp. 557-572. LNCS 1807.
8. D. Dolev, C. Dwork, M. Naor. Nonmalleable Cryptography. In SIAM J. Comput. 30(2): 391-437 (2000)
9. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Proc. of Crypto '01, pp. 368-387. Springer-Verlag, 2001. LNCS 2139.
10. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In Proc. of Eurocrypt '99, pp. 295-310. Springer-Verlag, 1999. LNCS 1592.
11. P. Golle, S. Zhong, D. Boneh, M. Jakobsson and A. Juels. Optimistic Mixing for Exit-Polls. To appear in Asiacrypt 2002.
12. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Proc. of Eurocrypt'00, pp. 539-556. Springer-Verlag, 2000. LNCS 1807.
13. M. Jakobsson. A practical mix. In Proc. of Eurocrypt '98, pp. 448-461. Springer-Verlag, 1998. LNCS 1403.
14. M. Jakobsson and D. M'Raïhi. Mix-based electronic payments. In Proc. of SAC'98, pp. 157-173. Springer-Verlag, 1998. LNCS 1556.
15. M. Jakobsson. Flash mixing. In Proc. of PODC '99, pp. 83-89, ACM, 1999.
16. M. Jakobsson and A. Juels. Millimix: mixing in small batches. DIMACS Technical Report 99-33.
17. M. Jakobsson and A. Juels. An optimally robust hybrid mix network. In Proc. of PODC'01, pp. 284-292. ACM Press. 2001.
18. M. Jakobsson, A. Juels and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX'02.
19. M. Mitomo and K. Kurosawa. Attack for flash mix. In Proc. of Asiacrypt'00, pp. 192-204. LNCS 1976.
20. A. Neff. A verifiable secret shuffle and its application to E-Voting. In Proc. of ACM CCS'01, pp. 116-125. ACM Press. 2001.
21. W. Ogata, K. Kurosawa, K. Sako and K. Takatani. Fault tolerant anonymous channel. In Proc. of ICICS '97, pp. 440-444, 1997. LNCS 1334.
22. C. Park, K. Itoh and K. Kurosawa. Efficient anonymous channel and all/nothing election Scheme. In Proc. of Eurocrypt '93, pp. 248-259. Springer-Verlag, 1993. LNCS 765.
23. T. Pedersen. A Threshold cryptosystem without a trusted party. In Proc. of Eurocrypt'91, pp. 522-526, 1991.
24. B. Pfitzmann and A. Pfitzmann. How to break the direct RSA-implementation of mixes. In Proc. of Eurocrypt '89, pp. 373-381. Springer-Verlag, 1989. LNCS 434.
25. B. Pfizmann. Breaking an efficient anonymous channel. In Proc. of Eurocrypt'94, pp. 339-348.
26. K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Proc. of Eurocrypt '95. Springer-Verlag, 1995. LNCS 921.
27. Y. Tsiounis and M. Yung. On the security of ElGamal based encryption. In Proc. of PKC'98.