An optimally robust hybrid mix network
- 1 August 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 284-292
- https://doi.org/10.1145/383962.384046
Abstract
We present a mix network that achieves efficient integration of public-key and symmetric-key operations. This hybrid mix network is capable of natural processing of arbitrarily long input elements, and is fast in both practical and asymptotic senses. While the overhead in the size of input elements is linear in the number of mix servers, it is quite small in practice. In contrast to previous hybrid constructions, ours has optimal robustness, that is, robustness against any minority coalition of malicious servers.Keywords
This publication has 6 references indexed in Scilit:
- Flash mixingPublished by Association for Computing Machinery (ACM) ,1999
- A practical mixPublished by Springer Nature ,1998
- Universally verifiable mix-net with verification work independent of the number of mix-serversLecture Notes in Computer Science, 1998
- Pseudorandomness and Cryptographic ApplicationsPublished by Walter de Gruyter GmbH ,1996
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981