An efficient scheme for proving a shuffle

Jun Furukawa; Kazue Sako

doi:10.1007/3-540-44647-8_22

An efficient scheme for proving a shuffle

Jun Furukawa, Kazue Sako

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

214 Citations (Scopus)

Abstract

In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22nlog n. The length of proof will be only 2 ¹¹n bits in our protocol, opposed to 2¹⁸n bits and 2 ¹⁴nlog n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent.

Original language	English
Title of host publication	Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings
Editors	Joe Kilian
Publisher	Springer Verlag
Pages	368-387
Number of pages	20
ISBN (Print)	3540424563, 9783540424567
DOIs	https://doi.org/10.1007/3-540-44647-8_22
Publication status	Published - 2001
Externally published	Yes
Event	21st Annual International Cryptology Conference, CRYPTO 2001 - Santa Barbara, CA, United States Duration: 2001 Aug 19 → 2001 Aug 23

Publication series

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

Conference

Conference	21st Annual International Cryptology Conference, CRYPTO 2001
Country/Territory	United States
City	Santa Barbara, CA
Period	01/8/19 → 01/8/23

Keywords

Electronic Voting
Mix-net
Permutation
Universal Verifiability

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-44647-8_22

Cite this

Furukawa, J., & Sako, K. (2001). An efficient scheme for proving a shuffle. In J. Kilian (Ed.), Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings (pp. 368-387). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2139 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-44647-8_22

An efficient scheme for proving a shuffle. / Furukawa, Jun; Sako, Kazue.

Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings. ed. / Joe Kilian. Springer Verlag, 2001. p. 368-387 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2139 LNCS).

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

Furukawa, J & Sako, K 2001, An efficient scheme for proving a shuffle. in J Kilian (ed.), Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2139 LNCS, Springer Verlag, pp. 368-387, 21st Annual International Cryptology Conference, CRYPTO 2001, Santa Barbara, CA, United States, 01/8/19. https://doi.org/10.1007/3-540-44647-8_22

Furukawa J, Sako K. An efficient scheme for proving a shuffle. In Kilian J, editor, Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings. Springer Verlag. 2001. p. 368-387. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44647-8_22

@inproceedings{6adb6938699b47bbab3424c195187e61,

title = "An efficient scheme for proving a shuffle",

abstract = "In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22nlog n. The length of proof will be only 2 11n bits in our protocol, opposed to 218n bits and 2 14nlog n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent.",

keywords = "Electronic Voting, Mix-net, Permutation, Universal Verifiability",

author = "Jun Furukawa and Kazue Sako",

year = "2001",

doi = "10.1007/3-540-44647-8_22",

language = "English",

isbn = "3540424563",

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

publisher = "Springer Verlag",

pages = "368--387",

editor = "Joe Kilian",

booktitle = "Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings",

note = "21st Annual International Cryptology Conference, CRYPTO 2001 ; Conference date: 19-08-2001 Through 23-08-2001",

}

TY - GEN

T1 - An efficient scheme for proving a shuffle

AU - Furukawa, Jun

AU - Sako, Kazue

PY - 2001

Y1 - 2001

N2 - In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22nlog n. The length of proof will be only 2 11n bits in our protocol, opposed to 218n bits and 2 14nlog n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent.

AB - In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22nlog n. The length of proof will be only 2 11n bits in our protocol, opposed to 218n bits and 2 14nlog n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent.

KW - Electronic Voting

KW - Mix-net

KW - Permutation

KW - Universal Verifiability

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

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

U2 - 10.1007/3-540-44647-8_22

DO - 10.1007/3-540-44647-8_22

M3 - Conference contribution

AN - SCOPUS:84880857711

SN - 3540424563

SN - 9783540424567

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

SP - 368

EP - 387

BT - Advances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings

A2 - Kilian, Joe

PB - Springer Verlag

T2 - 21st Annual International Cryptology Conference, CRYPTO 2001

Y2 - 19 August 2001 through 23 August 2001

ER -

An efficient scheme for proving a shuffle

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this