An efficient publicly verifiable mix-net for long inputs

Jun Furukawa*, Kazue Sako

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (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].

Original languageEnglish
Pages (from-to)113-127
Number of pages15
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number1
Publication statusPublished - 2007 Jan
Externally publishedYes


  • Efficient
  • Hybrid-mix
  • Multiple encryption
  • Public verifiability

ASJC Scopus subject areas

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


Dive into the research topics of 'An efficient publicly verifiable mix-net for long inputs'. Together they form a unique fingerprint.

Cite this