On the application of clique problem for proof-of-work in cryptocurrencies

Samiran Bag, Sushmita Ruj, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

In this work we propose a scheme that could be used as an alternative to the existing proof of work(PoW) scheme for mining in Bitcoin P2P network. Our scheme ensures that the miner must do at least a non-trivial amount of computation for solving the computational problem put forth in the paper and thus solving a PoW puzzle. Here, we have proposed to use the problem of finding the largest clique in a big graph as a replacement for the existing Bitcoin PoW scheme. In this paper, we have dealt with a graph having O(230) vertices and O(248) edges which is constructed deterministically using the set of transactions executed within a certain time slot. We have discussed some algorithms that can be used by any Bitcoin miner to solve the PoW puzzle. Then we discuss an algorithm that could perform this task by doing O(280) hash calculations. We have also proposed an improvement to this algorithm by which the PoW puzzle can be solved by calculating O(270.5) hashes and using O(248) space. This scheme is better than the existing proof of work schemes that use Hashcash, where a lucky miner could manage to find a solution to the proof of work puzzle by doing smaller amount of computation though it happens with very low probability. Bitcoin incentivizes the computing power of miners and hence, it is desirable that miners with more computing power always wins. Also, the Bitcoin PoW scheme only incentivizes computing power of miners but our PoW scheme incentivizes both computing power and memory of a miner. In our proposed scheme only the miner cannot randomly find a largest clique without knowing the clique number of the graph.

本文言語英語
ホスト出版物のタイトルInformation Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers
編集者Dongdai Lin, Xiao Feng Wang, Moti Yung
出版社Springer Verlag
ページ260-279
ページ数20
ISBN(印刷版)9783319388977
DOI
出版ステータス出版済み - 2016
イベント11th International Conference on Information Security and Cryptology, Inscrypt 2015 - Beijing, 中国
継続期間: 11 1 201511 3 2015

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9589
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他11th International Conference on Information Security and Cryptology, Inscrypt 2015
国/地域中国
CityBeijing
Period11/1/1511/3/15

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On the application of clique problem for proof-of-work in cryptocurrencies」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル