東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Provable security for cryptocurrencies.

Miller, Andrew.

FindBook

Google Book

Amazon

博客來

Provable security for cryptocurrencies.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Provable security for cryptocurrencies./
作者:	Miller, Andrew.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2016,
面頁冊數:	119 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.
Contained By:	Dissertation Abstracts International78-03B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10159167
ISBN:	9781369141580

Provable security for cryptocurrencies.
Miller, Andrew.

Provable security for cryptocurrencies. - Ann Arbor : ProQuest Dissertations & Theses, 2016 - 119 p.

Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.

Thesis (Ph.D.)--University of Maryland, College Park, 2016.

The past several years have seen the surprising and rapid rise of Bitcoin and other "cryptocurrencies." These are decentralized peer-to-peer networks that allow users to transmit money, tocompose financial instruments, and to enforce contracts between mutually distrusting peers, andthat show great promise as a foundation for financial infrastructure that is more robust, efficientand equitable than ours today.

ISBN: 9781369141580Subjects--Topical Terms:

523869
Computer science.

Provable security for cryptocurrencies.
LDR:03206nmm a2200337 4500 001 2158264
005 20180608130007.5
008 190424s2016 ||||||||||||||||| ||eng d
020 $a 9781369141580
035 $a (MiAaPQ)AAI10159167
035 $a (MiAaPQ)umd:17522
035 $a AAI10159167
040 $a MiAaPQ $c MiAaPQ
100 1 $a Miller, Andrew. $3 3219466
245 1 0 $a Provable security for cryptocurrencies.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2016
300 $a 119 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.
500 $a Advisers: Jonathan Katz; Elaine Shi.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2016.
520 $a The past several years have seen the surprising and rapid rise of Bitcoin and other "cryptocurrencies." These are decentralized peer-to-peer networks that allow users to transmit money, tocompose financial instruments, and to enforce contracts between mutually distrusting peers, andthat show great promise as a foundation for financial infrastructure that is more robust, efficientand equitable than ours today.
520 $a However, it is difficult to reason about the security of cryptocurrencies. Bitcoin is a complex system, comprising many intricate and subtly-interacting protocol layers. At each layer it features design innovations that (prior to our work) have not undergone any rigorous analysis. Compounding the challenge, Bitcoin is but one of hundreds of competing cryptocurrencies in an ecosystem that is constantly evolving.
520 $a The goal of this thesis is to formally reason about the security of cryptocurrencies, reining in their complexity, and providing well-defined and justified statements of their guarantees. We provide a formal specification and construction for each layer of an abstract cryptocurrency protocol, and prove that our constructions satisfy their specifications.
520 $a The contributions of this thesis are centered around two new abstractions: "scratch-off puzzles," and the "blockchain functionality" model. Scratch-off puzzles are a generalization of the Bitcoin "mining" algorithm, its most iconic and novel design feature. We show how to provide secure upgrades to a cryptocurrency by instantiating the protocol with alternative puzzle schemes. We construct secure puzzles that address important and well-known challenges facing Bitcoin today, including wasted energy and dangerous coalitions.
520 $a The blockchain functionality is a general-purpose model of a cryptocurrency rooted in the "Universal Composability" cryptography theory. We use this model to express a wide range of applications, including transparent "smart contracts" (like those featured in Bitcoin and Ethereum), and also privacy-preserving applications like sealed-bid auctions. We also construct a new protocol compiler, called Hawk, which translates user-provided specifications into privacy-preserving protocols based on zero-knowledge proofs.
590 $a School code: 0117.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a University of Maryland, College Park. $b Computer Science. $3 1018451
773 0 $t Dissertation Abstracts International $g 78-03B(E).
790 $a 0117
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10159167