Bulletproofs: Short Proofs for Confidential Transactions and More Benedikt B¨ unz∗1 , Jonathan Bootle†2 , Dan Boneh‡1 , Andrew Poelstra§3 , Pieter Wuille¶3 , and Greg Maxwellk 1

First Page		Document Content
Date: 2018-06-28 10:34:47 Cryptography Cryptocurrencies Alternative currencies Bitcoin Decentralization Cryptographic protocols Non-interactive zero-knowledge proof Zero-knowledge proof Proof of knowledge NP Soundness IP		Bulletproofs: Short Proofs for Confidential Transactions and More Benedikt B¨ unz∗1 , Jonathan Bootle†2 , Dan Boneh‡1 , Andrew Poelstra§3 , Pieter Wuille¶3 , and Greg Maxwellk 1 Add to Reading List Source URL: web.stanford.edu Download Document from Source Website File Size: 603,38 KB Share Document on Facebook

	Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai† DocID: 1xUdf - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xSVG - View Document
	PDF Document DocID: 1xSM6 - View Document
	PDF Document DocID: 1xSJs - View Document