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

The well-studied task of learning a linear function with errors is a seemingly hard problem
and the basis for several cryptographic schemes. Here we demonstrate additional …

Digital copies of the signed statements were provided to NIST in the original submission on
Nov. 30, 2017. The paper versions have been provided to NIST at the First PQC …

We describe a simple method for solving the distributed discrete logarithm problem in
Paillier groups, allowing two parties to locally convert multiplicative shares of a secret (in the …

We study the pseudorandomness of bounded knapsack functions over arbitrary finite
abelian groups. Previous works consider only specific families of finite abelian groups and 0 …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

We propose a framework for constructing efficient code-based encryption schemes that do
not hide any structure in their public matrix. The framework is in the spirit of the schemes first …

Current constructions of cryptographic primitives typically involve a large multiplicative
computational overhead that grows with the desired level of security. We explore the …

This paper attempts to broaden the foundations of public-key cryptography. We construct
new public-key encryption schemes based on new hardness-on-average assumptions for …