- How To Break The Direct RSA-Implementation Of Mixes (Birgit Pfitzmann, Andreas Pfitzmann, 1990)
- MIXes in Mobile Communication Systems: Location Management with Privacy ( Hannes Federrath, Anja Jerichow, Andreas Pfitzmann, 1996)
- A practical mix (Markus Jakobsson, Eurocrypt '98)
- Flash Mixing (Markus Jakobsson, PODC 1999)
- Millimix: Mixing in Small Batches (Markus Jakobsson, Ari Juels, 1999)
-
2000
- Attack for Flash MIX ( Masashi Mitomo, Kaoru Kurosawa, 2000)
- How to break a practical MIX and design a new one (Yvo Desmedt, Kaoru Kurosawa, 2000)
- Mix and Match: Secure Function Evaluation via Ciphertexts (Markus Jakobsson, Ari Juels, 2000)
-
2001
- An Optimally Robust Hybrid Mix Network (Markus Jakobsson, Ari Juels, 2001)
- A Reputation System to Increase MIX-net Reliability ( Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar, 2001)
- [scholar]An Efficient Scheme for Proving a Shuffle (Jun Furukawa, Kazue Sako, Crypto 2001)
- A Verifiable Secret Shuffle and Its Application to E-Voting (Andy Neff, 2001)
-
2002
- Reliable MIX Cascade Networks through Reputation ( Roger Dingledine, Paul Syverson, 2002)
- Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes (Bodo Möller, 2002)
- Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking (Markus Jakobsson, Ari Juels, Ron Rivest, USENIX Security 2002)
-
2003
- [scholar]A Verifiable Secret Shuffle of Homomorphic Encryptions (Jens Groth, PKC 2003)
-
2004
- 105633,1 (Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability)
- Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable Security (Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa, ACNS 2004)
- Fragile Mixing (Michael Reiter, Xiaofeng Wang, ACM CCS 2004)
-
2005
- Public Mixing (Ben Adida, 2005)
- Obfuscated Ciphertext Mixing (Ben Adida, Douglas Wikström, eprint 2005/394)
- pMIX: Untraceability for Small Hiding Groups (Carlos Aguilar Melchor, Yves Deswarte, NCA 2005)
-
2007
- [scholar]A Non-interactive Shuffle with Pairing Based Verifiability (Groth, Lu, Asiacrypt 2007)
-
2008
- [scholar]Sub-Linear Zero-Knowledge Argument for Correctness of a Shuffle (Groth, Ishai, Eurocrypt 2008)
-
2012
- [scholar]Efficient Zero-Knowledge Argument for Correctness of a Shuffle (Stephanie Bayer and Jens Groth, Eurocrypt 2012)
20.05.2012
- [scholar]Efficient Zero-Knowledge Argument for Correctness of a Shuffle (Stephanie Bayer and Jens Groth, Eurocrypt 2012)
![[citeseer]](http://citeseer.ist.psu.edu/icon/cssmall.gif){kind=icon}
gmail.com