Non-interactive arguments enable a prover to convince a verifier that a statement is true.
Recently there has been a lot of progress both in theory and practice on constructing highly …

We put forward a new framework that makes it possible to re-write or compress the content
of any number of blocks in decentralized services exploiting the blockchain technology. As …

We present a zero-knowledge argument for NP with low communication complexity, low
concrete cost for both the prover and the verifier, and no trusted setup, based on standard …

Ledger-based systems that support rich applications often suffer from two limitations. First,
validating a transaction requires re-executing the state transition that it attests to. Second …

An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

We propose a new notion of secure multiparty computation aided by a computationally-
powerful but untrusted" cloud" server. In this notion that we call on-the-fly multiparty …

Bitcoin owes its success to the fact that transactions are transparently recorded in the
blockchain, a global public ledger that removes the need for trusted parties. Unfortunately …

We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …

Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs
have played a significant role in the theory of cryptography. However, lack of efficiency has …

Thanks to their anonymity (pseudonymity) and elimination of trusted intermediaries,
cryptocurrencies such as Bitcoin have created or stimulated growth in many businesses and …