Bias-resistant public randomness is a critical component in many (distributed) protocols.
Generating public randomness is hard, however, because active adversaries may behave …

It is known that fully homomorphic encryption (FHE) can be used to build efficient (labeled)
Private Set Intersection protocols in the unbalanced setting, where one of the sets is much …

We present CONIKS, an end-user key verification service capable of integration in end-to-
end encrypted communication systems. CONIKS builds on transparency log proposals for …

This paper presents Dory, a transparent setup, public-coin interactive argument for inner-
pairing products between committed vectors of elements of two source groups. For a product …

With the advancement of blockchain technology, hundreds of cryptocurrencies have been
deployed. The bloom of heterogeneous blockchain platforms brings a new emerging …

We describe a protocol for two-party private set intersection (PSI) based on Diffie-Hellman
key agreement. The protocol is proven secure against malicious parties, in the ideal …

Abstract Supersingular isogeny Diffie-Hellman (SIDH) is an attractive candidate for post-
quantum key exchange, in large part due to its relatively small public key sizes. A recent …

We introduce a blockchain Fair Data Exchange (FDE) protocol, enabling a storage server to
transfer a data file to a client atomically: the client receives the file if and only if the server …

We present Ouroboros Crypsinous, the first formally analyzed privacy-preserving proof-of-
stake blockchain protocol. To model its security we give a thorough treatment of private …

Many papers have proposed elliptic curves which are faster and easier to implement than
the NIST prime-order curves. Most of these curves have had fields of size around $2^ 256 …