Corpus ID: 23232690

Bulletproofs : Efficient Range Proofs for Confidential Transactions

  title={Bulletproofs : Efficient Range Proofs for Confidential Transactions},
  author={Benedikt B{\"u}nz and Jonathan Bootle and D. Boneh and A. Poelstra and Pieter Wuille and G. Maxwell},
  • Benedikt Bünz, Jonathan Bootle, +3 authors G. Maxwell
  • Published 2017
  • 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. Bulletproofs are especially well suited for efficient range proofs on committed values: they enable proving that a committed value is in a range using only 2 log2pnq ` 9 group and field elements, where n is the bit length of the range. Proof generation and verification times are linear in n. Bulletproofs greatly… CONTINUE READING

    Tables from this paper.

    How to Prove a Secret: Zero-Knowledge Proofs on Distributed Data via Fully Linear PCPs
    • 3
    • Open Access
    Doubly-Efficient zkSNARKs Without Trusted Setup
    • 77
    • Highly Influenced
    • Open Access
    Scalable, transparent, and post-quantum secure computational integrity
    • 133
    • Highly Influenced
    • Open Access
    Coloured Ring Confidential Transactions
    ZoKrates - Scalable Privacy-Preserving Off-Chain Computations
    • 38
    • Open Access


    Publications referenced by this paper.