Quantum cryptography exploits principles of quantum physics for the secure processing of
information. A prominent example is secure communication, ie, the task of transmitting …

We present a much-improved practical protocol, based on the hardness of Module-SIS and
Module-LWE problems, for proving knowledge of a short vector s→ satisfying A s→= t→ mod …

Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-) sharing of
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …

We provide new two-round multiparty secure computation (MPC) protocols in the dishonest
majority setting assuming the minimal assumption that two-round oblivious transfer (OT) …

Coin mixing services allow users to mix their cryptocurrency coins and thus enable
unlinkable payments in a way that prevents tracking of honest users' coins by both the …

Front-running is the malicious, and often illegal, act of both manipulating the order of
pending trades and injecting additional trades to make a profit at the cost of other users. In …

Cryptographic accumulators are a common solution to proving information about a large set
S. They allow one to compute a short digest of S and short certificates of some of its basic …

We present a new multiparty protocol for the distributed generation of biprime RSA moduli,
with security against any subset of maliciously colluding parties assuming oblivious transfer …

We propose a privacy-preserving Naive Bayes classifier and apply it to the problem of
private text classification. In this setting, a party (Alice) holds a text message, while another …

Trusted hardware and new computing platforms such as RDMA naturally provide a non-
equivocation abstraction. Previous works have shown that non-equivocation allows us to …