Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments

Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments

Cybersecurity Seminars Online seminar
Thursday, 10 June 2021
5 pm - 6 pm (AEST)
Free

This talk is about a new approach of constructing range proofs. It is modular, and leads to highly competitive range proofs under standard assumptions without relying on a trusted setup. These 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 this approach 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 leads to several new instantiations of a paradigm which was previously limited to RSA-based range proofs (with high communication and computation, and trusted setup).

Under the discrete logarithm assumption, this leads to the most compact and efficient range proof among all existing candidates (with or without trusted setup). Under the LWE assumption, the range proofs improve over the state of the art in a batch setting when at least a few dozen range proofs are required. Eventually, under standard class group assumptions, this approach yields the first concretely efficient standard integer commitment scheme (without bounds on the size of the committed integer) which does not assume trusted setup.

This talk is based on the following work:
[CKLR21]: Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle. Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. Eurocrypt 2021.

About the speaker

Michael Reichle
PhD Student, École Normale Supérieure and Inria

Michael Reichle is a PhD student at École Normale Supérieure and Inria under the supervision of Brice Minaud on the topic of Searchable Encryption. He is further interested in a wide range of cryptographic areas such as Zero-Knowledge Proofs, Range Proofs, ORAM and Anonymous Credentials.

Monash University values the privacy of every individual's personal information and is committed to the protection of that information from unauthorised use and disclosure except where permitted by law. For information about the handling of your personal information please see Data Protection and Privacy Procedure and the relevant Data Protection and Privacy Collection Statement that applies to you depending on the nature of your interaction with us.

If you have any questions about how Monash University is collecting and handling your personal information, please contact our Data Protection and Privacy Office at dataprotectionofficer@monash.edu.

Research

Event contact

Share this event