Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
ISC '01 Proceedings of the 4th International Conference on Information Security
M+1-st Price Auction Using Homomorphic Encryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Batch zero-knowledge proof and verification and its applications
ACM Transactions on Information and System Security (TISSEC)
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Batch Processing for Proofs of Partial Knowledge and Its Applications
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Batch ZK Proof and Verification of OR Logic
Information Security and Cryptology
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A second-price sealed-bid auction with verifiable discriminant of ρo-th root
FC'02 Proceedings of the 6th international conference on Financial cryptography
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Non-interactive zero-knowledge arguments for voting
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A secure and efficient proof of integer in an interval range
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Batch proofs of partial knowledge
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
A batch proof and verification technique by Chida and Yamamoto is extended to work in a more general scenario. The new batch proof and verification technique is more useful and can save more cost than the original technique. An application of the new batch proof and verification technique is range proof, which proves that a secret integer is in an interval range. Like the most resent and advanced range proof protocol by Camenisch, Chaabouni and Shelat in Asiacrypt2008, the new range proof technique is especially suitable for practical small ranges, but more efficient and stronger in security than the former. The new range proof technique is very efficient and more efficient than the existing solutions in practical small ranges. Moreover, it achieves stronger security and stronger privacy (perfect honest-verifier zero knowledge) than most of the existing range proof schemes.