Zero-Knowledge Sets

@inproceedings{Micali2003ZeroKnowledgeS,
  title={Zero-Knowledge Sets},
  author={Silvio Micali and Michael O. Rabin and Joe Kilian},
  booktitle={FOCS},
  year={2003}
}
We show how a polynomial-time prover can commit to an arbitrary finite setS of strings so that, later on, he can, for any stringx, reveal with a proof whether x 2 S or x 62 S, without revealing any knowledge beyond the verity of these membership assertions. Our method isnon interactive. Given a public random string, the prover commits to a set by simply posting a short and easily computable message. After that, each time it wants to prove whether a given element is in the set, it simply posts… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 120 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
81 Citations
21 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 81 extracted citations

121 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 121 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Efficiently Committing to Databases TR #97-04

  • J. Kilian
  • NEC Research Institute,
  • 1997

M

  • S. Micali
  • Rabin Hashing on Strings, Cryptography, and…
  • 1996

On the existence of statistically hiding bit commitment schemes and failstop signatures

  • T. P. Pedersen, B. Pfitzmann
  • Lecture Notes in Computer Science
  • 1994

and B

  • I. B. Damgard, T. P. Pedersen
  • Pfitzmann. On the existence of statistically…
  • 1994

Similar Papers

Loading similar papers…