Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
A Group Signature Scheme with Improved Efficiency
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
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
Receipt-free electronic voting scheme with a tamper-resistant randomizer
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Non-interactive zero-knowledge arguments for voting
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Batch range proof for practical small ranges
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
A new range proof scheme is proposed in this paper. We study a related technique, range test, and show how its idea can be used to design a more advanced range proof technique. The main advantage of the new range proof technique over the existing solutions is that it achieves the best trade-off between soundness, privacy and efficiency. Is achieves information-theoretic and absolutely precise soundness and thus is more secure than those range proof schemes with conditional soundness. It achieves formally provable zero knowledge in privacy and thus is more secure than those range proof schemes without formally proven zero knowledge. It only needs a small constant number of computations and employs normal-length parameters and thus is more efficient than those range proof schemes needing super-linear cost or extra large integers.