We present an efficient zero-knowledge argument of knowledge system customized for the
Paillier cryptosystem. Our system enjoys sublinear proof size, low verification cost, and …

Differential obliviousness (DO) is a privacy notion which guarantees that the access patterns
of a program satisfies differential privacy. Differential obliviousness was studied in a …

Abstract In a Multi-Client Functional Encryption (MCFE) scheme, n clients each obtain a
secret encryption key from a trusted authority. During each time step t, each client i can …

Traffic analysis attacks can counteract end-to-end encryption and use leaked
communication metadata to reveal information about communicating parties. With an ever …

We consider how to design an anonymous data collection protocol that enforces compliance
rules. Imagine that each client contributes multiple data items (eg, votes, location crumbs, or …

A recent work by Shi and Wu (Eurocrypt'21) sugested a new, non-interactive abstraction for
anonymous routing, coined Non-Interactive Anonymous Router (\NIAR). They show how to …

Anonymous routing is an important cryptographic primitive that allows users to communicate
privately on the Internet, without revealing their message contents or their contacts. Until the …

We present an efficient zero-knowledge argument of knowledge system customized for the
Paillier cryptosystem. Our system enjoys sublinear proof size, low verification cost, and …

Abstract The Non-Interactive Anonymous Router (NIAR) model was introduced by Shi and
Wu as an alternative to conventional solutions to the anonymous routing problem, in which a …

Abstract Decentralized Multi-Client Functional Encryption (DMCFE) extends the basic
functional encryption to multiple clients that do not trust each other. They can independently …