Abstract
This paper addresses the security and efficiency issues of the Mix-net based on permutation networks introduced in [1]. We first show that the original construction results in a Mix-net that yields biased permutation, so it gives some advantage to adversaries. A simple repair is provided. We then observe that one of the original schemes can be improved so that the servers and verifier enjoy more efficient computation and communication.
Cite
CITATION STYLE
Abe, M., & Hoshino, F. (2001). Remarks on mix-network based on permutation networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1992, pp. 317–324). Springer Verlag. https://doi.org/10.1007/3-540-44586-2_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
