Permacoin: Repurposing Bitcoin Work for Data Preservation

Andrew Miller, Ari Juels, Elaine Shi, Bryan Parno, Jonathan Katz

Research output: Contribution to conferencePaper

Abstract

Bit coin is widely regarded as the first broadly successful e-cash system. An oft-cited concern, though, is that mining Bit coins wastes computational resources. Indeed, Bit coin's underlying mining mechanism, which we call a scratch-off puzzle (SOP), involves continuously attempting to solve computational puzzles that have no intrinsic utility. We propose a modification to Bit coin that repurposes its mining resources to achieve a more broadly useful goal: distributed storage of archival data. We call our new scheme Perm coin. Unlike Bit coin and its proposed alternatives, Perm coin requires clients to invest not just computational resources, but also storage. Our scheme involves an alternative scratch-off puzzle for Bit coin based on Proofs-of-Retrievability (PORs). Successfully minting money with this SOP requires local, random access to a copy of a file. Given the competition among mining clients in Bit coin, this modified SOP gives rise to highly decentralized file storage, thus reducing the overall waste of Bit coin. Using a model of rational economic agents we show that our modified SOP preserves the essential properties of the original Bit coin puzzle. We also provide parameterizations and calculations based on realistic hardware constraints to demonstrate the practicality of Perm coin as a whole.
Original languageEnglish (US)
Pages475-490
DOIs
StatePublished - May 2014
Event2014 IEEE Symposium on Security and Privacy (SP) - San Jose, CA
Duration: May 18 2014May 21 2014

Conference

Conference2014 IEEE Symposium on Security and Privacy (SP)
Period5/18/145/21/14

Fingerprint

Parameterization
Hardware
Economics

Keywords

  • online banking
  • peer-to-peer computing
  • data mining
  • investment
  • public key
  • outsourcing

Cite this

Miller, A., Juels, A., Shi, E., Parno, B., & Katz, J. (2014). Permacoin: Repurposing Bitcoin Work for Data Preservation. 475-490. Paper presented at 2014 IEEE Symposium on Security and Privacy (SP), . https://doi.org/10.1109/SP.2014.37

Permacoin: Repurposing Bitcoin Work for Data Preservation. / Miller, Andrew; Juels, Ari; Shi, Elaine; Parno, Bryan; Katz, Jonathan.

2014. 475-490 Paper presented at 2014 IEEE Symposium on Security and Privacy (SP), .

Research output: Contribution to conferencePaper

Miller, A, Juels, A, Shi, E, Parno, B & Katz, J 2014, 'Permacoin: Repurposing Bitcoin Work for Data Preservation' Paper presented at 2014 IEEE Symposium on Security and Privacy (SP), 5/18/14 - 5/21/14, pp. 475-490. https://doi.org/10.1109/SP.2014.37
Miller A, Juels A, Shi E, Parno B, Katz J. Permacoin: Repurposing Bitcoin Work for Data Preservation. 2014. Paper presented at 2014 IEEE Symposium on Security and Privacy (SP), . https://doi.org/10.1109/SP.2014.37
Miller, Andrew ; Juels, Ari ; Shi, Elaine ; Parno, Bryan ; Katz, Jonathan. / Permacoin: Repurposing Bitcoin Work for Data Preservation. Paper presented at 2014 IEEE Symposium on Security and Privacy (SP), .
@conference{ea2aa691004944a2a3c591254859c250,
title = "Permacoin: Repurposing Bitcoin Work for Data Preservation",
abstract = "Bit coin is widely regarded as the first broadly successful e-cash system. An oft-cited concern, though, is that mining Bit coins wastes computational resources. Indeed, Bit coin's underlying mining mechanism, which we call a scratch-off puzzle (SOP), involves continuously attempting to solve computational puzzles that have no intrinsic utility. We propose a modification to Bit coin that repurposes its mining resources to achieve a more broadly useful goal: distributed storage of archival data. We call our new scheme Perm coin. Unlike Bit coin and its proposed alternatives, Perm coin requires clients to invest not just computational resources, but also storage. Our scheme involves an alternative scratch-off puzzle for Bit coin based on Proofs-of-Retrievability (PORs). Successfully minting money with this SOP requires local, random access to a copy of a file. Given the competition among mining clients in Bit coin, this modified SOP gives rise to highly decentralized file storage, thus reducing the overall waste of Bit coin. Using a model of rational economic agents we show that our modified SOP preserves the essential properties of the original Bit coin puzzle. We also provide parameterizations and calculations based on realistic hardware constraints to demonstrate the practicality of Perm coin as a whole.",
keywords = "online banking, peer-to-peer computing, data mining, investment, public key, outsourcing",
author = "Andrew Miller and Ari Juels and Elaine Shi and Bryan Parno and Jonathan Katz",
year = "2014",
month = "5",
doi = "10.1109/SP.2014.37",
language = "English (US)",
pages = "475--490",
note = "2014 IEEE Symposium on Security and Privacy (SP) ; Conference date: 18-05-2014 Through 21-05-2014",

}

TY - CONF

T1 - Permacoin: Repurposing Bitcoin Work for Data Preservation

AU - Miller, Andrew

AU - Juels, Ari

AU - Shi, Elaine

AU - Parno, Bryan

AU - Katz, Jonathan

PY - 2014/5

Y1 - 2014/5

N2 - Bit coin is widely regarded as the first broadly successful e-cash system. An oft-cited concern, though, is that mining Bit coins wastes computational resources. Indeed, Bit coin's underlying mining mechanism, which we call a scratch-off puzzle (SOP), involves continuously attempting to solve computational puzzles that have no intrinsic utility. We propose a modification to Bit coin that repurposes its mining resources to achieve a more broadly useful goal: distributed storage of archival data. We call our new scheme Perm coin. Unlike Bit coin and its proposed alternatives, Perm coin requires clients to invest not just computational resources, but also storage. Our scheme involves an alternative scratch-off puzzle for Bit coin based on Proofs-of-Retrievability (PORs). Successfully minting money with this SOP requires local, random access to a copy of a file. Given the competition among mining clients in Bit coin, this modified SOP gives rise to highly decentralized file storage, thus reducing the overall waste of Bit coin. Using a model of rational economic agents we show that our modified SOP preserves the essential properties of the original Bit coin puzzle. We also provide parameterizations and calculations based on realistic hardware constraints to demonstrate the practicality of Perm coin as a whole.

AB - Bit coin is widely regarded as the first broadly successful e-cash system. An oft-cited concern, though, is that mining Bit coins wastes computational resources. Indeed, Bit coin's underlying mining mechanism, which we call a scratch-off puzzle (SOP), involves continuously attempting to solve computational puzzles that have no intrinsic utility. We propose a modification to Bit coin that repurposes its mining resources to achieve a more broadly useful goal: distributed storage of archival data. We call our new scheme Perm coin. Unlike Bit coin and its proposed alternatives, Perm coin requires clients to invest not just computational resources, but also storage. Our scheme involves an alternative scratch-off puzzle for Bit coin based on Proofs-of-Retrievability (PORs). Successfully minting money with this SOP requires local, random access to a copy of a file. Given the competition among mining clients in Bit coin, this modified SOP gives rise to highly decentralized file storage, thus reducing the overall waste of Bit coin. Using a model of rational economic agents we show that our modified SOP preserves the essential properties of the original Bit coin puzzle. We also provide parameterizations and calculations based on realistic hardware constraints to demonstrate the practicality of Perm coin as a whole.

KW - online banking

KW - peer-to-peer computing

KW - data mining

KW - investment

KW - public key

KW - outsourcing

U2 - 10.1109/SP.2014.37

DO - 10.1109/SP.2014.37

M3 - Paper

SP - 475

EP - 490

ER -