How to Break a Practical MIX and Design a New One
- 12 May 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 557-572
- https://doi.org/10.1007/3-540-45539-6_39
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Threshold cryptosystemsPublished by Springer Nature ,2001
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsPublished by Springer Nature ,2000
- Mix-Networks on Permutation NetworksLecture Notes in Computer Science, 1999
- Relations among notions of security for public-key encryption schemesPublished by Springer Nature ,1998
- Universally verifiable mix-net with verification work independent of the number of mix-serversLecture Notes in Computer Science, 1998
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- A practical secret voting scheme for large scale electionsLecture Notes in Computer Science, 1993
- Undeniable SignaturesLecture Notes in Computer Science, 1990
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979