Additive Combinatorics and Discrete Logarithm Based Range Protocols

By Rafik Chaabouni, Helger Lipmaa, Abhi Shelat. 2010

43 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Benedikt Bünz
2. Dan Boneh
3. Helger Lipmaa
4. Srinath T. V. Setty
5. Jonathan Bootle
6. Andrew Poelstra
7. Gregory Maxwell
8. Pieter Wuille

In Computational Theory and Mathematics

1. Benedikt Bünz
2. Helger Lipmaa
3. Dan Boneh
4. Jonathan Bootle
5. Gregory Maxwell
6. Pieter Wuille
7. Andrew Poelstra
8. Craig Gentry

In Discrete Mathematics and Combinatorics

1. Helger Lipmaa
2. Dan Boneh
3. Gregory Maxwell
4. Pieter Wuille
5. Andrew Poelstra

Citations in the corpus

• Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “However, [61] presented an alternative digital decomposition which enables an interval of general width to be handled using a single range proof.”
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments (2012, background): “(See [6] for a previous use of additive combinatorics in the construction of zero-knowledge proofs.)”