Advertisement

An Efficient Publicly Verifiable Mix-Net for Long Inputs

  • Jun Furukawa
  • Kazue Sako
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4107)

Abstract

We propose here the first efficient publicly verifiable hybrid mix-net. Previous publicly verifiable mix-net was only efficient for short ciphertexts and was not suitable for mixing long messages. Previous hybrid mix-net can mix long messages but did not have public verifiability. The proposed scheme is efficient enough to treat large scale electronic questionnaires of long messages as well as voting with write-ins, and offers public verifiability of the correctness of the tally. The scheme is provably secure if we assume random oracles, semantic security of a one-time symmetric-key cryptosystem, and intractability of decision Diffie-Hellman problem.

Keywords

Hybrid-mix public verifiability multiple encryption efficient 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abe, M.: Mix-Networks on Permutation Networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258–273. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  2. 2.
    Ben-Or, M., et al.: Everything Provable is Provable in Zero-Knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37–56. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    Abe, M., Imai, H.: Flaws in Some Robust Optimistic Mix-Nets. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 39–50. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Kobayashi, T., Aoki, K., Hoshino, F., Oguro, H.: Software Implementation of Parallel Elliptic Curve Cryptosystem. The 2001 Symposium on Cryptography and Information Security, Oiso, Japan, Vol 1, pp.299-303 (2001)Google Scholar
  5. 5.
    Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)CrossRefGoogle Scholar
  6. 6.
    Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption scheme secure against adaptive chosen ciphertext attack. SIAM Journal on Computing 33(1), 167–226 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Fouque, P.-A., Pointcheval, D.: Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 351–368. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Furukawa, J.: Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 319–332. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Furukawa, J.: Efficient and Verifiable Shuffling and Shuffle-Decryption. IEICE Trans. Fundamentals E88-A(1), 172–188 (2005)CrossRefGoogle Scholar
  10. 10.
    Efficient Publicly Verifiable Mix-net for Long Inputs. Full paper. ManuscriptGoogle Scholar
  11. 11.
    Furukawa, J., et al.: An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling. Financial Cryptography (2002)Google Scholar
  12. 12.
    Furukawa, J., Sako, K.: An Efficient scheme for Proving an Shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Gennaro, R., Shoup, V.: A Note on an Encryption Scheme of Kurosawa and Desmedt. Cryptology ePrint Archive, Report (2004)/194Google Scholar
  14. 14.
    Goldenberg, L., Vaidman, L., Wiesner, S.: Quantum Gambling. Phys. Rev. Lett. 82, 3356–3359 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Golle, P., et al.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 451–465. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Groth, J.: A verifiable Secret Shuffle of Holomorphic Encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145–160. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Groth, J.: A Verifiable Secret Shuffle of Homomorphic Encryptions. Cryptology ePrint Archive, Report 2005/246 (2005)Google Scholar
  18. 18.
    Kurosawa, K., Desmedt, Y.: A New Paradigm of Hybrid Encryption Scheme. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 426–442. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Menezes, A., van Oorschot, C., Vanstone, S.: Handbook of Applied Cryptography, pp. 617–627. CRC Press, Boca Raton (1997)zbMATHGoogle Scholar
  20. 20.
    Neff, C.A.: A Verifiable Secret Shuffle and its Application to E-Voting. In: ACMCCS 2001, pp. 116–125 (2001)Google Scholar
  21. 21.
    Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 448–461. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  22. 22.
    Juels, A., Jakobsson, M.: An optimally robust hybrid mix network. In: Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation (2001)Google Scholar
  23. 23.
    Naor, M., Yung, M.: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In: STOC 1990, pp. 427–437 (1990)Google Scholar
  24. 24.
    Nguyen, L., Safavi-Naini, R., Kurosawa, K.: Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable Security. In: ACNS 2004, pp. 61–75 (2004)Google Scholar
  25. 25.
    Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 178–191. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  26. 26.
    Sako, K., Kilian, J.: Receipt-free mix-type voting scheme –A practical solution to the implementation of voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)Google Scholar
  27. 27.
    Sako, K.: A Network Voting System Using a Mix-net in a Japanese Private Organization. In: DIMACS Workshop on Electronic Voting – Theory and Practice (2004)Google Scholar
  28. 28.
    Schnorr, C.-P., Jakobsson, M.: Security of Signed ElGamal Encryption. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 73–89. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  29. 29.
    Shoup, V., Gennaro, R.: Securing Threshold Cryptosystems against Chosen Ciphertext Attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 1–16. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  30. 30.
    Tsiounis, Y., Yung, M.: On the Security of ElGamal Based Encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 117–134. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  31. 31.
    Wikström, D.: A Universally Composable Mix-Net. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 317–335. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  32. 32.
    Zhang, R., et al.: On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security? In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 360–374. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jun Furukawa
    • 1
  • Kazue Sako
    • 1
  1. 1.NEC CorporationKawasakiJapan

Personalised recommendations