Paper Info
Title
Efficient And Verifiable Shuffling And Shuffle-Decryption
Abstract
In this paper, we propose an efficient protocol for proving the correctness of shuffling and an efficient protocol for simultaneously proving the correctness of both shuffling and decryption. The former protocol is the most efficient in computational and communication complexity among 3-move honest verifier perfect zero-knowledge protocols for proving a shuffling of ElGamal cipher-texts. The latter protocol is the most efficient in computational, communication, and round complexity, as a whole, in proving the correctness of both shuffling and decryption of ElGamal cipher-texts. The proposed protocols will be a building block of an efficient, universally verifiable mix-net, whose application to voting systems is prominent.
Year
DOI
Venue
2005
10.1093/ietfec/E88-A.1.172
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
Field
DocType
voting, shuffle, decryption, complete permutation hiding
Round complexity,Voting,Correctness,Theoretical computer science,Communication complexity,Shuffling,Verifiable secret sharing,ElGamal encryption,Mathematics
Journal
Volume
Issue
ISSN
E88A
1
0916-8508
Citations 
PageRank 
References 
36
1.27
0
Authors
1
Name
Order
Citations
PageRank
Jun Furukawa1926.64