• Publications
  • Influence
Bulletproofs: Short Proofs for Confidential Transactions and More
We propose Bulletproofs, a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup; the proof size is only logarithmic in the witness size. BulletproofsExpand
  • 215
  • 54
  • PDF
Learning a SAT Solver from Single-Bit Supervision
We present NeuroSAT, a message passing neural network that learns to solve SAT problems after only being trained as a classifier to predict satisfiability. Although it is not competitive withExpand
  • 139
  • 23
  • PDF
Verifiable Delay Functions
We study the problem of building a verifiable delay function (VDF). A \(\text {VDF}\)requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficientlyExpand
  • 123
  • 21
  • PDF
Zether: Towards Privacy in a Smart Contract World
Smart contract platforms such as Ethereum and Libra provide ways to seamlessly remove trust and add transparency to various distributed applications. Yet, these platforms lack mechanisms to guaranteeExpand
  • 47
  • 10
  • PDF
FlyClient: Super-Light Clients for Cryptocurrencies
To validate transactions, cryptocurrencies such as Bitcoin and Ethereum require nodes to verify that a blockchain is valid. This entails downloading and verifying all blocks, taking hours andExpand
  • 25
  • 6
  • PDF
Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges
Bitcoin exchanges function like banks, securely holding customers' bitcoins on their behalf. Several exchanges have suffered catastrophic losses with customers permanently losing their savings. AExpand
  • 44
  • 5
  • PDF
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains
We present batching techniques for cryptographic accumulators and vector commitments in groups of unknown order. Our techniques are tailored for distributed settings where no trusted accumulatorExpand
  • 47
  • 5
  • PDF
Transparent SNARKs from DARK Compilers
We construct a new polynomial commitment scheme for univariate and multivariate polynomials over finite fields, with public-coin evaluation proofs that have logarithmic communication and verificationExpand
  • 29
  • 5
  • PDF
A Survey of Two Verifiable Delay Functions
A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This short note briefly surveys and compares two recent beautiful Verifiable DelayExpand
  • 49
  • 4
  • PDF
Bulletproofs : Efficient Range Proofs for Confidential Transactions
We propose Bulletproofs, a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup; the proof size is only logarithmic in the witness size. BulletproofsExpand
  • 29
  • 4
  • PDF