Efficient non-interactive range proof

Tsz Hon Yuen; Qiong Huang; Yi Mu; Willy Susilo; Duncan S. Wong; Guomin Yang

doi:10.1007/978-3-642-02882-3_15

Efficient non-interactive range proof

Tsz Hon Yuen
, Qiong Huang
, Yi Mu
, Willy Susilo
, Duncan S. Wong
, Guomin Yang

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

12 Citations (Scopus)

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.

Original language	English
Title of host publication	Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings
Publisher	Springer
Pages	138-147
Number of pages	10
ISBN (Print)	3642028810, 9783642028816
DOIs	https://doi.org/10.1007/978-3-642-02882-3_15
Publication status	Published - 2009
Externally published	Yes
Event	Annual International Conference on Computing and Combinatorics 2009 - Niagara Falls, United States of America Duration: 13 Jul 2009 → 15 Jul 2009 Conference number: 15th https://link.springer.com/book/10.1007/978-3-642-02882-3

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	5609
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Annual International Conference on Computing and Combinatorics 2009
Abbreviated title	COCOON 2009
Country/Territory	United States of America
City	Niagara Falls
Period	13/07/09 → 15/07/09
Internet address	https://link.springer.com/book/10.1007/978-3-642-02882-3

Access to Document

10.1007/978-3-642-02882-3_15

Cite this

@inproceedings{8ace4f887f4d4a22b9fad62924d10c12,

title = "Efficient non-interactive range proof",

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.",

author = "Yuen, \{Tsz Hon\} and Qiong Huang and Yi Mu and Willy Susilo and Wong, \{Duncan S.\} and Guomin Yang",

year = "2009",

doi = "10.1007/978-3-642-02882-3\_15",

language = "English",

isbn = "3642028810",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "138--147",

booktitle = "Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings",

address = "Switzerland",

note = "Annual International Conference on Computing and Combinatorics 2009, COCOON 2009 ; Conference date: 13-07-2009 Through 15-07-2009",

url = "https://link.springer.com/book/10.1007/978-3-642-02882-3",

}

Yuen, TH, Huang, Q, Mu, Y, Susilo, W, Wong, DS & Yang, G 2009, Efficient non-interactive range proof. in Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings. Lecture Notes in Computer Science, vol. 5609, Springer, pp. 138-147, Annual International Conference on Computing and Combinatorics 2009, Niagara Falls, New York, United States of America, 13/07/09. https://doi.org/10.1007/978-3-642-02882-3_15

TY - GEN

T1 - Efficient non-interactive range proof

AU - Yuen, Tsz Hon

AU - Huang, Qiong

AU - Mu, Yi

AU - Susilo, Willy

AU - Wong, Duncan S.

AU - Yang, Guomin

N1 - Conference code: 15th

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/76249110820

U2 - 10.1007/978-3-642-02882-3_15

DO - 10.1007/978-3-642-02882-3_15

M3 - Conference Paper

AN - SCOPUS:76249110820

SN - 3642028810

SN - 9783642028816

T3 - Lecture Notes in Computer Science

SP - 138

EP - 147

BT - Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings

PB - Springer

T2 - Annual International Conference on Computing and Combinatorics 2009

Y2 - 13 July 2009 through 15 July 2009

ER -

Efficient non-interactive range proof

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this