Efficient Protocols for Set Membership and Range Proofs

@inproceedings{Camenisch2008EfficientPF,
  title={Efficient Protocols for Set Membership and Range Proofs},
  author={Jan Camenisch and Rafik Chaabouni and Abhi Shelat},
  booktitle={ASIACRYPT},
  year={2008}
}
We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 2]. This problem arises in e-cash systems, anonymous credential systems, and various other practical uses of zeroknowledge protocols. When using commitment schemes relying on RSA-like assumptions, there are solutions to this problem which require only a constant number… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 126 CITATIONS, ESTIMATED 38% COVERAGE

FILTER CITATIONS BY YEAR

2008
2019

CITATION STATISTICS

  • 12 Highly Influenced Citations

  • Averaged 13 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Some efficient zeroknowledge proof techniques

  • Berry Schoenmakers
  • Monte Verita, March
  • 2001
Highly Influential
4 Excerpts

Interval proofs revisited

  • Berry Schoenmakers
  • Milan, Italy,
  • 2005
3 Excerpts

Similar Papers

Loading similar papers…