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

DOI10.1007/978-3-319-38898-4_16zbMATH Open1409.94861OpenAlexW2474020702MaRDI QIDQ5740252FDOQ5740252

Authors: Samiran Bag, Sushmita Ruj, Kouichi Sakurai 

Publication date: 25 July 2016

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-38898-4_16

Recommendations

• Analysis of variance of graph-clique mining for scalable proof of work
• Proofs of space
• scientific article; zbMATH DE number 1303611
• CArrency: an energy-efficient proof-of-work scheme for crypto-currencies
• Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms

zbMATH Keywords

random graphclique problembitcoinproof of work

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60)

Cited In (2)

• Analysis of variance of graph-clique mining for scalable proof of work
• CArrency: an energy-efficient proof-of-work scheme for crypto-currencies

This page was built for publication: On the application of clique problem for proof-of-work in cryptocurrencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740252)