How to break a practical MIX and design a new one
From MaRDI portal
Publication:3374937
zbMATH Open1082.94516MaRDI QIDQ3374937FDOQ3374937
Authors: Kaoru Kurosawa, Yvo Desmedt 
Publication date: 1 March 2006
Recommendations
Cited In (26)
- Theory of Cryptography
- Title not available (Why is that?)
- Public Key Cryptography – PKC 2004
- Optimistic Mixing for Exit-Polls
- Randomized partial checking revisited
- A mix-net from any CCA2 secure cryptosystem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Electronic jury voting protocols
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Distributed Verification of Mixing - Local Forking Proofs Model
- A verifiable secret shuffle of homomorphic encryptions
- The reactive simulatability (RSIM) framework for asynchronous systems
- Selected Areas in Cryptography
- Topics in Cryptology – CT-RSA 2004
- An Adaptively Secure Mix-Net Without Erasures
- A Commitment-Consistent Proof of a Shuffle
- Towards a theory of intrusion detection
- Securing Abe's mix-net against malicious verifiers via witness indistinguishability
- Auditable Privacy: On Tamper-Evident Mix Networks
- Shared generation of pseudo-random functions
- Building Reliable Mix Networks with Fair Exchange
- An optimally robust hybrid mix network
This page was built for publication: How to break a practical MIX and design a new one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374937)
