A General, Flexible and Efficient Proof of Inclusion and Exclusion

DOI10.1007/978-3-642-19074-2_3zbMath1284.94099OpenAlexW3023850498MaRDI QIDQ3073693

Kun Peng

Publication date: 11 February 2011

Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Non-Interactive Zero-Knowledge Proofs of Non-Membership

Cites Work

• Efficient signature generation by smart cards
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient Protocols for Set Membership and Range Proofs
• Universal Accumulators with Efficient Nonmembership Proofs
• The Knowledge Complexity of Interactive Proof Systems
• Distributed Provers with Applications to Undeniable Signatures
• Advances in Cryptology - CRYPTO 2003
• Progress in Cryptology - INDOCRYPT 2004
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A General, Flexible and Efficient Proof of Inclusion and Exclusion