KIT | KIT-Bibliothek | Impressum | Datenschutz

Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments

Couteau, Geoffroy; Klooß, Michael ORCID iD icon; Lin, Huang; Reichle, Michael

Abstract (englisch):

We introduce a new approach for constructing range proofs. Our approach is modular, and leads to highly competitive range proofs under standard assumption, using less communication and (much) less computation than the state of the art methods, without relying on a trusted setup. Our range proofs can be used as a drop-in replacement in a variety of protocols such as distributed ledgers, anonymous transaction systems, and many more, leading to significant reductions in communication and computation for these applications.

At the heart of our result is a new method to transform any commitment over a finite field into a commitment scheme which allows to commit to and efficiently prove relations about bounded integers. Combining these new commitments with a classical approach for range proofs based on square decomposition, we obtain several new instantiations of a paradigm which was previously limited to RSA-based range proofs (with high communication and computation, and trusted setup). More specifically, we get:

– Under the discrete logarithm assumption, we obtain the most compact and efficient range proof among all existing candidates (with or without trusted setup). ... mehr

Postprint §
DOI: 10.5445/IR/1000135424
Veröffentlicht am 17.06.2022
DOI: 10.1007/978-3-030-77883-5_9
Zitationen: 6
Zitationen: 13
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2021
Sprache Englisch
Identifikator ISBN: 978-3-030-77883-5
ISSN: 0302-9743, 1611-3349
KITopen-ID: 1000135424
Erschienen in Advances in Cryptology – EUROCRYPT 2021. Ed.: A. Canteaut
Veranstaltung 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques (2021), Zagreb, Kroatien, 17.10.2021 – 21.10.2021
Verlag Springer International Publishing
Seiten 247-277
Serie Lecture Notes in Computer Science ; 12698
Vorab online veröffentlicht am 16.06.2021
Schlagwörter cryptographic protocols, zero-knowledge, range proofs, integer commitments
Nachgewiesen in Dimensions
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page