Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof

Jongkil Kim; Joonsang Baek; Willy Susilo; Yang Wai Chow

doi:10.1007/978-3-030-39303-8_16

Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof

Jongkil Kim, Joonsang Baek, Willy Susilo, Yang Wai Chow

Cyber Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers
Editors	Ilsun You
Publisher	Springer
Pages	206-216
Number of pages	11
ISBN (Print)	9783030393021
DOIs	https://doi.org/10.1007/978-3-030-39303-8_16
State	Published - 2020
Event	20th World Conference on Information Security Applications, WISA 2019 - Jeju Island, Korea, Republic of Duration: 21 Aug 2019 → 24 Aug 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11897 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th World Conference on Information Security Applications, WISA 2019
Country/Territory	Korea, Republic of
City	Jeju Island
Period	21/08/19 → 24/08/19

Keywords

Commitment
E-voting
Multi-party computation

Access to Document

10.1007/978-3-030-39303-8_16

Cite this

Kim, J., Baek, J., Susilo, W., & Chow, Y. W. (2020). Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. In I. You (Ed.), Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers (pp. 206-216). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11897 LNCS). Springer. https://doi.org/10.1007/978-3-030-39303-8_16

Kim, Jongkil ; Baek, Joonsang ; Susilo, Willy et al. / Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers. editor / Ilsun You. Springer, 2020. pp. 206-216 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{aaee32c9c0c147a7a29dc8f5a07aac50,

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{\textquoteright} 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.",

keywords = "Commitment, E-voting, Multi-party computation",

author = "Jongkil Kim and Joonsang Baek and Willy Susilo and Chow, {Yang Wai}",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 20th World Conference on Information Security Applications, WISA 2019 ; Conference date: 21-08-2019 Through 24-08-2019",

year = "2020",

doi = "10.1007/978-3-030-39303-8_16",

language = "English",

isbn = "9783030393021",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "206--216",

editor = "Ilsun You",

booktitle = "Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers",

}

Kim, J, Baek, J, Susilo, W & Chow, YW 2020, Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. in I You (ed.), Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11897 LNCS, Springer, pp. 206-216, 20th World Conference on Information Security Applications, WISA 2019, Jeju Island, Korea, Republic of, 21/08/19. https://doi.org/10.1007/978-3-030-39303-8_16

Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. / Kim, Jongkil; Baek, Joonsang; Susilo, Willy et al.
Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers. ed. / Ilsun You. Springer, 2020. p. 206-216 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11897 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof

AU - Kim, Jongkil

AU - Baek, Joonsang

AU - Susilo, Willy

AU - Chow, Yang Wai

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - Commitment

KW - E-voting

KW - Multi-party computation

UR - http://www.scopus.com/inward/record.url?scp=85079088723&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-39303-8_16

DO - 10.1007/978-3-030-39303-8_16

M3 - Conference contribution

AN - SCOPUS:85079088723

SN - 9783030393021

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

SP - 206

EP - 216

BT - Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers

A2 - You, Ilsun

PB - Springer

T2 - 20th World Conference on Information Security Applications, WISA 2019

Y2 - 21 August 2019 through 24 August 2019

ER -

Kim J, Baek J, Susilo W, Chow YW. Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof. In You I, editor, Information Security Applications - 20th International Conference, WISA 2019, Revised Selected Papers. Springer. 2020. p. 206-216. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-39303-8_16

Efficient Decentralized Random Commitment Key Generation for Mixnet Shuffle Proof

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this