Efficient Protocols for Set Membership and Range Proofs

324 citations recorded by the source corpus.

How researchers see this paper

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

Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges (2015, methodology): “We could have used more efficient range proofs [6, 7], but making these protocols non-interactive using the Fiat-Shamir heuristic requires that we use a trusted setup.”
UnLynx: A Decentralized System for Privacy-Conscious Data Sharing (2017, background): “[15] present simple and efficient zero-knowledge proofs to prove that an encrypted value is in a specific range/set.”
Hiding in the Crowd: A Massively Distributed Algorithm for Private Averaging with Malicious Adversaries (2018, methodology): “Our approach is 3We can use range proofs (Camenisch et al., 2008) to check that each input value lies in an appropriate interval without revealing anything else about the value.”
Confidential Assets (2018, methodology): “Nor is it interactive, as is the scheme described in [5].”