Verifiable shuffle of large size ciphertexts

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

Volumn 4450 LNCS, Issue , 2007, Pages 377-392

  Groth, Jens ^a   Lu, Steve ^b  

^a Engineering IV

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Homomorphic commitment; Homomorphic encryption; Honest verifier zero knowledge; Mix net; Shuffle

Indexed keywords

COMPUTATIONAL COMPLEXITY; KNOWLEDGE ACQUISITION; NETWORK PROTOCOLS;

HOMOMORPHIC COMMITMENTS; HOMOMORPHIC ENCRYPTION; HONEST VERIFIER ZERO KNOWLEDGE; MIX NETS; SHUFFLE;

CHARACTER RECOGNITION;

EID: 38049040291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_25     Document Type: Conference Paper

References (26)

1. Masayuki Abe. Mix-networks on permutation networks. In proceedings of ASIACRYPT '99, pages 258-273, 1999.
2. Masayuki Abe and Fumitaka Hoshino. Remarks on mix-network based on permutation networks. In proceedings of PKC '01, LNCS series, volume 1992, pages 317-324, 2001.
3. Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In proceedings of CRYPTO '94, LNCS series, volume 893, pages 174-187, 1994.
4. Ivan Damgård and Eiichiro Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. In proceedings of ASIACRYPT '02, LNCS series, volume 2501, pages 125-142, 2002.
5. Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In proceedings of CRYPTO '84, LNCS series, volume 196, pages 10-18,1984.
6. Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In proceedings of CRYPTO '97, LNCS series, volume 1294, pages 16-30, 1997.
7. Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In proceedings of CRYPTO '01, LNCS series, volume 2139, pages 368-387, 2001.
8. Jun Furukawa. Efficient and verifiable shuffling and shuffle-decryption. IEICE Transactions, 88-A(1): 172-188, 2005.
9. Jens Groth and Steve Lu. Comparison of shuffle arguments. http://www.brics.dk/~jg/ShuffleComparisons.xls, 2007.
10. Louis C. Guillou and Jean-Jacques Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both trasmission and memory. In proceedings of EUROCRYPT '88, LNCS series, volume 330, pages 123-128, 1988.
11. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In proceedings of PKC '03, LNCS series, volume 2567, pages 145-160, 2003.
12. n. In proceedings of TCC '05, LNCS series, volume 3378, pages 50-65, 2005.
13. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. Cryptology ePrint Archive, Report 2005/246, 2005. http://eprint.iacr.org/.
14. Andrew C. Neff. A verifiable secret shuffle and its application to e-voting. In CCS '01, pages 116-125, 2001. Full paper available at http://www.votehere.net/vhti/documentation/egshuf.pdf.
15. Lan Nguyen, Reihaneh Safavi-Naini, and Kaoru Kurosawa. Verifiable shuffles: A formal model and a paillier-based efficient construction with provable security. In proceedings of ACNS '04, LNCS series, volume 3089, pages 61-75, 2004.
16. Lan Nguyen, Reihaneh Safavi-Naini, and Kaoru Kurosawa. A provably secure and effcient verifiable shuffle based on a variant of the paillier cryptosystem. Journal of Universal Computer Science, 11(6):986-1010, 2005.
17. Takao Onodera and Keisuke Tanaka. A verifiable secret shuffle of paillier's encryption scheme, 2004. Tokyo Institute of Technology, research report C-193.
18. Tatsuaki Okamoto and Shigenori Uchiyama. A new public-key cryptosystem as secure as factoring. In proceedings of EUROCRYPT '98, LNCS series, volume 1403, pages 308-318, 1998.
19. Pascal Paillier. Public-key cryptosystems based on composite residuosity classes. In proceedings of EUROCRYPT '99, LNCS series, volume 1592, pages 223-239, 1999.
20. Kun Peng, Colin Boyd, and Ed Dawson. Simple and efficient shuffling with provable correctness and zk privacy. In proceedings of CRYPTO '05, LNCS series, volume 3621, pages 188-204, 2005.
21. Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In proceedings of CRYPTO '91, LNCS series, volume 576, pages 129-140, 1991.
22. Claus-Peter Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4(3):161-174, 1991.
23. Douglas Wikström and Jens Groth. An adaptively secure mix-net without erasures. In proceedings of ICALP '06, LNCS series, volume 4052, pages 276-287, 2006.
24. Douglas Wikström. A sender verifiable mix-net and a new proof of a shuffle. In proceedings of ASIACRYPT '05, LNCS series, volume 3788, pages 273-292, 2005.
25. Douglas 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/.
26. Douglas Wikström. Private Communication, 2006.