Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

7-2009

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.

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Proceedings of the 15thAnnual International Conference, Niagara Falls, USA, 2009 July 13-15

First Page

138

Last Page

147

ISBN

9783642028816

Identifier

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

Publisher

Springer Verlag

City or Country

Niagara Falls

Additional URL

http://doi.org/10.1007/978-3-642-02882-3_15

Share

COinS