We provide the first construction of a succinct non-interactive argument (SNARG) for all
polynomial time deterministic computations based on standard assumptions. For T steps of …

We study the problem of designing non-interactive batch arguments for NP NP. Such an
argument system allows an efficient prover to prove multiple NP NP statements, with size …

We present new non-interactive zero-knowledge argument systems (NIZK), based on
standard assumptions that were previously not known to imply it. In particular, we rely on the …

Abstract The Fiat-Shamir transform is a general method for reducing interaction in public-
coin protocols by replacing the random verifier messages with deterministic hashes of the …

One of the most fundamental results in game theory is that every finite strategic game has a
Nash equilibrium, an assignment of (randomized) strategies to players with the stability …

We consider threshold public-key encryption, where the decryption servers distributively
hold the private key shares, and we need a threshold of these servers to decrypt the …

Non-interactive zero knowledge (NIZK) enables proving the validity of NP statement without
leaking anything else. We study multi-instance NIZKs in the common reference string (CRS) …

Abstract The Fiat-Shamir transform [1] is a well-known and widely employed technique for
converting sound public-coin interactive protocols into sound non-interactive protocols. Even …

Abstract The Naor-Yung paradigm is a well-known technique that constructs IND-CCA2-
secure encryption schemes by means of non-interactive zero-knowledge proofs satisfying a …

Oblivious transfer (OT) is a foundational primitive within cryptography owing to its connection
with secure computation. One of the oldest constructions of oblivious transfer was from …