We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Secure multiparty computation (MPC) often relies on correlated randomness for better
efficiency and simplicity. This is particularly useful for MPC with no honest majority, where …

With the continuous development of information technology, enterprises, universities and
governments are constantly stepping up the construction of electronic personnel information …

A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful
sources of correlated randomness, such as random oblivious transfers (OT) and vector …

Efficient PRP/PRFs are instrumental to the design of cryptographic protocols. We investigate
the design of dedicated PRP/PRFs for three application areas-secure multiparty computation …

This paper introduces Brakedown, 1 the first built system that provides linear-time SNARKs
for NP, meaning the prover incurs O (N) finite field operations to prove the satisfiability of an …

Recent developments in multi party computation (MPC) and fully homomorphic encryption
(FHE) promoted the design and analysis of symmetric cryptographic schemes that minimize …

Public key quantum money can be seen as a version of the quantum no-cloning theorem
that holds even when the quantum states can be verified by the adversary. In this work, we …

Succinct arguments are proof systems that allow a powerful, but untrusted, prover to
convince a weak verifier that an input x belongs to a language L∈ NP, with communication …

Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …