Retricoin: Bitcoin based on compact proofs of retrievability

Binanda Sengupta, Samiran Bag, Kouichi Sakurai, Sushmita Ruj

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In this paper, we propose a scheme called Retricoin which replaces the heavy computational proof-of-work of Bitcoin by proofs of retrievability that have practical benefits. To guarantee the availability of an important but large file, we distribute the segments of the file among the users in the Bitcoin network. Every user who wants to mine Bitcoins must store a considerable portion of this file and prove her storage to other peers in the network using proofs of retrievability. The file can be constructed at any point of time from the users storing their respective segments untampered. Retricoin is more efficient than the existing Permacoin scheme [23] in terms of storage overhead and network bandwidth required to broadcast the proof to the Bitcoin network. The verification time in our scheme is comparable to that of Permacoin and reasonable for all practical purposes. We also design an algorithm to let the miners in a group (or pool) mine collectively.

Original languageEnglish
Title of host publicationProceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450340328
DOIs
Publication statusPublished - Jan 4 2016
Event17th International Conference on Distributed Computing and Networking, ICDCN 2016 - Singapore, Singapore
Duration: Jan 4 2016Jan 7 2016

Publication series

NameACM International Conference Proceeding Series
Volume04-07-January-2016

Other

Other17th International Conference on Distributed Computing and Networking, ICDCN 2016
CountrySingapore
CitySingapore
Period1/4/161/7/16

Fingerprint

Miners
Availability
Bandwidth
Electronic money

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Sengupta, B., Bag, S., Sakurai, K., & Ruj, S. (2016). Retricoin: Bitcoin based on compact proofs of retrievability. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016 [a14] (ACM International Conference Proceeding Series; Vol. 04-07-January-2016). Association for Computing Machinery. https://doi.org/10.1145/2833312.2833317

Retricoin : Bitcoin based on compact proofs of retrievability. / Sengupta, Binanda; Bag, Samiran; Sakurai, Kouichi; Ruj, Sushmita.

Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery, 2016. a14 (ACM International Conference Proceeding Series; Vol. 04-07-January-2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sengupta, B, Bag, S, Sakurai, K & Ruj, S 2016, Retricoin: Bitcoin based on compact proofs of retrievability. in Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016., a14, ACM International Conference Proceeding Series, vol. 04-07-January-2016, Association for Computing Machinery, 17th International Conference on Distributed Computing and Networking, ICDCN 2016, Singapore, Singapore, 1/4/16. https://doi.org/10.1145/2833312.2833317
Sengupta B, Bag S, Sakurai K, Ruj S. Retricoin: Bitcoin based on compact proofs of retrievability. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery. 2016. a14. (ACM International Conference Proceeding Series). https://doi.org/10.1145/2833312.2833317
Sengupta, Binanda ; Bag, Samiran ; Sakurai, Kouichi ; Ruj, Sushmita. / Retricoin : Bitcoin based on compact proofs of retrievability. Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery, 2016. (ACM International Conference Proceeding Series).
@inproceedings{ae04ffdfb6d645f8857f83b3941b6abf,
title = "Retricoin: Bitcoin based on compact proofs of retrievability",
abstract = "Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In this paper, we propose a scheme called Retricoin which replaces the heavy computational proof-of-work of Bitcoin by proofs of retrievability that have practical benefits. To guarantee the availability of an important but large file, we distribute the segments of the file among the users in the Bitcoin network. Every user who wants to mine Bitcoins must store a considerable portion of this file and prove her storage to other peers in the network using proofs of retrievability. The file can be constructed at any point of time from the users storing their respective segments untampered. Retricoin is more efficient than the existing Permacoin scheme [23] in terms of storage overhead and network bandwidth required to broadcast the proof to the Bitcoin network. The verification time in our scheme is comparable to that of Permacoin and reasonable for all practical purposes. We also design an algorithm to let the miners in a group (or pool) mine collectively.",
author = "Binanda Sengupta and Samiran Bag and Kouichi Sakurai and Sushmita Ruj",
year = "2016",
month = "1",
day = "4",
doi = "10.1145/2833312.2833317",
language = "English",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery",
booktitle = "Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016",

}

TY - GEN

T1 - Retricoin

T2 - Bitcoin based on compact proofs of retrievability

AU - Sengupta, Binanda

AU - Bag, Samiran

AU - Sakurai, Kouichi

AU - Ruj, Sushmita

PY - 2016/1/4

Y1 - 2016/1/4

N2 - Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In this paper, we propose a scheme called Retricoin which replaces the heavy computational proof-of-work of Bitcoin by proofs of retrievability that have practical benefits. To guarantee the availability of an important but large file, we distribute the segments of the file among the users in the Bitcoin network. Every user who wants to mine Bitcoins must store a considerable portion of this file and prove her storage to other peers in the network using proofs of retrievability. The file can be constructed at any point of time from the users storing their respective segments untampered. Retricoin is more efficient than the existing Permacoin scheme [23] in terms of storage overhead and network bandwidth required to broadcast the proof to the Bitcoin network. The verification time in our scheme is comparable to that of Permacoin and reasonable for all practical purposes. We also design an algorithm to let the miners in a group (or pool) mine collectively.

AB - Bitcoin [24] is a fully decentralized electronic cash system. The generation of the proof-of-work in Bitcoin requires large amount of computing resources. However, this huge amount of energy is wasted as one cannot make something useful out of it. In this paper, we propose a scheme called Retricoin which replaces the heavy computational proof-of-work of Bitcoin by proofs of retrievability that have practical benefits. To guarantee the availability of an important but large file, we distribute the segments of the file among the users in the Bitcoin network. Every user who wants to mine Bitcoins must store a considerable portion of this file and prove her storage to other peers in the network using proofs of retrievability. The file can be constructed at any point of time from the users storing their respective segments untampered. Retricoin is more efficient than the existing Permacoin scheme [23] in terms of storage overhead and network bandwidth required to broadcast the proof to the Bitcoin network. The verification time in our scheme is comparable to that of Permacoin and reasonable for all practical purposes. We also design an algorithm to let the miners in a group (or pool) mine collectively.

UR - http://www.scopus.com/inward/record.url?scp=84961120735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84961120735&partnerID=8YFLogxK

U2 - 10.1145/2833312.2833317

DO - 10.1145/2833312.2833317

M3 - Conference contribution

AN - SCOPUS:84961120735

T3 - ACM International Conference Proceeding Series

BT - Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016

PB - Association for Computing Machinery

ER -