Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
An optimally robust hybrid mix network
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Mixing for Exit-Polls
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Lenient/Strict Batch Verification in Several Groups
ISC '01 Proceedings of the 4th International Conference on Information Security
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Access with Fast Batch Verifiable Anonymous Credentials
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
Batch ZK Proof and Verification of OR Logic
Information Security and Cryptology
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
A DAA scheme using batch proof and verification
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Prêt à voter with confirmation codes
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Batch range proof for practical small ranges
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
A (corrected) DAA scheme using batch proof and verification
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
The batch verification technique of Bellare et al. is extended to verification of several frequently employed zero-knowledge proofs. The new techniques are correct, sound, efficient, and can be widely applied. Specific applications are discussed in detail, including batch ZK proof and verification of validity of encryption (or reencryption) and batch ZK proof and verification of validity of decryption. Considerable efficiency improvements are gained in these two applications without compromising security. As a result, efficiency of the practical cryptographic systems (such as mix networks) based on these two applications is dramatically improved.