We show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge
(ZK) with polylog-communication, the first not depending on PCPs. We start from …

Most efficient zero-knowledge arguments lack a concrete security analysis, making
parameter choices and efficiency comparisons challenging. This is even more true for non …

In many occasions, the knowledge error κ of an interactive proof is not small enough, and
thus needs to be reduced. This can be done generically by repeating the interactive proof in …

This paper develops a theory of multi-instance (mi) security and applies it to provide the first
proof-based support for the classical practice of salting in password-based cryptography. Mi …

Succinct arguments of knowledge are computationally-sound proofs of knowledge for NP
where the verifier's running time is independent of the time complexity of the NP …

We present a general parallel-repetition theorem with an efficient reduction. As a corollary of
this theorem we establish that parallel repetition reduces the soundness error at an …

The question of whether or not parallel repetition reduces the soundness error is a
fundamental question in the theory of protocols. While parallel repetition reduces (at an …

Zero-knowledge proofs are proofs that are both convincing and yet yield nothing beyond the
validity of the assertion being proved. Their direct applications in cryptography are …

We initiate a formal investigation on the power of predictability for argument of knowledge
systems for NP. Specifically, we consider private-coin argument systems where the answer …

It is well known (cf. Impagliazzo and Luby in Proceedings of the 30th Annual IEEE
Symposium on Foundations of Computer Science, 1989, pp. 230--235) that the existence of …