Increasing deployment of advanced zero-knowledge proof systems, especially zkSNARKs,
has raised critical questions about their security against real-world attacks. Two classes of …

Abstract Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs)
are becoming an increasingly fundamental tool in many real-world applications where the …

The main conceptual contribution of this paper is a unification of two leading paradigms for
constructing succinct argument systems, namely Kilian's protocol and the BMW (Biehl-Meyer …

Private heavy-hitters is a data-collection task where multiple clients possess private bit
strings, and data-collection servers aim to identify the most popular strings without learning …

We present the first round-optimal and plausibly quantum-safe oblivious transfer (OT) and
multi-party computation (MPC) protocols from the computational CSIDH assumption–the …

Secure Multiparty Computation (MPC) protocols enable secure evaluation of a circuit by
several parties, even in the presence of an adversary who maliciously corrupts all but one of …

In the setting of subversion, an adversary tampers with the machines of the honest parties
thus leaking the honest parties' secrets through the protocol transcript. The work of Mironov …

The universal composability (UC) model provides strong security guarantees for protocols
used in arbitrary contexts. While these guarantees are highly desirable, in practice, schemes …

Being capable of updating cryptographic algorithms is an inevitable and essential practice in
cryptographic engineering. This cryptographic agility, as it has been called, is a fundamental …

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any
multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious …