An Efficient Publicly Verifiable Mix-Net for Long Inputs

This publication has 26 references indexed in Scilit:

• Efficient and Verifiable Shuffling and Shuffle-Decryption
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
• Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
  Lecture Notes in Computer Science, 2004
• Flaws in Some Robust Optimistic Mix-Nets
  2003
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
  SIAM Journal on Computing, 2003
• Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
  2001
• An Efficient Scheme for Proving a Shuffle
  2001
• Quantum Gambling
  Physical Review Letters, 1999
• Mix-Networks on Permutation Networks
  1999
• Everything Provable is Provable in Zero-Knowledge
  1990
• Untraceable electronic mail, return addresses, and digital pseudonyms
  Communications of the ACM, 1981