Abstract Distributed Point Functions (DPFs) are a useful cryptographic primitive enabling a
dealer to distribute short keys to two parties, such that the keys encode additive secret …

Homomorphic secret sharing (HSS) is a distributed analogue of fully-homomorphic
encryption (FHE), where subsequent to an input-sharing phase, parties can locally compute …

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 …

We present a new approach to garbling arithmetic circuits using techniques from
homomorphic secret sharing, obtaining constructions with high rate that support free …

We consider the graph-theoretic problem of removing (few) nodes from a directed acyclic
graph in order to reduce its depth. While this problem is intractable in the general case, we …

The assumption that certain computations inherently require some sequential time has
established itself as a powerful tool for cryptography. It allows for security and liveness …

Secure computation allows two or more parties, each with a private input, to learn the output
of a function computed over their inputs without learning anything else—a fundamental tool …