Verifiable shuffles: A formal model and a Paillier-based efficient construction with provable security

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

Volumn 3089, Issue , 2004, Pages 61-75

  Nguyen, Lan ^a   Safavi Naini, Rei ^a   Kurosawa, Kaoru ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Formal security model; Mix nets; Paillier public key system; Privacy; Verifiable shuffles

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY;

EFFICIENT CONSTRUCTION; ENCRYPTION SCHEMES; FORMAL MODEL; FORMAL SECURITY MODELS; MIX-NET; PROVABLE SECURITY; PUBLIC KEY SYSTEMS; VERIFIABLE SHUFFLES;

NETWORK SECURITY;

EID: 24144473453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24852-1_5     Document Type: Article

References (25)

1. M. Abe and H. Imai. Flaws in Some Robust Optimistic Mix-nets. ACISP 2003, LNCS 2727, pp. 39-50.
2. S. Brands. An efficient off-line electronic cash system based on the representation problem. CWI Technical Report CS-R9323, 1993.
3. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
4. S. Choi and K. Kim. Authentication and Payment Protocol Preserving Location Privacy in Mobile IP. GLOBECOM 2003.
5. P. Fouque and D. Pointcheval. Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks. Asiacrypt 2001, LNCS 2248, pp. 351-369.
6. J. Furukawa and K. Sako. An Efficient Scheme for Proving a Shuffle. Crypto 2001, LNCS 2139, pp. 368-387.
7. J. Furukawa, H. Miyauchi, K. Mori, S. Obana and K. Sako. An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling. Financial Cryptography 2002, LNCS 2357.
8. J. Furukawa. Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability. PKC 2004, LNCS 2947, pp. 319-332.
9. E. Gabber, P. Gibbons, Y. Matias, and A. Mayer. How to make personalized Web browsing simple, secure, and anonymous. Financial Cryptography 1997, LNCS 1318, pp. 17-31.
10. O. Goldreich. Foundations of Cryptography, Basic Tools. Cambridge University Press 2001.
11. O. Goldreich. Foundations of Cryptography, Basic Applications. Cambridge University Press 2004.
12. P. Golle, S. Zhong, D. Boneh, M. Jakobsson and A. Juels. Optimistic Mixing for Exit-Polls. Asiacrypt 2002, LNCS 2501, pp. 451-465.
13. J. Groth. A Verifiable Secret Shuffle of Homomorphic Encryptions. PKC 2003, LNCS 2567, pp. 145-160.
14. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. Asiacrypt 2000, LNCS 1976, pp. 162-177.
15. A. Juels. Targeted advertising and privacy too. RSA Conference Cryptographers' Track 2001, LNCS 2020, pp. 408-425.
16. J. Kong and X. Hong. ANODR: ANonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks. Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2003, pp. 291-302.
17. M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure against Chosen Ciphertexts Attacks. ACM STOC 1990, pp. 427-437.
18. A. Neff. A verifiable secret shuffle and its application to e-voting. ACM CCS 2001, pp. 116-125.
19. A. Neff. Verifiable Mixing (Shuffling) of ElGamal Pairs. http://www.votehere.org/vhti/documentation/egshuf.pdf.
20. L. Nguyen and R. Safavi-Naini. Breaking and Mending Resilient Mix-nets. Privacy Enhancing Technologies workshop (PET) 2003, LNCS 2760, pp. 66-80.
21. L. Nguyen, R. Safavi-Naini and K. Kurosawa. Verifiable Shuffles: A Formal Model and a Paillier-based Efficient Construction with Provable Security. Full version. Email: ldn01@uow.edu.au.
22. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt 1999, LNCS 1592, pp. 223-239.
23. A. Shamir. How to Share a Secret. Communications of the ACM, 22:612-613, 1979.
24. D. Wikstrom. The security of a mix-center based on a semantically secure cryptosystem. Indocrypt 2002, LNCS 2551, pp. 368-381.
25. D. Wikstrom. Five Practical Attacks for "Optimistic Mixing for Exit-Polls". SAC 2003, LNCS 3006.