IEICE TRANSACTIONS on Fundamentals
Efficient and Verifiable Shuffling and Shuffle-Decryption
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.1 pp.172-188
- Publication Date
- 2005/01/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.1.172
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Application
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jun FURUKAWA, "Efficient and Verifiable Shuffling and Shuffle-Decryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 1, pp. 172-188, January 2005, doi: 10.1093/ietfec/e88-a.1.172.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.1.172/_p
Copy
@ARTICLE{e88-a_1_172,
author={Jun FURUKAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient and Verifiable Shuffling and Shuffle-Decryption},
year={2005},
volume={E88-A},
number={1},
pages={172-188},
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.},
keywords={},
doi={10.1093/ietfec/e88-a.1.172},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Efficient and Verifiable Shuffling and Shuffle-Decryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 172
EP - 188
AU - Jun FURUKAWA
PY - 2005
DO - 10.1093/ietfec/e88-a.1.172
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2005
AB - 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.
ER -
English
