A secure and efficient proof of integer in an interval range

DOI10.1007/978-3-642-25516-8_7MaRDI QIDQ3104687zbMATH OpenOpenAlexFDO

Authors Kun Peng

Publication date 16 December 2011

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25516-8_7

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Batch range proof for practical small ranges
• Efficient Non-interactive Range Proof
• Studying a Range Proof Technique — Exception and Optimisation
• Efficient proofs that a committed number lies in an interval
• Efficient range proofs with transparent setup from bounded integer commitments

Cites work

• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Advances in Cryptology - ASIACRYPT 2003
• Batch range proof for practical small ranges
• Batch ZK Proof and Verification of OR Logic
• Efficient proofs that a committed number lies in an interval
• Efficient Protocols for Set Membership and Range Proofs
• Efficient signature generation by smart cards
• Fair encryption of RSA keys
• scientific article; zbMATH DE number 1302792 (Why is no real title available?)
• scientific article; zbMATH DE number 1303126 (Why is no real title available?)
• scientific article; zbMATH DE number 1031000 (Why is no real title available?)
• scientific article; zbMATH DE number 1950626 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• scientific article; zbMATH DE number 1424186 (Why is no real title available?)
• Non-interactive Zero-Knowledge Arguments for Voting
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Cited in

(10)

• Efficient range proofs with transparent setup from bounded integer commitments
• 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
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• Efficient Non-interactive Range Proof
• Practical and Secure Solutions for Integer Comparison
• A Novel Range Test
• Verifiable partial escrow of integer factors.
• Zero-knowledge range arguments for signed fractional numbers from lattices

This page was built for publication: A secure and efficient proof of integer in an interval range

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