Efficient Non-interactive Range Proof

Authors:
Tsz Hon Yuen;Qiong Huang;Yi Mu;Willy Susilo;Duncan S. Wong;Guomin Yang
Affiliations:
University of Wollongong, Australia;City University of Hong Kong, China;University of Wollongong, Australia;University of Wollongong, Australia;City University of Hong Kong, China;City University of Hong Kong, China
Venue:
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Year:
2009

Citing 14
Cited 2

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The knowledge complexity of quadratic residuosity languages

Theoretical Computer Science
Gradual and Verifiable Release of a Secret

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The random oracle methodology, revisited

Journal of the ACM (JACM)
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
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
Efficient non-interactive proof systems for bilinear groups

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Simulation-sound NIZK proofs for a practical language and constant size group signatures

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Non-interactive zero-knowledge arguments for voting

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Compact e-cash

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Security analysis of the strong diffie-hellman problem

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

On server trust in private proxy auctions

Electronic Commerce Research
Secure authenticated comparisons

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the first constant size non-interactive range proof which is not based on the heuristic Fiat-Shamir transformation and whose security does not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size range proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, perfect soundness and composable zero-knowledge under a conventional number-theoretic assumption, namely the Subgroup Decision Problem.