Abstract Secure Multi-party Computation (SMPC) is a family of protocols which allow some
parties to compute a function on their private inputs, obtaining the output at the end and …

Laconic cryptography is an emerging paradigm that enables cryptographic primitives with
sublinear communication complexity in just two messages. In particular, a two-message …

Timed commitments Boneh and Naor, CRYPTO 2000 are the timed analogue of standard
commitments, where the commitment can be non-interactively opened after a pre-specified …

Traditional private set intersection (PSI) involves a receiver and a sender holding sets X and
Y, respectively, with the receiver learning only the intersection X∩ Y. We turn our attention to …

Private set-intersection (PSI) is one of the most practically relevant special-purpose secure
multiparty computation tasks, as it is motivated by many real-world applications. In this paper …

As end-to-end encrypted messaging services become widely adopted, law enforcement
agencies have increasingly expressed concern that such services interfere with their ability …

Abstract Structure-Aware Private Set Intersection (sa-PSI), recently introduced by Garimella
et al.(Crypto'22), is a PSI variant where Alice's input set SA has a publicly known structure …

Secure computation enables mutually distrusting parties to jointly compute a function on
their secret inputs, while revealing nothing beyond the function output. A long-running …

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 …

The emerging area of laconic cryptography [Cho et al., CRYPTO'17] involves the design of
two-party protocols involving a sender and a receiver, where the receiver's input is large …