We initiate the study of a proof system model that naturally combines interactive proofs (IPs)
and probabilistically-checkable proofs (PCPs), and generalizes interactive PCPs (which …

In the first part of the paper we introduce a new theorem-proving procedure, that is a new
efficient method of communicating a proof. Any such method implies, directly or indirectly, a …

In this paper we extend the notion of zero knowledge proofs of membership (which reveal
one bit of information) to zero knowledge proofs of knowledge (which reveal no information …

In this paper the generality and wide applicability of Zero-knowledge proofs, a notion
introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and …

In this note, we present new zero-knowledge interactive proofs and arguments for
languages in NP. To show that x ε L, with an error probability of at most 2-k, our zero …

We establish the following, quite unexpected, result: replication of data for the computational
private information retrieval problem is not necessary. More specifically, based on the …

Protocols are given for allowing a “prover” to convince a “verifier” that the prover knows
some verifiable secret information, without allowing the verifier to learn anything about the …

The subject of this thesis is the study of cryptographic hash functions. The importance of
hash functions for protecting the authenticity of information is demonstrated. Applications …

In much of modern cryptography, for many cryptographic tasks, the security of protocols that
have been designed is based on the intractability of a problem such as factorization of …

CNF formula is satisfiable without revealing any other property of the formula. In particular,
without yielding neither a satisfying assignment nor properties such as whether there is a …