Title
Efficient Decentralized Random Commitment Key Generation For Mixnet Shuffle Proof
Abstract
In this paper, we propose a new commitment key generation method for the mixnet shuffle proof developed by Bayer-Groth in Eurocrypt' 12. The problem of the shuffle proof algorithm is that it gives too much power to a single authority: It has been shown that the authority, who creates commitment keys and generates proofs for verifying electronic voting (e-voting) results, also can produce malicious verification proofs by logging the exponents of commitment keys. We suggest a new way to decentralize the commitment key generation process by allowing multiple parties to jointly participate in the commitment key generation. Therefore, any of the parties, even who operating e-voting system, cannot know the exponents of commitment keys fully. Therefore, our suggestion distributes the power that is concentrated on the single authority and makes the verification process of the proof more sound and prudent.
Year
DOI
Venue
2019
10.1007/978-3-030-39303-8_16
INFORMATION SECURITY APPLICATIONS, WISA 2019
Keywords
Field
DocType
Multi-party computation, E-voting, Commitment
Key generation,Computer science,Theoretical computer science
Conference
Volume
ISSN
Citations 
11897
0302-9743
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Jong-Kil Kim1318.50
Joonsang Baek279452.88
Willy Susilo34823353.18
Yang-wai Chow47216.32