You are looking at a specific version 20171227:112509 of this paper. See the latest version.

Paper 2017/1242

Designing Proof of Transaction Puzzles for Cryptocurrency

Taotao Li and Parhat Abla and Mingsheng Wang and Qianwen Wei

Abstract

One of the Bitcoin's innovations is the Proof of Work puzzle (aka scratch-off puzzle) as a consensus protocol for anonymous networks without pre-established PKI. Bitcoins based on the Proof of Work puzzle have been harshly blamed today for problems such as energy wasted and not easily scalable. In this paper, we construct a novel Proof of Transaction(PoT) puzzle, and prove that PoT puzzle satisfies the basic construction conditions of scratch-off puzzle. We also show construction of PoTcoin as application. To reduce the network load we use sequential aggregate signature. PoTcoin has many advantage but not limited as strengthening the network topology, promoting currency circulation, anti-outsourcing computing and environment-friendly.

Note: The paper is not published yet, hoping for an early publication.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
proof of transactionsequential aggregate signatureblockchain
Contact author(s)
taotaolittl @ outlook com
History
2018-09-14: last of 6 revisions
2017-12-23: received
See all versions
Short URL
https://ia.cr/2017/1242
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.