log in  |  register  |  feedback?  |  help  |  web accessibility
Bulletproofs: Short Proofs for Confidential Transactions and More
Elijah Grubb
Friday, April 5, 2019, 1:00-2:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract for the paper:
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 log(n) + 9 group and field elements,
where n is the bit length of the range. Proof generation and verification times are linear in n. The full paper can be found here: https://crypto.stanford.edu/bulletproofs/
This talk is organized by Aria