bitcoin
play

Bitcoin Portland State University CS 410/510 Blockchain Development - PowerPoint PPT Presentation

Bitcoin Portland State University CS 410/510 Blockchain Development & Security Pecursor #1: Ledgers Portland State University CS 410/510 Blockchain Development & Security Led edger gers At the beginning of written history (~3000


  1. Bitcoin Portland State University CS 410/510 Blockchain Development & Security

  2. Pecursor #1: Ledgers Portland State University CS 410/510 Blockchain Development & Security

  3. Led edger gers  At the beginning of written history (~3000 BC, Mesapotamia)  Believed to be used to record barley transactions, and payments  Reduces errors to make system more trustworthy  Recorded on papyrus scrolls or clay Portland State University CS 410/510 Blockchain Development & Security

  4. Doub Do uble le-entr entry y book-keepin eeping  Managing accounts so that any debit has an equal and offsetting credit amount.  Pacioli, da Vinci circa 1494 as monetary systems begin to take hold in Europe  Ensures integrity of ledger and keeps it from an invalid state  Parts  Original records (transactions)  Classification (organized per account and placed into a single ledger)  Summary (profit and loss)  Modern example Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  5. But…  Ledger is centralized  Implicit trust on the person managing it Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  6.  Enron, Arthur Andersen 2001  Lehman Brothers 2008  GE 2019 Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  7. Qu Ques estio tions ns  If developed nations can't get it right, how can 3 rd world countries?  Centralized book-keeping has a trust issue  Even if book-keeper is trustworthy, what if the ledger is hacked or deleted?  Adversaries or disgruntled insiders tampering with the ledger  Motivates the need for a decentralized ledger, tamper-resistant ledger that is replicated  Shared ledger of synchronized, authenticated digital data kept and maintained in a decentralized manner and cryptographically secured Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  8. Precursor #2: Currencies Portland State University CS 410/510 Blockchain Development & Security

  9. Cur urrency rency  Direct settlement via untraceable exchange of money for goods/services  ~3,000 B.C. in Egypt  Revolves around precious metals (e.g. gold) and agricultural products (barley)  Adopted by many ancient civilizations (e.g. Greek)  In the US, gold/silver made into legal tender via Mint and Coinage Act of 1792  Establishes fixed price between gold and US dollar  US Mint buys and sells gold and silver at a value of 15:1  In 1862, unable to pay debts using gold/silver, US adopts paper money as legal tender  Establishes a "fiat" currency for the first time in the US  e.g. not convertible on demand at a fixed rate  Silver controversially removed from circulation in Coinage Act of 1873 Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  10.  In 1900, gold standard established and paper dollars issued to represent US gold reserves  Bretton Woods Agreements (1944)  WW II wreaks havoc on gold standard  Create gold exchange standard where price of gold fixed to the US dollar ($35 for ounce of gold)  Helps make US a global superpower Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  11. Cur urrencies rencies and d sc scar arcit city  Gold standard provides stability in monetary supply via scarcity of gold  But perhaps not flexibility to react to problematic economic situations since supply of currency unchanged (John Maynard Keynes)  Nixon 1971  Drops gold standard in financial fallout of Vietnam war  Government can now control scarcity of currency to manipulate value  Many believe this was problematic Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Introduction to Blockchain

  12. Di Digi gicash cash (1982) 2)  Secure, anonymous digital cash proposed by David Chaum  Want the benefits of on-line transactions without the drawback of transactions being traceable  Credit card transactions provide a paper-trail  Model  Users obtain digital currency from bank  Spend it in a manner not traceable by bank  Done via blind signatures  http://www.hit.bme.hu/~buttyan/courses/BMEVIHIM219/2009/Chaum.BlindS igForPayment.1982.PDF  High level  Bank uses its private key s' to sign anything  Anything signed is worth $1  Payer with an account at the bank will create a single $1 note, blind it, get it signed by the bank, unblind it, and provide it to the payee.  Payee (also with an account at the bank) clears note with the bank who updates the balance Portland State University CS 410/510 Blockchain Development & Security

  13.  Special commuting (blinding) function  c'(s'(c(x))) = s'(x)  c will be the blinding function the payer will apply  s' is the signing function of the bank (e.g. its private key)  s is the inverse of s' such that s(s'(x)) = x  Redundancy predicate r adds redundancy to make search for valid signatures impractical in c  Effectively an integrity check Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  14.  Payer randomly chooses x s.t. r(x) holds for c(x)  Gives c(x) to the bank to sign  Bank signs c(x) and returns s'(c(x)) to payer  Debits payer's account $1  Payer can not lose s'(c(x)) since it's a live $1 note!  Payer computes c'(s'(c(x))) to yield s'(x)  Payer checks that s'(x) is valid by applying bank's public key to get x back via s(s'(x))  Payer makes a payment to payee by providing s'(x)  Payee forms r(s(s'(x)) and stops if false  Payee forwards s'(x) to bank  Note that it has never seen x before since it was given as c(x) so it does not know the payer involved! (This is the magic)  Bank forms r(s(s'(x)) and stops if false  Bank checks note against a comprehensive list of cleared notes and stops if it is a double-spend, otherwise adds note to list  Bank adds $1 to payee Portland State University CS 410/510 Blockchain Development & Security Portland State University CS 410/510 Blockchain Development & Security

  15. Hashc shcash ash (1997) 7)  Defense against email spam and DoS attacks developed by Adam Back  Computational digital postage on e-mail messages  Solution to a difficult proof-of-work puzzle used as postage  Find any x where SHA(x || message) < Y  Leverages pre-image resistance, avalanche effect of hash function Portland State University CS 410/510 Blockchain Development & Security

  16. Precursor #3: Decentralized networks Portland State University CS 410/510 Blockchain Development & Security

  17. Napst pster er (1999) 9)  P2P file sharing system developed by Shawn Fanning  One of the first decentralized applications on the Internet where users participate in system  Central registry maintains metadata on peers and files they have  Peers store actual copies of files  Centralization of registry makes "censorship" trivial Portland State University CS 410/510 Blockchain Development & Security

  18. Gn Gnut utella ella (2000) 0)  Alternative to centralized registry  Peers form an overlay network and are largely equal to each other  Queries broadcast throughout network (hop-limited)  Can not be shut down (unless one does a wholesale block of its ports)  Both protocol and source code are open-source Portland State University CS 410/510 Blockchain Development & Security

  19. BitT Bi tTorr rrent ent (2001) 1)  File-sharing application for large files written by Bram Cohen  Creates a P2P network on-demand per file being distributed  Nodes with entire copy of file called "seeds"  Altruistically allow others to copy parts of file  Nodes downloading a file allow other clients to download the parts it already has  Eliminates free-loading, creates much higher transfer rates  Censorship-resistant  Difficult to shut down all seeds once a torrent is established  Results in MPAA going after search-engines for finding torrents instead of individuals holding seeds (e.g. PirateBay) Portland State University CS 410/510 Blockchain Development & Security

  20. Blockchains and cryptocurrencies Portland State University CS 410/510 Blockchain Development & Security

  21. Go Goals als  Decentralized trust  Tamper-resistant records (e.g. append-only ledger of immutable entries)  Highly available and replicated  Low overhead (in computational resources, network bandwidth, transaction latency, transaction costs)  Anonymous (?) Portland State University CS 410/510 Blockchain Development & Security

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend