國立虎尾科技大學 |

Provable security for cryptocurrencies.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Provable security for cryptocurrencies./
作者:	Miller, Andrew.
面頁冊數:	1 online resource (119 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-03(E), Section: B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781369141580

Provable security for cryptocurrencies.
Miller, Andrew.

Provable security for cryptocurrencies. - 1 online resource (119 pages)

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

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

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781369141580Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Provable security for cryptocurrencies.
LDR:03419ntm a2200361K 4500 001 912781
005 20180608130007.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781369141580
035 $a (MiAaPQ)AAI10159167
035 $a (MiAaPQ)umd:17522
035 $a AAI10159167
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Miller, Andrew. $3 1185303
245 1 0 $a Provable security for cryptocurrencies.
264 0 $c 2016
300 $a 1 online resource (119 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
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.
504 $a Includes bibliographical references
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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Maryland, College Park. $b Computer Science. $3 1180862
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10159167 $z click for full text (PQDT)