The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Este artigo apresenta uma Mix-net universalmente verificável onde a quantidade de trabalho realizado por um verificador é independente do número de servidores mix. Além disso, a tarefa computacional de cada servidor mix é constante em relação ao número de servidores mix, exceto para algumas tarefas insignificantes, como calcular a função hash, quando nenhuma interrupção ocorre. O esquema também fornece robustez.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Masayuki ABE, "Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 7, pp. 1431-1440, July 2000, doi: .
Abstract: This paper presents a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant with regard to the number of mix-servers except for some negligible tasks like computing hash function when no disruption occurs. The scheme also provides robustness.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_7_1431/_p
Copiar
@ARTICLE{e83-a_7_1431,
author={Masayuki ABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers},
year={2000},
volume={E83-A},
number={7},
pages={1431-1440},
abstract={This paper presents a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant with regard to the number of mix-servers except for some negligible tasks like computing hash function when no disruption occurs. The scheme also provides robustness.},
keywords={},
doi={},
ISSN={},
month={July},}
Copiar
TY - JOUR
TI - Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1431
EP - 1440
AU - Masayuki ABE
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2000
AB - This paper presents a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant with regard to the number of mix-servers except for some negligible tasks like computing hash function when no disruption occurs. The scheme also provides robustness.
ER -