Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

We provide the first constructions of SNARGs for Batch-NP and P based solely on the sub-
exponential Decisional Diffie Hellman (DDH) assumption. Our schemes achieve poly …

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 construct a succinct non-interactive publicly-verifiable delegation scheme for any log-
space uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For …

In a seminal work, Goldreich, Micali and Wigderson (CRYPTO'86) demonstrated the wide
applicability of zero-knowledge proofs by constructing such a proof system for the NP …

We present a candidate sequential function for a VDF protocol to be used within the
Ethereum ecosystem. The new function, called MinRoot, is an optimized iterative algebraic …

We provide the first constructions of non-interactive zero-knowledge and Zap arguments for
NP based on the sub-exponential hardness of Decisional Diffie-Hellman against polynomial …

We construct succinct non-interactive arguments (SNARGs) for bounded-depth
computations assuming that the decisional Diffie-Hellman (DDH) problem is sub …

Local search proved to be an extremely useful tool when facing hard optimization problems
(eg, via the simplex algorithm, simulated annealing, or genetic algorithms). Although …

Instructing the model to generate a sequence of intermediate steps, aka, a chain of thought
(CoT), is a highly effective method to improve the accuracy of large language models (LLMs) …