An efficient publicly verifiable mix-net for long inputs

Jun Furukawa*, Kazue Sako

*この研究の対応する著者

研究成果

6 被引用数 (Scopus)

抄録

We propose here the first efficient publicly verifiable hybrid mix-net. Previous publicly verifiable mix-net was only efficient for short ciphertexts and was not suitable for mixing long messages. Previous hybrid mix-net can mix long messages but did not have public verifiability. The proposed scheme is efficient enough to treat large scale electronic questionnaires of long messages as well as voting with write-ins, and offers public verifiability of the correctness of the tally. The scheme is provably secure if we assume random oracles, semantic security of a one-time symmetric-key cryptosystem, and intractability of decision Diffie-Hellman problem.

本文言語English
ホスト出版物のタイトルFinancial Cryptography and Data Security - 10th International Conference, FC 2006, Revised Selected Papers
出版社Springer Verlag
ページ111-125
ページ数15
ISBN(印刷版)3540462554, 9783540462552
DOI
出版ステータスPublished - 2006
外部発表はい
イベント10th International Conference on Financial Cryptography and Data Security, FC 2006 - , Anguilla
継続期間: 2006 2 272006 3 2

出版物シリーズ

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

Conference

Conference10th International Conference on Financial Cryptography and Data Security, FC 2006
国/地域Anguilla
Period06/2/2706/3/2

ASJC Scopus subject areas

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

フィンガープリント

「An efficient publicly verifiable mix-net for long inputs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル