An Efficient Publicly Verifiable Mix-Net for Long Inputs

Jun FURUKAWA; Kazue SAKO

doi:10.1093/ietfec/e90-a.1.113

An Efficient Publicly Verifiable Mix-Net for Long Inputs

Jun FURUKAWA, Kazue SAKO

Full Text Views

0

Share
Cite this

Summary :

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

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.1 pp.113-127

Publication Date: 2007/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.1.113

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Protocols

Cite this

Copy

Jun FURUKAWA, Kazue SAKO, "An Efficient Publicly Verifiable Mix-Net for Long Inputs" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 1, pp. 113-127, January 2007, doi: 10.1093/ietfec/e90-a.1.113.
Abstract: 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].
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.1.113/_p

Copy

@ARTICLE{e90-a_1_113,
author={Jun FURUKAWA, Kazue SAKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Publicly Verifiable Mix-Net for Long Inputs},
year={2007},
volume={E90-A},
number={1},
pages={113-127},
abstract={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].},
keywords={},
doi={10.1093/ietfec/e90-a.1.113},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - An Efficient Publicly Verifiable Mix-Net for Long Inputs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 113
EP - 127
AU - Jun FURUKAWA
AU - Kazue SAKO
PY - 2007
DO - 10.1093/ietfec/e90-a.1.113
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2007
AB - 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].
ER -