An efficient publicly verifiable mix-net for long inputs

Jun Furukawa*, Kazue Sako

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

研究成果査読

2 被引用数 (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. This paper is the full version of the extended abstract appeared in FC 2006 [10].

本文言語English
ページ(範囲)113-127
ページ数15
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E90-A
1
DOI
出版ステータスPublished - 2007 1
外部発表はい

ASJC Scopus subject areas

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学

フィンガープリント

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

引用スタイル