A provably secure and efficient verifiable shuffle based on a variant of the paillier cryptosystem

Journal of Universal Computer Science

Volumn 11, Issue 6, 2005, Pages 986-1010

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

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Mix nets; Paillier's public key system; Privacy; Verifiable shuffles

Indexed keywords

EID: 23844458891     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Review

References (45)

1. [Abe 1999] Abe, M.: "Mix-networks on permutation networks"; Proc. ASIA CRYPT '99, Springer-Verlag, LNCS 1716 (1999), 258-273.
2. [Abe and Hoshino 2001] Abe, M., Hoshino, F.: "Remarks on Mix-Network Based on Permutation Networks"; PKC'01, Springer-Verlag, LNCS (2001), 317-324.
3. [Abe 2004] Abe, M.: "Combining Encryption and Proof of Knowledge in the Random Oracle Model"; Computer Journal, 47, 1 (2004). To appear.
4. [Boneh and Golle 2002] Boneh, D., Golle, P.: "Almost Entirely Correct Mixing with Application to Voting". Proc. ACM CCS'02, ACM Press (2002).
5. [Brands 1993] Brands, S.: "An efficient off-line electronic cash system based on the representation problem"; CWI Technical Report CS-R9323, (1993).
6. [Chaum 1981] Chaum, D.: "Untraceable electronic mail, return addresses, and digital pseudonyms"; Communications of the ACM, 24, 2 (1981), 84-88.
7. [Choi and Kim 2003] Choi, S. and Kim, K.: "Authentication and Payment Protocol Preserving Location Privacy in Mobile IP"; GLOBECOM'03, San Francisco (2003).
8. [Desmedt and Kurosawa 2000] Desmedt, Y., Kurosawa K.: "How to break a practical mix and design a new one"; Proc. EUROCRYPT '00, Springer-Verlag, LNCS 1807 (2000), 557-572.
9. [Fouque and Pointcheval 2001] Fouque, P., Pointcheval D.: "Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks"; Proc. ASIACRYPT'01, Springer-Verlag, LNCS 2248 (2001), 351-368.
10. [Furukawa and Sako 2001] Furukawa, J., Sako K.: "An Efficient Scheme for Proving a Shuffle"; Proc. CRYPTO'01, Springer-Verlag, LNCS 2139 (2001), 368-389.
11. [Furukawa et al. 2002] Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K.: "An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling"; Financial Cryptography'02 (2002).
12. [Furukawa 2004] Furukawa, J.: "Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability" ; PKC'04.
13. [Gabber et al. 1997] Gabber, E., Gibbons, P., Matias, Y., Mayer, A. "How to make personalized Web browsing simple, secure, and anonymous" ; Financial Cryptography'97 (1997), 17-31.
14. [Goldreich 2001] Goldreich, O.: "Foundations of Cryptography Basic Tools"; Cambridge University Press (2001).
15. [Goldreich 2004] Goldreich, O.: "Foundations of Cryptography, Basic Applications"; Cambridge University Press (2004).
16. [Golle et al. 2004] Golle, P., Jakobsson, M., Juels, A., Syverson, P.: "Universal Reencryption for Mixnets"; Proc. RSA Conference Cryptographers' Track '04, Springer-Verlag, LNCS 2964 (2004), 163-178.
17. [Golle et al. 2002] Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: "Optimistic Mixing for Exit-Polls" ; Proc. ASIACRYPT'02, Springer-Verlag, LNCS 2501 (2002), 451-465.
18. [Groth 2003] Groth, J.: "A Verifiable Secret Shuffle of Homomorphic Encryptions"; Proc. PKC'03, Springer-Verlag, LNCS 2567 (2003), 145-160.
19. [Jakobsson 1998] Jakobsson, M.: "A practical mix"; Proc. EUROCRYPT'98, Springer-Verlag, LNCS 1403 (1998), 448-461.
20. [Jakobsson and M'Raihi 1998] Jakobsson, M., M'Raihi, D.: "Mix-based electronic payments"; Proc. SAC '98, Springer-Verlag, LNCS 1505 (1998), 057-473.
21. [Jakobsson 1999] Jakobsson, M.: "Flash mixing"; Proc. PODC '99, ACM (1999), 83-89.
22. [Jakobsson and Juels 1999] Jakobsson, M., Juels, A.: "Millimix: Mixing in small batches"; DIMACS Technical Report 99-33 (1999).
23. [Jakobsson and Juels 2000] Jakobsson, M., Juels, A.: "Mix and match: Secure function evaluation via ciphertexts" ; Proc. ASIACRYPT'00, Springer-Verlag, LNCS 1976 (2000), 162-177.
24. [Jakobsson and Juels 2001] Jakobsson, M., Juels, A. "An Optimally Robust Hybrid Mix Network", Proc. PODC '01, ACM (2001).
25. [Jakobsson et al. 2002] Jakobsson, M., Juels, A., Rivest, R.: "Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking" ; USENIX Security '02 (2002).
26. [Juels 2001] Juels, A.: "Targeted advertising and privacy too"; Proc. RSA-CT'01 (2001).
27. [Kong and Hong 2003] Kong, J., Hong, X.: "ANODR,: ANonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks"; MobiHoc'03, ACM (2003), 291-302.
28. [Menezes et al. 1997] Menezes, A., van Oorschot, P., Vanstone, S.: "Handbook of Applied Cryptography"; CRC Press (1996).
29. [Mitomo and Kurosawa 2000] Mitomo, M., Kurosawa, K.: "Attack for flash mix"; Proc. ASIACRYPT'00, Springer-Verlag, LNCS 1976 (2000), 192-204.
30. [Naor and Yung 1990] Naor, M., Yung, M.: "Public-Key Cryptosystems Provably Secure against Chosen Ciphertexts Attacks"; Proc. STOC'90, ACM Press (1990), 427-437.
31. [Neff 2001] Neff, A.: "A verifiable secret shuffle and its application to e-voting"; Proc. ACM CCS '01, ACM Press (2001), 116-125.
32. [Neff 2003] Neff, A.: "Verifiable Mixing (Shuffling) of ElGamal Pairs"; (2003) appeared as electronic version, http://www.votehere.org/ vhti/documentation/egshuf.pdf.
33. [Nguyen and Safavi-Naini 2003] Nguyen, L., Safavi-Naini, R.: "Breaking and Mending Resilient Mix-nets"; Proc. PET'03, Springer-Verlag, LNCS 2760 (2003), 66-80.
34. [Nguyen et al. 2004] Nguyen, L., Safavi-Naini, R., Kurosawa, K.: "Verifiable Shuffles: A Formal Model and a Paillier-based Efficient Construction with Provable Security"; Proc. ACNS'04 (Second Conference of Applied Cryptography and Network Security), Springer-Verlag, LNCS (2004). To appear.
35. [Nguyen and Safavi-Naini 2004] Nguyen, L., Safavi-Naini, R.: "An Efficient Verifiable Shuffle with Perfect Zero-knowledge Proof System" ; Cryptographic Algorithms and their Uses (Eracom 2004). To appear.
36. [Ogata et al. 1997] Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: "Fault tolerant anonymous channel"; Proc. ICICS'97, Springer-Verlag, LNCS 1334 (1997), 440-444.
37. [Ohkubo and Abe 2000] Ohkubo, M., Abe, M.: "A length-invariant hybrid mix"; Proc. ASIACRYPT'00, Springer-Verlag, LNCS 1976 (2000), 178-191.
38. [Paillier 1999] Paillier, P.: "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes"; Proc. EUROCRYPT'99, Springer-Verlag, LNCS 1592 (1999).
39. [Park et al. 1993] Park, C., Itoh, K., Kurosawa, K.: "Efficient anonymous channel and all/nothing election scheme"; Proc. EUROCRYPT '93, Springer-Verlag, LNCS 765 (1993), 248-259.
40. [Pfitzmann 1994] Pfitzmann, B.: "Breaking an Efficient Anonymous Channel"; Proc. EUROCRYPT '94, Springer-Verlag, LNCS 950 (1995), 332-340.
41. [Schnorr and Jakobsson 2000] Schnorr, P., Jakobsson, M.: "Security of signed El Gamal encryption"; Proc. ASIACRYPT'00, Springer-Verlag, LNCS 1976 (2000), 73-89.
42. [Shamir 1979] Shamir, A.: "How to Share a Secret"; Communications of the ACM, 22 (1979), 612-613.
43. [Tsiounis and Yung 1998] Tsiounis, Y., Yung, M.: "On the security of El Gamal based encryption"; Proc. PKC'98, Springer-Verlag, LNCS 1431 (1998), 117-134.
44. [Wikstrom 2002] Wikstrom, D.: "The security of a mix-center based on a semantically secure cryptosystem"; Proc. INDOCRYPT'02, Springer-Verlag, LNCS 2551 (2002), 368-381.
45. [Wikstrom 2003] Wikstrom, D.: "Five Practical Attacks for "Optimistic Mixing for Exit-Polls""; Proc. SAC'03, Springer-Verlag, LNCS (2003).