Bulletproofs: Short Proofs for Confidential Transactions and More
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.