This paper studies the role of multiparty shuffling protocols in enabling more efficient
metadata-hiding communication. We show that the process of shuffling messages can be …

This work presents RPM, a scalable anonymous communication protocol suite using secure
multiparty computation (MPC) with the offline-online model. We generate random, unknown …

A distributed point function (DPF) is a cryptographic primitive that enables compressed
additive sharing of a secret unit vector across two or more parties. Despite growing ubiquity …

In end-to-end encrypted (E2EE) messaging systems, protecting communication metadata,
such as who is communicating with whom, at what time, etc., remains a challenging …

Nearest neighbor search is a fundamental building-block for a wide range of applications. A
privacy-preserving protocol for nearest neighbor search involves a set of clients who send …

In the realm of privacy-preserving blockchain applications such as Zcash, oblivious
message retrieval (OMR) enables recipients to privately access messages directed to them …

Protecting metadata of communications has been an area of active research since the
dining cryptographers problem was introduced by David Chaum in 1988. The Snowden …

Function Secret Sharing (FSS; Eurocrypt 2015) allows a dealer to share a function f with two
or more evaluators. Given secret shares of a function f, the evaluators can locally compute …

Secure shuffle is an important primitive that finds use in several applications such as secure
electronic voting, oblivious RAMs, secure sorting, to name a few. For time-sensitive shuffle …

Trellis is a mix-net based anonymous broadcast system with cryptographic security
guarantees. Trellis can be used to anonymously publish documents or communicate with …