Open AccessProceedings Article
Direct Minimum-Knowledge Computations
Russell Impagliazzo,Moti Yung +1 more
- 16 Aug 1987
- pp 40-51
TL;DR: A protocol scheme which directly simulates any given computation, defined on any computational device, in a minimum-knowledge fashion, and a scheme for simulation of computation in dual (perfect) minimum- knowledge fashion are presented.
read more
Abstract: We present a protocol scheme which directly simulates any given computation, defined on any computational device, in a minimum-knowledge fashion. We also present a scheme for simulation of computation in dual (perfect) minimum-knowledge fashion. Using the simulation protocol, we can assure that one user transfers to another user exactly the result of a given computation and nothing more.The simulation is direct and efficient; it extends, simplifies and unifies important recent results which have useful applications in cryptographic protocol design. Our technique can be used to implement several different sorts of transfer of knowledge, including: transfer of computational results, proving possession of information, proving knowledge of knowledge, gradual and adaptive revealing of information, and commitment to input values.The novelty of the simulation technique is the separation of the data encryption from the encryption of the device's structural (or control) information.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The knowledge complexity of interactive proof-systems
Shafi Goldwasser,Silvio Micali,Charles Rackoff +2 more
- 04 Oct 2019
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
TL;DR: In this article, it was shown that all languages in NP have zero-knowledge interactive proofs, which are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without conveying any additional knowledge.
Bit commitment using pseudorandomness
TL;DR: It is shown how a pseudorandom generator can provide a bit-commitment protocol and the number of bits communicated when parties commit to many bits simultaneously, and the assumption of the existence of pseudorRandom generators suffices to assure amortized O(1) bits of communication per bit commitment.
Algebraic methods for interactive proof systems
TL;DR: This technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system and played a pivotal role in the recent proofs that IP = PSPACE and MIP = NEXP.
The NP-completeness column: An ongoing guide
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
859
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
How to generate and exchange secrets
Andrew Chi-Chih Yao
- 27 Oct 1986
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
4.1K
The knowledge complexity of interactive proof-systems
Shafi Goldwasser,Silvio Micali,Charles Rackoff +2 more
- 01 Dec 1985
TL;DR: Zero-knowledge proofs as discussed by the authors are proofs that convey no additional knowledge other than the correctness of the proposition in question, i.e., the proof of a theorem contains more knowledge than the mere fact that the theorem is true.
Probabilistic encryption & how to play mental poker keeping secret all partial information
Shafi Goldwasser,Silvio Micali +1 more
- 05 May 1982
TL;DR: This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
908
Related Papers (5)
Gilles Brassard,David Chaum,Claude Crépeau +2 more
- 01 Oct 1988
László Babai
- 01 Dec 1985
Uriel Feige,Amos Fiat,Adi Shamir +2 more