Efficient Protocols for Set Membership and Range Proofs

DOI10.1007/978-3-540-89255-7_15zbMath1206.94057OpenAlexW1479826086MaRDI QIDQ3600378

Abhi Shelat, Jan Camenisch, Rafik Chaabouni

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_15

zbMATH Keywords

proofs of knowledgerange proofsbi-linear mapsset membership proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Rate-limited secure function evaluation ⋮ Efficient Non-interactive Range Proof ⋮ Privacy-enhanced remote data integrity checking with updatable timestamp ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ On server trust in private proxy auctions ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Foundations of fully dynamic group signatures ⋮ PAChain: Private, Authenticated and Auditable Consortium Blockchain ⋮ Secure Authenticated Comparisons ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Non-Interactive Zero-Knowledge Proofs of Non-Membership ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ Foundations of Fully Dynamic Group Signatures ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ A Secure and Efficient Proof of Integer in an Interval Range ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• Security Analysis of the Strong Diffie-Hellman Problem
• Non-interactive Zero-Knowledge Arguments for Voting
• Classroom Note: Putting Constraints in Optimization for First-Year Calculus Students
• Advances in Cryptology - EUROCRYPT 2004
• Simulatable Adaptive Oblivious Transfer
• Public Key Cryptography - PKC 2005
• Public Key Cryptography - PKC 2005
• Public Key Cryptography - PKC 2006
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Efficient Protocols for Set Membership and Range Proofs