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

Samiran Bag, Sushmita Ruj, Kouichi Sakurai

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers
EditorsDongdai Lin, Xiao Feng Wang, Moti Yung
PublisherSpringer Verlag
Pages260-279
Number of pages20
ISBN (Print)9783319388977
DOIs
Publication statusPublished - Jan 1 2016
Event11th International Conference on Information Security and Cryptology, Inscrypt 2015 - Beijing, China
Duration: Nov 1 2015Nov 3 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9589
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference on Information Security and Cryptology, Inscrypt 2015
CountryChina
CityBeijing
Period11/1/1511/3/15

Fingerprint

Miners
Clique
Computing
Graph in graph theory
Electronic money
Clique number
P2P Network
Replacement
Transactions
Mining
Data storage equipment
Alternatives

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bag, S., Ruj, S., & Sakurai, K. (2016). On the application of clique problem for proof-of-work in cryptocurrencies. In D. Lin, X. F. Wang, & M. Yung (Eds.), Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers (pp. 260-279). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9589). Springer Verlag. https://doi.org/10.1007/978-3-319-38898-4_16

On the application of clique problem for proof-of-work in cryptocurrencies. / Bag, Samiran; Ruj, Sushmita; Sakurai, Kouichi.

Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers. ed. / Dongdai Lin; Xiao Feng Wang; Moti Yung. Springer Verlag, 2016. p. 260-279 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9589).

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

Bag, S, Ruj, S & Sakurai, K 2016, On the application of clique problem for proof-of-work in cryptocurrencies. in D Lin, XF Wang & M Yung (eds), Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9589, Springer Verlag, pp. 260-279, 11th International Conference on Information Security and Cryptology, Inscrypt 2015, Beijing, China, 11/1/15. https://doi.org/10.1007/978-3-319-38898-4_16
Bag S, Ruj S, Sakurai K. On the application of clique problem for proof-of-work in cryptocurrencies. In Lin D, Wang XF, Yung M, editors, Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers. Springer Verlag. 2016. p. 260-279. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-38898-4_16
Bag, Samiran ; Ruj, Sushmita ; Sakurai, Kouichi. / On the application of clique problem for proof-of-work in cryptocurrencies. Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers. editor / Dongdai Lin ; Xiao Feng Wang ; Moti Yung. Springer Verlag, 2016. pp. 260-279 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9bab0c99081748b9b8f0b3b06df71a5d,
title = "On the application of clique problem for proof-of-work in cryptocurrencies",
abstract = "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.",
author = "Samiran Bag and Sushmita Ruj and Kouichi Sakurai",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-319-38898-4_16",
language = "English",
isbn = "9783319388977",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "260--279",
editor = "Dongdai Lin and Wang, {Xiao Feng} and Moti Yung",
booktitle = "Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers",
address = "Germany",

}

TY - GEN

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

AU - Bag, Samiran

AU - Ruj, Sushmita

AU - Sakurai, Kouichi

PY - 2016/1/1

Y1 - 2016/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-319-38898-4_16

DO - 10.1007/978-3-319-38898-4_16

M3 - Conference contribution

AN - SCOPUS:84969285681

SN - 9783319388977

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 260

EP - 279

BT - Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Revised Selected Papers

A2 - Lin, Dongdai

A2 - Wang, Xiao Feng

A2 - Yung, Moti

PB - Springer Verlag

ER -