CArrency: an energy-efficient proof-of-work scheme for crypto-currencies

DOI10.1007/978-981-16-6890-6_3MaRDI QIDQ2079889zbMATH OpenOpenAlexFDO

Authors Souvik Sur, Abhijit Das, Dipanwita Roy Chowdhury

Publication date 7 October 2022

Full work available at URL https://doi.org/10.1007/978-981-16-6890-6_3

zbMATH Keywords

cellular automatacrypto-currenciesdiscrete logarithm problemFPGA implementationproof-of-workSHA-256

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Mathematical economics (91B99) Cryptography (94A60)

Recommendations

• Proofs of space
• Bandwidth hard functions for ASIC resistance
• Time-memory tradeoff attacks on the MTP proof-of-work scheme
• Proofs of Work from worst-case assumptions
• On the application of clique problem for proof-of-work in cryptocurrencies

Cites work

• Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings
• Analysis of one-dimensional linear hybrid cellular automata over GF(q)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 1070886 (Why is no real title available?)
• The Bitcoin Backbone Protocol: Analysis and Applications

Cited in

(3)

• PoSAT: proof-of-work availability and unpredictability, without the work
• On the application of clique problem for proof-of-work in cryptocurrencies
• Quadratically sound proof-of-sequential-work

Describes a project that uses

Uses Software

• Keccak

This page was built for publication: CArrency: an energy-efficient proof-of-work scheme for crypto-currencies

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