A correct, private, and efficient mix network

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

Volumn 2947, Issue , 2004, Pages 439-454

  Peng, Kun ^a   Boyd, Colin ^a   Dawson, Ed ^a   Viswanathan, Kapali ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Batch verification; Re encryption mix network; Shuffling

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

BATCH VERIFICATION; FORMAL PROOFS; HIGHER EFFICIENCY; MIX NETWORKS; SHUFFLING;

EFFICIENCY;

EID: 35048899692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_32     Document Type: Article

References (19)

1. M Abe. Mix-networks on permutation net-works. In Asiacrypt 98, pages 258-273, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science 1716.
2. Masayuki Abe and Fumitaka Hoshino. Remarks on mix-network based on permutation networks. In Public Key Cryptography 2001, pages 317-324, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science 1992.
3. M Bellare, J A Garay, and T Rabin. Fast batch verification for modular exponentiation and digital signatures. In EuroCrypt'98, pages 236-250, Berlin, 1998. Springer-Verlag. Lecture Notes in Computer Science 1403.
4. Dan Boneh and Philippe Golle. Almost entirely correct mixing with applications to voting. In Proceedings of the 9th ACM conference on Computer and communications security, pages 68-77, 2002.
5. Colin Boyd and Chris Pavlovski. Attacking and repairing batch verification schemes. In Advances in Cryptology - ASIACRYPT 2000, pages 58-71, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science 1976.
6. D Chaum. Untraceable electronic mail, return address and digital pseudonym. In Communications of the ACM, 24(2), pages 84-88, 1981.
7. R. Cramer, I. B. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology - Crypto '94, pages 174-187, Berlin, 1994. Springer-Verlag. Lecture Notes in Computer Science Volume 839.
8. Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In CRYPTO2001, volume 2139 of Lecture Notes in Computer Science, pages 368-387. Springer, 2001.
9. Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, and Ari Juels. Optimistic mixing for exit-polls. In ASIACRYPT 2002, pages 451-465, Berlin, 2002. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
10. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography 2003, pages 145-160, Berlin, 2003. Springer-Verlag. Lecture Notes in Computer Science Volume 2567.
11. Fumitaka Hoshino, Masayuki Abe, and Tetsutaro Kobayashi. Lenient/Strict batch verification in several groups. In Information Security, 4th International Conference, ISC 2001, pages 81-94, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science Volume 2200.
12. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making mix nets robust for electronic voting by randomizsed partial checking. In Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, 2002, pages 339-353. USENIX, 2002.
13. Ari Juels and Markus Jakobsson. An optimally robust hybrid mix network. In Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation, pages 284-292. ACM, 2001.
14. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In ACM Conference on Computer and Communications Security 2001, pages 116-125, 2001.
15. W Ogata, K Kurosawa, K Sako, and K Takatani. Fault tolerant anonymous channel. In Proc. of International Conference on Information and Communication Security 1997, pages 440-444, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1334.
16. Miyako Ohkubo and Masayuki Abe. A length-invariant hybrid mix. In ASIACRYPT 2000, pages 178-191, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1976.
17. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Advances in Cryptology - EuroCrypt '93, pages 248-259, Berlin, 1993. Springer-Verlag. Lecture Notes in Computer Science Volume 765.
18. K. Sako and J. Kilian. Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth. In EUROCRYPT '95, pages 393-403, Berlin, 1995. Springer-Verlag. Lecture Notes in Computer Science Volume 921.
19. Kapali Viswanathan, Colin Boyd, and Ed Dawson. A three phased schema for sealed bid auction system design. In Information Security and Privacy, 5th Australasian Conference, ACISP'2000, pages 412-426, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science 1841.