A general, flexible and efficient proof of inclusion and exclusion

DOI10.1007/978-3-642-19074-2_3zbMATH Open1284.94099OpenAlexW3023850498MaRDI QIDQ3073693FDOQ3073693

Authors: 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

Recommendations

• scientific article; zbMATH DE number 697829
• Efficient Protocols for Set Membership and Range Proofs
• Efficient proofs that a committed number lies in an interval
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Non-Interactive Zero-Knowledge Proofs of Non-Membership

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Universal Accumulators with Efficient Nonmembership Proofs
• Efficient signature generation by smart cards
• Title not available (Why is that?)
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• The Knowledge Complexity of Interactive Proof Systems
• Efficient Protocols for Set Membership and Range Proofs
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient proofs that a committed number lies in an interval
• Advances in Cryptology - ASIACRYPT 2003
• Title not available (Why is that?)
• Distributed Provers with Applications to Undeniable Signatures
• Non-interactive Zero-Knowledge Arguments for Voting
• Title not available (Why is that?)
• Progress in Cryptology - INDOCRYPT 2004

Cited In (3)

• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Title not available (Why is that?)
• A Generic Algorithm for Solving Inclusions

This page was built for publication: A general, flexible and efficient proof of inclusion and exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073693)