An efficient scheme for proving a shuffle

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

Volumn 2139 LNCS, Issue , 2001, Pages 368-387

  Furukawa, Jun ^a   Sako, Kazue ^a  

^a NEC CORPORATION   (Japan)

Author keywords

Electronic Voting; Mix net; Permutation; Universal Verifiability

Indexed keywords

CRYPTOGRAPHY; VOTING MACHINES;

BUILDING BLOCKES; EFFICIENT PROTOCOLS; EFFICIENT SCHEMES; EXPONENTIATIONS; LENGTH OF PROOFS; MIX-NET; PERMUTATION; UNIVERSAL VERIFIABILITY; ELECTRONIC VOTING; UNIVERSAL VERIFI-ABILITY;

ELECTRONIC VOTING; CRYPTOGRAPHY;

EID: 84880857711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_22     Document Type: Conference Paper

References (8)

1. M. Abe, Mix-Networks on Permutation Networks, Asiacrypt '99, LNCS 1716, 258-273 (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 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, 174-187 (1994)
5. A. Menezes, C. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 617-619
6. C.A. Neff, Verifiable, Secret Shuffles of ElGamal Encrypted Data, Initial version circulated Mar. 2000, current version submitted to ACMCCS 01
7. W. Ogata, K. Kurosawa, K. Sako and K. Takatani, Fault tolerant anonymous channel, 1st International Conference on Information and Communications Security (ICICS), LNCS 1334, 440-444 (1997)
8. K. Sako and J. Kilian, Receipt-free mix-type voting scheme - A practical solution to the implementation of voting booth, Eurocrypt 95, LNCS 921, 393-403 (1995)