We build a system that provides succinct non-interactive zero-knowledge proofs (zk-
SNARKs) for program executions on a von Neumann RISC architecture. The system has two …

We propose a new suite of algorithms that significantly improve the performance of
supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a full …

We introduce a short signature scheme based on the Computational Diffie-Hellman
assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size …

Non-interactive zero-knowledge proofs of knowledge for general NP statements are a
powerful cryptographic primitive, both in theory and in practical applications. Recently, much …

Previously known techniques to construct pairing-friendly curves of prime or near-prime
order are restricted to embedding degree k\leqslant6. More general methods produce …

Remote data integrity checking is of crucial importance in cloud storage. It can make the
clients verify whether their outsourced data is kept intact without downloading the whole …

We present a general technique for the efficient computation of pairings on Jacobians of
supersingular curves. This formulation, which we call the eta pairing, generalizes results of …

As more corporate and private users outsource their data to cloud storage providers, recent
data breach incidents make end-to-end encryption an increasingly prominent requirement …

Pairing-based cryptography has become a highly active research area. We define bilinear
maps, or pairings, and show how they give rise to cryptosystems with new functionality …

Checking remote data possession is of crucial importance in public cloud storage. It enables
the users to check whether their outsourced data have been kept intact without downloading …