An efficient publicly verifiable mix-net for long inputs

Jun Furukawa*, Kazue Sako

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 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.

Original languageEnglish
Title of host publicationFinancial Cryptography and Data Security - 10th International Conference, FC 2006, Revised Selected Papers
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540462554, 9783540462552
Publication statusPublished - 2006
Externally publishedYes
Event10th International Conference on Financial Cryptography and Data Security, FC 2006 - , Anguilla
Duration: 2006 Feb 272006 Mar 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4107 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Financial Cryptography and Data Security, FC 2006


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this