On zero-knowledge proofs (extended abstract)

DOI10.1145/335305.335336MaRDI QIDQ3191992zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335336

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Efficient zero-knowledge proofs. (Abstract)
• scientific article; zbMATH DE number 1107670
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• How to Utilize the Randomness of Zero-Knowledge Proofs
• scientific article; zbMATH DE number 4191124
• Zero-knowledge proofs from secure multiparty computation
• scientific article; zbMATH DE number 31277
• scientific article; zbMATH DE number 4195166

Cited in

(7)

• Zero-knowledge protocols for search problems
• Proving without knowing: on oblivious, agnostic and blindfolded provers
• scientific article; zbMATH DE number 1107670 (Why is no real title available?)
• Brief announcement: Zero-knowledge protocols for search problems
• The Complexity of Zero Knowledge
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• A language-dependent cryptographic primitive

This page was built for publication: On zero-knowledge proofs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191992)