We design a novel, communication-efficient, failure-robust protocol for secure aggregation of
high-dimensional data. Our protocol allows a server to compute the sum of large, user-held …

Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …

We propose a new class of post-quantum digital signature schemes that:(a) derive their
security entirely from the security of symmetric-key primitives, believed to be quantum …

Designing an efficient cipher was always a delicate balance between linear and non-linear
operations. This goes back to the design of DES, and in fact all the way back to the seminal …

The well-known classical constructions of garbled circuits use four ciphertexts per gate,
although various methods have been proposed to reduce this cost. The best previously …

We introduce FairSwap--an efficient protocol for fair exchange of digital goods using smart
contracts. A fair exchange protocol allows a sender S to sell a digital commodity x for a fixed …

Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive
zero-knowledge proofs of knowledge (NIZKPoKs) for Boolean circuits based on symmetric …

This paper presents TumbleBit, a new unidirectional unlinkable payment hub that is fully
compatible with today s Bitcoin protocol. TumbleBit allows parties to make fast, anonymous …

Recent progress in interactive zero-knowledge (ZK) proofs has improved the efficiency of
proving large-scale computations significantly. Nevertheless, real-life applications (eg, in the …