We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …

We present a somewhat homomorphic encryption scheme that is both very simple to
describe and analyze, and whose security (quantumly) reduces to the worst-case hardness …

We give new instantiations of the Fiat-Shamir transform using explicit, efficiently computable
hash functions. We improve over prior work by reducing the security of these protocols to …

Most of the work in the analysis of cryptographic schemes is concentrated in abstract
adversarial models that do not capture side-channel attacks. Such attacks exploit various …

We introduce a new primitive, called trapdoor hash functions (TDH), which are hash
functions H:{0, 1\}^ n → {0, 1\}^ λ with additional trapdoor function-like properties …

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 …

Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a
puzzle with a solution s that remains hidden until time T has elapsed. The solution is …

In anonymous identity-based encryption (IBE), ciphertexts not only hide their corresponding
messages, but also their target identity. We construct an anonymous IBE scheme based on …

We study the problem of designing non-interactive batch arguments for NP NP. Such an
argument system allows an efficient prover to prove multiple NP NP statements, with size …

Robustness of federated learning has become one of the major concerns since some
Byzantine adversaries, who may upload false data owning to unreliable communication …