Efficient Non-interactive Range Proof

DOI10.1007/978-3-642-02882-3_15zbMath1248.94098OpenAlexW1582366923MaRDI QIDQ5323058

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

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)

Related Items

On server trust in private proxy auctions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Secure Authenticated Comparisons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The knowledge complexity of quadratic residuosity languages
• The random oracle methodology, revisited
• Security Analysis of the Strong Diffie-Hellman Problem
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient Protocols for Set Membership and Range Proofs
• Randomized algorithms in number theory
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Advances in Cryptology - EUROCRYPT 2004
• Compact E-Cash
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• k-Times Anonymous Authentication (Extended Abstract)
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003