Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 319-332
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling2003
- A Verifiable Secret Shuffe of Homomorphic Encryptions2002
- Optimistic Mixing for Exit-Polls2002
- An Efficient Scheme for Proving a Shuffle2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- Mix-Networks on Permutation Networks1999
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack1998
- A practical mix1998
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981