Batch range proof for practical small ranges

DOI10.1007/978-3-642-12678-9_8MaRDI QIDQ3558307zbMATH OpenOpenAlexFDO

Authors Kun Peng, Feng Bao

Publication date 4 May 2010

Published in Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12678-9_8

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Recommendations

• Studying a Range Proof Technique — Exception and Optimisation
• A secure and efficient proof of integer in an interval range
• Efficient Non-interactive Range Proof
• Efficient range proofs with transparent setup from bounded integer commitments
• Efficient Protocols for Set Membership and Range Proofs

Cited in

(6)

• A secure and efficient proof of integer in an interval range
• Efficient Non-interactive Range Proof
• Simplified small exponent test for batch verification
• Efficient proofs that a committed number lies in an interval
• Two is better than one: How to securely combine two assumptions
• Logic Programming

This page was built for publication: Batch range proof for practical small ranges

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