This work introduces homomorphic secret sharing (HSS) with succinct share size. In HSS,
private inputs are shared between parties, who can then homomorphically evaluate a …

Recent new constructions of rate-1 OT Döttling, Garg, Ishai, Malavolta, Mour, and Ostrovsky,
CRYPTO 2019 have brought this primitive under the spotlight and the techniques have led …

We show that it is possible to perform n independent copies of 1-out-of-2 oblivious transfer in
two messages, where the communication complexity of the receiver and sender (each) is n …

We put forth and instantiate a new primitive we call simultaneous-message and succinct
(SMS) secure computation. An SMS scheme enables a minimal communication pattern for …

Statistical sender privacy (SSP) is the strongest achievable security notion for two-message
oblivious transfer (OT) in the standard model, providing statistical security against malicious …

Abstract Private Information Retrieval (PIR) allows a client to retrieve one entry from a
database held by a server, while hiding from the server which entry has been retrieved …

Algebraic structure lies at the heart of much of Cryptomania as we know it. An interesting
question is the following: instead of building (Cryptomania) primitives from concrete …

Over the last few years, there has been a surge of new cryptographic results, including
laconic oblivious transfer [13, 16],(anonymous/hierarchical) identity-based encryption [9] …

Private information retrieval (PIR) is a fundamental cryptographic primitive that allows a user
to fetch a database entry without revealing to the server which database entry it learns. PIR …

We give a construction of a two-round batch oblivious transfer (OT) protocol in the CRS
model that is UC-secure against malicious adversaries and has (near) optimal …