Efficient and verifiable shuffling and shuffle-decryption

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 1, 2005, Pages 172-188

  Furukawa, Jun ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Complete permutation hiding; Decryption; Shuffle; Voting

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CRYPTOGRAPHY;

COMPLETE PERMUTATION HIDING; DECRYPTION; SHUFFLE; VOTING;

NETWORK PROTOCOLS;

EID: 27544495621     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/E88-A.1.172     Document Type: Conference Paper

References (25)

1. M. Abe, "Mix-networks on permutation networks," Advances in Cryptology - ASIACRYPT'99, LNCS 1716, pp.258-273, Springer-Verlag, 1999.
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," Commun. ACM, vol.24, no.2, pp.84-88, 1981.
4. R. Cramer, I. Damgård, and B. Schoenmakers, "Proofs of partial knowledge and simplified design of witness hiding protocols," Crypto'94, LNCS 839, pp. 174-187, 1994.
5. R. Cramer and V. Shoup, "A practical key cryptosystem provably secure against adaptive chosen ciphertext attack," Advances in Cryptology-Crypto'98, LNCS 1462, pp.13-25, 1998.
6. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," Advances in Cryptology - CRYPTO'86, LNCS 263, pp.186-194, 1986.
7. J. Furakawa, K. Mori, S. Obana, and K. Sako, "An implementation of a universally verifiable electronic voting protocol based on shuffling," Financial Cryptography 2002.
8. J. Furukawa and K. Sako, "An efficient protocol for proving a shuffle," Advances in Cryptology-CRYPTO 2001, LNCS 2139, pp.368-387, 2001.
9. O. Goldreich, "A uniform - complexity treatment of encryption and zero-knowledge," J. Cryptol., vol.6, pp.21-53, 1993.
10. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., vol.28, no.2, pp.270-299, 1984.
11. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, and A. Juels, "Optimistic mixing for exit-polls," Asiacrypt 2002, LNCS 2501, pp.451-465, 2002.
12. J. Groth, "A verifiable secret shuffle of holomorphic encryptions," Public Key Cryptography-PKC 2003, LNCS 2567, pp. 145-160, 2003.
13. M. Jakobsson, "A practical mix," Eurocrypt'98, LNCS 1403, pp.448-461, 1998.
14. A. Juels and M. Jakobsson, "An optimally robust hybrid mix network," Proc. 20th Annual ACM Symposium on Principles of Distributed Computation, 2001.
15. A. Menezes, C. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, pp.617-627, CRC Press, 1997.
16. C.A. Neff, "A verifiable secret shuffle and its application to Evoting," ACMCCS 01, pp.116-125, 2001.
17. L. Nguyen, R. Safavi-Naini, and K. Kurosawa, "Verifiable shuffles: A formal model and a Paillier-based efficient construction with provable security," ACNS 2004, pp.61-75, 2004.
18. M. Ohkubo and M. Abe, "A length-invariant hybrid mix," Asiacrypt 2000, LNCS 1976, pp.178-191, 2000.
19. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani, "Fault tolerant anonymous channel," ICICS, LNCS 1334, pp.440-444, 1997.
20. C. Park, K. Itoh, and K. Kurosawa, "Efficient anonymous channel and all/nothing election protocol," Eurocrypt'93, pp.248-259, 1993.
21. K. Sako, "Electronic voting protocols allowing open objection to the tally," IEICE Trans. Fundamentals, vol.E77-A, no.l, pp.24-30, Jan. 1994.
22. K. Sako and J. Kilian, "Receipt-free mix-type voting protocolA practical solution to the implementation of voting booth," Eurocrypt'95, LNCS 921, pp.393-403, 1995.
23. C.P. Schnorr, "Efficient signature generation by smart cards," J. Cryptol., vol.4, pp.161-174, 1991.
24. C.P. Schnorr and M. Jakobsson, "Security of signed ElGamal encryption," ASIACRYPT 2000, pp73-89, 2000.
25. V. Shoup and R. Gennaro, "Securing threshold cryptosystems against chosen ciphertext attack," EUROCRYPT 1998, pp.1-16, 1998.