We construct a constant-round zero-knowledge classical argument for NP secure against
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …

The round complexity of zero-knowledge protocols is a long-standing open question, yet to
be settled under standard assumptions. So far, the question has appeared equally …

The traditional notion of program obfuscation requires that an obfuscation~ Prog of a
program Prog computes the exact same function as Prog, but beyond that, the code of~ Prog …

How many rounds and which assumptions are required for concurrent non-malleable
commitments? The above question has puzzled researchers for several years. Pass in [TCC …

In this work we start from the following two results in the state-of-the art: 1. 4-round non-
malleable zero knowledge (NMZK): Goyal et al. in FOCS 2014 showed the first 4-round one …

We present a constant-round concurrent zero-knowledge protocol for NP NP. Our protocol
relies on the existence of families of collision-resistant hash functions, one-way …

A key source of inefficiency in existing obfuscation schemes is that they operate on
programs represented as Boolean circuits or (with stronger assumptions and costlier …

The notion of zero-knowledge [20] is formalized by requiring that for every malicious efficient
verifier V*, there exists an efficient simulator S that can reconstruct the view of V* in a true …

We provide counterexamples to the``dream''version of Yao's XOR Lemma. In particular, we
put forward explicit candidates for hard predicates, such that the advantage of predicting the …

We show the following result: Assuming the existence of p ublic-coin differing-input
obfuscation (pc-diO) for the class of all polynomial time Turing machines, then there exists a …