An efficient scheme for proving a shuffle

Jun Furukawa, Kazue Sako

研究成果: Conference contribution

210 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルAdvances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings
編集者Joe Kilian
出版社Springer Verlag
ページ368-387
ページ数20
ISBN(印刷版)3540424563, 9783540424567
DOI
出版ステータスPublished - 2001
外部発表はい
イベント21st Annual International Cryptology Conference, CRYPTO 2001 - Santa Barbara, CA, United States
継続期間: 2001 8月 192001 8月 23

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2139 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference21st Annual International Cryptology Conference, CRYPTO 2001
国/地域United States
CitySanta Barbara, CA
Period01/8/1901/8/23

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An efficient scheme for proving a shuffle」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル