Flash mixing
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
By introducing novel methods for robust protocol design, to substitute for costly zero-knowledge schemes, we are able to produce a mixing scheme with significantly lower costs of operation than all previously known such schemes. The scheme takes a list of ElGamal encrypted messages, and produces as output a permuted list of encryptions of the same plaintext messages, such that corresponding items of the input and output cannot be correlated. For reasonably large inputs, the cost per...Keywords
This publication has 7 references indexed in Scilit:
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsPublished by Springer Nature ,2000
- Universally verifiable mix-net with verification work independent of the number of mix-serversPublished by Springer Nature ,1998
- Keying Hash Functions for Message AuthenticationPublished by Springer Nature ,1996
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- A practical secret voting scheme for large scale electionsPublished by Springer Nature ,1993
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979