Efficient Non-interactive Range Proof

DOI10.1007/978-3-642-02882-3_15MaRDI QIDQ5323058zbMATH OpenOpenAlexFDO

Authors Tsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang

Publication date 23 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_15

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A secure and efficient proof of integer in an interval range
• Efficient range proofs with transparent setup from bounded integer commitments
• New Techniques for Non-interactive Shuffle and Range Arguments
• Efficient Protocols for Set Membership and Range Proofs
• Batch range proof for practical small ranges

Cites work

• Advances in Cryptology - ASIACRYPT 2003
• Advances in Cryptology - EUROCRYPT 2004
• Compact E-Cash
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient proofs that a committed number lies in an interval
• Efficient Protocols for Set Membership and Range Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1186869 (Why is no real title available?)
• scientific article; zbMATH DE number 1303150 (Why is no real title available?)
• k-Times Anonymous Authentication (Extended Abstract)
• Non-interactive Zero-Knowledge Arguments for Voting
• Randomized algorithms in number theory
• Security Analysis of the Strong Diffie-Hellman Problem
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• The knowledge complexity of quadratic residuosity languages
• The random oracle methodology, revisited.
• Theory of Cryptography

Cited in

(11)

• Efficient range proofs with transparent setup from bounded integer commitments
• Secure authenticated comparisons
• A secure and efficient proof of integer in an interval range
• Practical Range Proof for Cryptocurrency Monero with Provable Security
• Efficient proofs that a committed number lies in an interval
• Batch range proof for practical small ranges
• Efficient Protocols for Set Membership and Range Proofs
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Zero-knowledge arguments for subverted RSA groups
• On server trust in private proxy auctions

This page was built for publication: Efficient Non-interactive Range Proof

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