A secure and efficient proof of integer in an interval range
From MaRDI portal
Recommendations
Cites work
- A group signature scheme with improved efficiency. (Extended abstract)
- A practical and provable 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 publicly verifiable secret sharing schemes with fast or delayed recovery
- Efficient signature generation by smart cards
- Fair encryption of RSA keys
- Fast batch verification for modular exponentiation and digital signatures
- Non-interactive Zero-Knowledge Arguments for Voting
- Proofs of partial knowledge and simplified design of witness hiding protocols
- Public-key cryptosystems based on composite degree residuosity classes
- Receipt-free electronic voting scheme with a tamper-resistant randomizer
- Secure signature schemes based on interactive protocols
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)