We design and implement a simple zero-knowledge argument protocol for NP whose
communication complexity is proportional to the square-root of the verification circuit size …

Efficient PRP/PRFs are instrumental to the design of cryptographic protocols. We investigate
the design of dedicated PRP/PRFs for three application areas-secure multiparty computation …

In recent years, oblivious pseudorandom functions (OPRFs) have become a ubiquitous
primitive used in cryptographic protocols and privacy-preserving technologies. The growing …

Abstract Partially Oblivious Pseudorandom Functions (POPRFs) are 2-party protocols that
allow a client to learn pseudorandom function (PRF) evaluations on inputs of its choice from …

Private Information Retrieval (PIR) is a two player protocol where the client, given some
query x ε [N], interacts with the server, which holds a N-bit string DB, in order to privately …

Correlated secret randomness is a useful resource for many cryptographic applications. We
initiate the study of pseudorandom correlation functions (PCFs) that offer the ability to …

Oblivious Transfer (OT) is at the heart of secure computation and is a foundation for many
applications in cryptography. Over two decades of work have led to extremely efficient …

Succinct arguments are proof systems that allow a powerful, but untrusted, prover to
convince a weak verifier that an input x belongs to a language L∈ NP, with communication …

We give superpolynomial statistical query (SQ) lower bounds for learning two-hidden-layer
ReLU networks with respect to Gaussian inputs in the standard (noise-free) model. No …

In a Single Secret Leader Election (SSLE), a group of participants aim to randomly choose
exactly one leader from the group with the restriction that the identity of the leader will be …