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

DOI10.1007/978-3-319-38898-4_16MaRDI QIDQ5740252zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random graphclique problembitcoinproof of work

Mathematics Subject Classification ID

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

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

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)