Skip to main content
placeholder image

Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof

Chapter


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.

Publication Date


  • 2020

Citation


  • Kim, J., Baek, J., Susilo, W., & Chow, Y. W. (2020). Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. In Unknown Book (Vol. 11897 LNCS, pp. 206-216). doi:10.1007/978-3-030-39303-8_16

International Standard Book Number (isbn) 13


  • 9783030393021

Scopus Eid


  • 2-s2.0-85079088723

Book Title


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

Start Page


  • 206

End Page


  • 216

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.

Publication Date


  • 2020

Citation


  • Kim, J., Baek, J., Susilo, W., & Chow, Y. W. (2020). Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. In Unknown Book (Vol. 11897 LNCS, pp. 206-216). doi:10.1007/978-3-030-39303-8_16

International Standard Book Number (isbn) 13


  • 9783030393021

Scopus Eid


  • 2-s2.0-85079088723

Book Title


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

Start Page


  • 206

End Page


  • 216