Paper Info
Title
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
Abstract
In this paper, we propose a scheme to simultaneously prove the correctness of both shuffling and decryption. Our scheme is the most efficient of all previous schemes, as a total, in proving the correctness of both shuffling and decryption of ElGamal ciphertexts. We also propose a formal definition for the core requirement of unlinkability in verifiable shuffle-decryption, and then prove that our scheme satisfies this requirement. The proposed definition may be also useful for proving the security of verifiable shuffle-decryption, hybrid mix network, and other mix-nets.
Year
DOI
Venue
2004
10.1007/978-3-540-24632-9_23
Lecture Notes in Computer Science
Keywords
Field
DocType
voting,shuffle,decryption,permutation hiding
Computer science,Cryptography,Correctness,Theoretical computer science,Formal description,Formal specification,Verifiable secret sharing,Shuffling,Mix network,ElGamal encryption,Distributed computing
Conference
Volume
ISSN
Citations 
2947
0302-9743
23
PageRank 
References 
Authors
1.37
14
1
Name
Order
Citations
PageRank
Jun Furukawa1926.64