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 …

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) …

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 four-volume proceedings LNCS 13090, 13091, 13092, and 13093 constitutes the
proceedings of the 27th International Conference on the Theory and Application of …

Sealed bid auctions are used to allocate a resource among a set of interested parties.
Traditionally, auctions need the presence of a trusted auctioneer to whom the bidders …

In this work, we construct a second price (Vickrey) auction protocol (SPA), which does not
require any auctioneers and ensures total privacy in the presence of rational parties …

We study Multi-party computation (MPC) in the setting of subversion, where the adversary
tampers with the machines of honest parties. Our goal is to construct actively secure MPC …

We present a new framework for building round-optimal (two-round) adaptively secure MPC.
We show that a relatively weak notion of OT that we call indistinguishability OT with receiver …