Open Access Open Access  Restricted Access Subscription Access

A Peer-to-Peer Electronic Money Plan

Mahesh Kumar Raghav

Abstract


A simply shared variant of electronic money would permit online installments to be sent straightforwardly starting with one party then onto the next without going through a monetary establishment. Digital signatures are a part of the solution, but if a reputable third party is still needed to prevent double spending, the main benefits are lost. We propose an answer for the twofold spending issue utilizing a shared organization. By hashing transactions into an ongoing chain of hash-based proof-of-work, the network creates a record that cannot be altered without redoing the proof-of-work. In addition to providing evidence of the observed sequence of events, the longest chain also demonstrates that it originated from the largest pool of CPU power. Up to a greater part of computer chip power is constrained by hubs that are not coordinating to go after the organization; they'll produce the longest chain and dominate assailants. The actual organization requires negligible construction. Nodes can leave and come back to the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone. Messages are sent using their best efforts.


Full Text:

PDF

References


http://www.weidai.com/bmoney.txt

Massias, H., Avila, X. S., & Quisquater, J. J. (1999). Design of a secure timestamping service with minimal trust requirements, In 20th Sympo-sium on Information Theory in the Benelux.

Haber, S., & Stornetta, W. S. (1991). How to time-stamp a digital document (pp. 437-455). Springer Berlin Heidelberg.

Bayer, D., Haber, S., & Stornetta, W. S. (1993). Improving the efficiency and reliability of digital time-stamping. In Sequences II: Methods in Communication, Security, and Computer Science (pp. 329-334). Springer New York.

Haber, S., & Stornetta, W. S. (1997, April). Secure names for bit-strings. In Proceedings of the 4th ACM Conference on Computer and Communications Security (pp. 28-35).

Back, A. (2002). Hashcash-a denial of service counter-measure.

Merkle, R. C. (1980, April). Protocols for public key cryptosystems. In 1980 IEEE symposium on security and privacy (pp. 122-122). IEEE.


Refbacks

  • There are currently no refbacks.