Article

Free access

The knowledge complexity of interactive proof-systems

Authors:

S Goldwasser,

S Micali,

C RackoffAuthors Info & Claims

STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing

Pages 291 - 304

https://doi.org/10.1145/22145.22178

Published: 01 December 1985 Publication History

PDF eReader

References

[1]

Babai L., Trading Group Theory for Randomness

Google Scholar

[2]

M. Blum, Coin flipp#~g b), telephone, IEEE COMPCON 1982.

Google Scholar

[3]

M. Blum, Three applications of the oblivious transfer, Unpublished manuscript, 1981

Google Scholar

[4]

Berger, Peralta, Tedrick, O, .fixing the Oblivious 'lr ansJkr, Presented In Eurocrypt 1983. These Proceedings

Google Scholar

[5]

S.Cook, The Complexity of Theorem-Proving Procedures'; Proc. of 3rd STOC, 1971.

Digital Library

Google Scholar

[6]

D. Dolev, A. Broder, Flipping Coins in Many Pockets, Proc. of 25th FOCS, 1984.

Google Scholar

[7]

Even, Goldreich Lempel,4 randomized protocol for Signing Contracts, Advances in Cryptology: proceedings of Crypto 1982, Plenum press, 1983, 205-210.

Google Scholar

[8]

R. Fagin, I. Halpem, M. Vardi, A modeltheoretic analysis of knowledge, Proc. 6f 2$th FOCS, i984.

Digital Library

Google Scholar

[9]

M. Fischer, S. Micali and C. Rackoff, A Secure Protocol jbr the Oblivious Transfer, Eurocrypt 1984.

Google Scholar

[10]

J. Halpern, Y. Moses, Knowledge and Common Knowledge in a Distributed Environment, Proc. of 3rd PODC, 1984.

Digital Library

Google Scholar

[11]

J. Hastad, On Solving A System of Simultaneous Mo&lar Polynomial Equations of Low Degree, In preparation.

Google Scholar

[12]

J. Halpern and M.O. Rabin, A Logic to reason about likehood, Proc. of 15th STOC, 1983.

Digital Library

Google Scholar

[13]

J. Hastad, A. Shamir, On the Security of Linearly Truncated Sequences, this proceedings.

Google Scholar

[14]

S. Goldwasser, and S. Micali, Probabilistic Encryplion, JCSS Vol. 28, No. 2, April 1984.

Google Scholar

[15]

S. Goldwasser, and S. Mlcali,Prooj~ with Untrusted Oracles, Unpublished Manuscript 1983.

Google Scholar

[16]

O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random l:~nclion, 25th FOCS, 1984.

Google Scholar

[17]

L.A.l.evin, Universal Sequential Search Problems, Probl. Inform. l'ransm. 9/3 (1973), pp. 265-266.

Google Scholar

[18]

C. Papadimitriou, Games against nature, Proc. 24th ann. Syrup. on Foundations of Computer Science, 1983, pp 446-450.

Digital Library

Google Scholar

[19]

Papadimitfiou and Sipser, Communication Complexity, 14th STOC, 1982.

Digital Library

Google Scholar

[20]

A.C. Yao, Some Complexity Questions lCelated to Distributive Computing, Proc. of llth $TOC, 1979.

Digital Library

Google Scholar

[21]

A.C.Yao, They and A~lications of Trapdoor Functions, Pro~. of 23rd FOCS, 1982.

Google Scholar

Cited By

View all

Zhao XXia FXia HMao YChen S(2024)A Zero-Knowledge-Proof-Based Anonymous and Revocable Scheme for Cross-Domain AuthenticationElectronics10.3390/electronics1314273013:14(2730)Online publication date: 11-Jul-2024
https://doi.org/10.3390/electronics13142730
Baptista FDehez-Clementi MDetchart J(2024)DFly: A Publicly Auditable and Privacy-Preserving UAS Traffic Management System on BlockchainDrones10.3390/drones80804108:8(410)Online publication date: 21-Aug-2024
https://doi.org/10.3390/drones8080410
Miyahara DRobert LLafourcade PMizuki T(2024)ZKP Protocols for Usowan, Herugolf, and Five CellsTsinghua Science and Technology10.26599/TST.2023.901015329:6(1651-1666)Online publication date: Dec-2024
https://doi.org/10.26599/TST.2023.9010153
Show More Cited By

Index Terms

The knowledge complexity of interactive proof-systems

Recommendations

Memorizable interactive proof and zero-knowledge proof systems
Abstract
Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in ...
Proof complexity of non-classical logics
ESSLLI'10: Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation

Proof complexity is an interdisciplinary area of research utilising techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been ...
Proof Theory for Distributed Knowledge
Computational Logic in Multi-Agent Systems

The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. A proposition A is distributed knowledge within a group G if A follows from the totality of what the individual ...

Comments

Information & Contributors

Information

Published In

STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing

December 1985

484 pages

ISBN:0897911512

DOI:10.1145/22145

Chairman:
Robert Sedgewick

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1985

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC85

Sponsor:

SIGACT

STOC85: Annual ACM Conference on Theory of Computing

May 6 - 8, 1985

Rhode Island, Providence, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

837
Total Citations
View Citations
8,474
Total Downloads

Downloads (Last 12 months)2,523
Downloads (Last 6 weeks)239

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhao XXia FXia HMao YChen S(2024)A Zero-Knowledge-Proof-Based Anonymous and Revocable Scheme for Cross-Domain AuthenticationElectronics10.3390/electronics1314273013:14(2730)Online publication date: 11-Jul-2024
https://doi.org/10.3390/electronics13142730
Baptista FDehez-Clementi MDetchart J(2024)DFly: A Publicly Auditable and Privacy-Preserving UAS Traffic Management System on BlockchainDrones10.3390/drones80804108:8(410)Online publication date: 21-Aug-2024
https://doi.org/10.3390/drones8080410
Miyahara DRobert LLafourcade PMizuki T(2024)ZKP Protocols for Usowan, Herugolf, and Five CellsTsinghua Science and Technology10.26599/TST.2023.901015329:6(1651-1666)Online publication date: Dec-2024
https://doi.org/10.26599/TST.2023.9010153
Keršič VDomajnko MKarakatič STurkanović M(2024)Zero-knowledge proof v praksiOTS 2024 Sodobne informacijske tehnologije in storitve: Zbornik 27. konference10.18690/um.feri.4.2024.17(183-194)Online publication date: 3-Sep-2024
https://doi.org/10.18690/um.feri.4.2024.17
Xu X(2024)Zero-knowledge proofs in education: a pathway to disability inclusion and equitable learning opportunitiesSmart Learning Environments10.1186/s40561-024-00294-w11:1Online publication date: 6-Feb-2024
https://doi.org/10.1186/s40561-024-00294-w
Visconti I(2024)The Right to Be Zero-Knowledge ForgottenProceedings of the 19th International Conference on Availability, Reliability and Security10.1145/3664476.3669973(1-9)Online publication date: 30-Jul-2024
https://dl.acm.org/doi/10.1145/3664476.3669973
Tamura YSuzuki AMizuki T(2024)Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping ProblemProceedings of the 11th ACM Asia Public-Key Cryptography Workshop10.1145/3659467.3659905(11-22)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3659467.3659905
Liu KGupta TNiu JVaidya J(2024)Making Privacy-preserving Federated Graph Analytics Practical (for Certain Queries)Proceedings of the 29th ACM Symposium on Access Control Models and Technologies10.1145/3649158.3657047(31-39)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3649158.3657047
Laufer ELevis PRajagopal R(2024)Privacy-Preserving Control of Partitioned Energy ResourcesProceedings of the 15th ACM International Conference on Future and Sustainable Energy Systems10.1145/3632775.3661988(610-624)Online publication date: 4-Jun-2024
https://dl.acm.org/doi/10.1145/3632775.3661988
Zheng SLi ZLuo JXin ZLiu XChua TNgo CKa-Wei Lee RKumar RLauw H(2024)IDEA-DAC: Integrity-Driven Editing for Accountable Decentralized Anonymous Credentials via ZK-JSONProceedings of the ACM Web Conference 202410.1145/3589334.3645658(1868-1879)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645658
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Memorizable interactive proof and zero-knowledge proof systems

Proof complexity of non-classical logics

Proof Theory for Distributed Knowledge