Efficient Protocols for Set Membership and Range Proofs
From MaRDI portal
Publication:3600378
Recommendations
Cites work
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Cryptology - EUROCRYPT 2004
- Classroom Note: Putting Constraints in Optimization for First-Year Calculus Students
- Efficient proofs that a committed number lies in an interval
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 1440068 (Why is no real title available?)
- Non-interactive Zero-Knowledge Arguments for Voting
- Pairings for cryptographers
- Public Key Cryptography - PKC 2005
- Public Key Cryptography - PKC 2005
- Public Key Cryptography - PKC 2006
- Security Analysis of the Strong Diffie-Hellman Problem
- Simulatable Adaptive Oblivious Transfer
Cited in
(39)- Efficient range proofs with transparent setup from bounded integer commitments
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Foundations of fully dynamic group signatures
- Privacy-enhanced remote data integrity checking with updatable timestamp
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Foundations of fully dynamic group signatures
- New Techniques for Non-interactive Shuffle and Range Arguments
- Group to group commitments do not shrink
- Signatures and efficient proofs on committed graphs and NP-statements
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Secure authenticated comparisons
- A general, flexible and efficient proof of inclusion and exclusion
- A secure and efficient proof of integer in an interval range
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Rate-limited secure function evaluation
- PAChain: private, authenticated and auditable consortium blockchain
- Efficient proofs that a committed number lies in an interval
- Compact E-Cash and Simulatable VRFs Revisited
- Universally Composable Adaptive Priced Oblivious Transfer
- Batch range proof for practical small ranges
- QA-NIZK arguments of same opening for bilateral commitments
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Efficient threshold zero-knowledge with applications to user-centric protocols
- Primary-secondary-resolver membership proof systems
- Efficient Non-interactive Range Proof
- Removing the strong RSA assumption from arguments over the integers
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- On server trust in private proxy auctions
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Zero-knowledge range arguments for signed fractional numbers from lattices
- An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
- Scored anonymous credentials
- Non-interactive zero-knowledge functional proofs
- Vector commitments with proofs of smallness: short range proofs and more
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- Verifiable computation for approximate homomorphic encryption schemes
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- CDLS: proving knowledge of committed discrete logarithms with soundness
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
This page was built for publication: Efficient Protocols for Set Membership and Range Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600378)
