As large language models (LLMs) continue to gain popularity, concerns about user privacy
are amplified, given that the data submitted by users for inference may contain sensitive …

Abstract Bellare, Canetti and Krawczyk~\cite {FOCS: BelCanKra96} show that cascading an
$\eps $-secure (fixed input length) PRF gives an $ O (\eps nq) $-secure (variable input …

The concept of using Lookup Tables (LUTs) instead of Boolean circuits is well-known and
been widely applied in a variety of applications, including FPGAs, image processing, and …

In this paper, we propose a new, nonparallelizable verification-efficient client puzzle. Our
puzzle is based on repeated-squaring and enables efficient verification of the puzzle …

Abstract Katz et al., CCS 2018 (KKW) is a popular and efficient MPC-in-the-head non-
interactive ZKP (NIZK) scheme, which is the technical core of the post-quantum signature …

PlonK is a universal and updatable zk-SNARK for general circuit satisfiability that allows a
verifier to check the validity of a certain NP statement very efficiently, optionally in zero …

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 …

We present TaSSLE, a new lookup argument for decomposable tables with minimal
commitment costs. The construction generalizes techniques introduced in Lasso …

We study elastic SNARKs, a concept introduced by the elegant work of Gemini
(EUROCRYPTO 2022). The prover of elastic SNARKs has multiple configurations with …

We develop a new approach for building cryptographic implementations. Our approach
goes the last mile and delivers assembly code that is provably functionally correct, protected …