Efficient, verifiable shuffle decryption and its requirement of unlinkability

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

Volumn 2947, Issue , 2004, Pages 319-332

  Furukawa, Jun ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Decryption; Permutation Hiding; Shuffle; Voting

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CIPHERTEXTS; DECRYPTION; FORMAL DEFINITION; HYBRID MIX; PERMUTATION HIDING; SHUFFLE; UNLINKABILITY; VOTING;

CRYPTOGRAPHY;

EID: 35048861845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_23     Document Type: Article

References (22)

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, Communications of the 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. Furukawa, Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability (with appendixes), Available online, http://eprint.iacr.org, or from the author via e-mail.
8. J. Furukawa, K. Mori, S. Obana, and K. Sako, An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling, Financial Cryptography 2002.
9. J. Furukawa and K. Sako, An Efficient Scheme for Proving a Shuffle, Advances in Cryptology - CRYPTO 2001, LNCS 2139 pp. 368-387 (2001).
10. O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, Journal of Cryptology, Vol. 6, pp. 21-53, (1993).
11. S. Goldwasser and S. Micali, Probabilistic Encryption, JCSS, Vol. 28, No. 2, pp. 270-299, (1984).
12. P. Golle, S. Zhong, D. Boneh, M. Jakobsson, and A. Juels, Optimistic mixing for exit-polls, Asiacrypt 2002, LNCS 2501, pp. 451-465 (2002)
13. J. Groth, A Verifiable Secret Shuffle of Holomorphic Encryptions, Public Key Cryptography - PKC 2003, LNCS 2567 pp. 145-160 (2003)
14. M. Jakobsson, A practical mix, Eurocrypt '98, LNCS 1403, pp. 448-461 (1998)
15. A. Juels and M. Jakobsson, An optimally robust hybrid mix network, Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation, 2001
16. A. Menezes, C. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, pp. 617-627, (1997).
17. C.A. Neff, A Verifiable Secret Shuffle and its Application to E-Voting, ACMCCS 01 pp. 116-125 (2001).
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. K. Sako, Electronic voting schemes allowing open objection to the tally, Transactions of IEICE, Vol. E77-A No. 1, Jan. (1994).
21. K. Sako and J. Kilian, Receipt-free mix-type voting scheme -A practical solution to the implementation of voting booth, Eurocrypt '95, LNCS 921, pp. 393-403 (1995).
22. C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, 4, pp. 161-174, (1991).