CoChat

Retricoin: Bitcoin based on compact proofs of retrievability

Sengupta, Binanda, Bag, Samiran, Ruj, Sushmita, Sakurai, Kouichi · 2016 · Proceedings of the 17th International Conference on Distributed Computing and Networking
Cited by 35

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2833312.2833317

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Tor: The Second-Generation Onion Router

    Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104 · cited 1×

    “Here, the idea is to use the mining power of Tor [12] relay users to generate the proof-of-work on behalf of the Tor relay network which is used by Tor to earn mining reward.”
    Method
  • A Digital Signature Based on a Conventional Encryption Function

    Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · cited 2×

    “…e-cash scheme found in the literature that is based solely on the concept of proofs of retrievability, where the dealer constructs a Merkle hash tree [22] (for authenticated storage) on the segments of a file and distributes these segments to guarantee that it is retrievable at any point of time.”
    Background

Show all 2 references

Cited by

See all 35

Metadata

Authors
Sengupta, B., Bag, S., Ruj, S., & Sakurai, K.
Venue
Proceedings of the 17th International Conference on Distributed Computing and Networking
Publisher
ACM
Published
2016-01-04
Pages
1-10
OpenAlex
W2261664117
Cited by
35
References
2
FWCI
5.70
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Retricoin: Bitcoin based on compact proofs of retrievability. https://app.cochat.ai/papers/10.1145/2833312.2833317
The paper
Sengupta, B., Bag, S., Ruj, S., & Sakurai, K. (2016). Retricoin: Bitcoin based on compact proofs of retrievability. Proceedings of the 17th International Conference on Distributed Computing and Networking. https://doi.org/10.1145/2833312.2833317

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.