Distributed Verification of Mixing - Local Forking Proofs Model
Authors:
- 12 August 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 128-140
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Offline/Online Mixing2007
- An Efficient Publicly Verifiable Mix-Net for Long InputsLecture Notes in Computer Science, 2006
- Provable Unlinkability against Traffic AnalysisLecture Notes in Computer Science, 2004
- Efficient, Verifiable Shuffle Decryption and Its Requirement of UnlinkabilityLecture Notes in Computer Science, 2004
- Rapid Mixing and Security of Chaum’s Visual Electronic Voting2003
- Computer Aided Systems Theory - EUROCAST 2003Lecture Notes in Computer Science, 2003
- A Verifiable Secret Shuffe of Homomorphic Encryptions2002
- An Efficient Scheme for Proving a Shuffle2001
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- Branching Processes1972