A Secure and Efficient Proof of Integer in an Interval Range

DOI10.1007/978-3-642-25516-8_7zbMath1292.68062OpenAlexW52240562MaRDI QIDQ3104687

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

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

Cites Work

• Efficient signature generation by smart cards
• Batch Range Proof for Practical Small Ranges
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient Protocols for Set Membership and Range Proofs
• Batch ZK Proof and Verification of OR Logic
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Secure and Efficient Proof of Integer in an Interval Range