Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

Zero-knowledge proofs of knowledge are useful tools to design signature schemes. The
ongoing effort to build a quantum computer urges the cryptography community to develop …

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 …

We put forth new protocols for oblivious transfer extension and vector OLE, called Silver, for
SILent Vole and oblivious transfER. Silver offers extremely high performances: generating …

We consider the problem of securely generating useful instances of two-party correlations,
such as many independent copies of a random oblivious transfer (OT) correlation, using a …

Many recent private set intersection (PSI) protocols encode input sets as polynomials. We
consider the more general notion of an oblivious key-value store (OKVS), which is a data …

Oblivious linear-function evaluation (OLE) is a secure two-party protocol allowing a receiver
to learn any linear combination of a pair of field elements held by a sender. OLE serves as a …

In this survey, the authors review the main quantum algorithms for solving the computational
problems that serve as hardness assumptions for cryptosystem. To this end, the authors …

Secure multiparty computation can often utilize a trusted source of correlated randomness to
achieve better efficiency. A recent line of work, initiated by Boyle et al.(CCS 2018, Crypto …

4 Design Rationale and Considerations (2. B. 6) 11 4.1 What is BIKE and how should it be
used?............... 11 4.1. 1 What is BIKE in one sentence?................. 11 4.1. 2 How many …