An efficient publicly verifiable mix-net for long inputs

Jun Furukawa, Kazue Sako

研究成果: Article

1 引用 (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
外部発表Yes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

フィンガープリント An efficient publicly verifiable mix-net for long inputs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用