{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:42Z","timestamp":1750221282570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T00:00:00Z","timestamp":1509667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,3]]},"DOI":"10.1145\/3140649.3140652","type":"proceedings-article","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T12:31:37Z","timestamp":1509453097000},"page":"51-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Note on the Security of Equihash"],"prefix":"10.1145","author":[{"given":"Leo","family":"Alcock","sequence":"first","affiliation":[{"name":"Independent scholar, Lexington, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Antminer S9. Bitmain https:\/\/shop.bitmain.com\/market.htm?name=antminer_s9_asic_bitcoin_miner. Accessed: 2017-02-04. Antminer S9. Bitmain https:\/\/shop.bitmain.com\/market.htm?name=antminer_s9_asic_bitcoin_miner. Accessed: 2017-02-04.","DOI":"10.4103\/2348-0548.199942"},{"key":"e_1_3_2_1_2_1","unstructured":"Equihash-xenon. https:\/\/github.com\/xenoncat\/equihash-xenon. Equihash-xenon. https:\/\/github.com\/xenoncat\/equihash-xenon."},{"key":"e_1_3_2_1_3_1","unstructured":"Ethash. https:\/\/github.com\/ethereum\/wiki\/wiki\/Ethash. Accessed: 2017-08-04. Ethash. https:\/\/github.com\/ethereum\/wiki\/wiki\/Ethash. Accessed: 2017-08-04."},{"key":"e_1_3_2_1_4_1","unstructured":"David G. Andersen. Exploiting time-memory tradeoffs in cuckoo cycle 2014. (Accessed August 2016) https:\/\/www.cs.cmu.edu\/dga\/crypto\/cuckoo\/analysis.pdf. David G. Andersen. Exploiting time-memory tradeoffs in cuckoo cycle 2014. (Accessed August 2016) https:\/\/www.cs.cmu.edu\/dga\/crypto\/cuckoo\/analysis.pdf."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10879-7_31"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23108"},{"key":"e_1_3_2_1_8_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald Rivest and Clifford Stein. Introduction to algorithms. MIT press 2009. Thomas H. Cormen Charles E. Leiserson Ronald Rivest and Clifford Stein. Introduction to algorithms. MIT press 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_24"},{"key":"e_1_3_2_1_10_1","first-page":"139","volume-title":"Advances in Cryptology-CRYPTO 1992","author":"Dwork Cynthia","year":"1992"},{"volume-title":"NDSS","year":"2016","author":"Dmitry Khovratovich Alex Biryukov","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","unstructured":"Paul Kirchner. Improved generalized birthday attack 2011. Paul Kirchner. Improved generalized birthday attack 2011."},{"key":"e_1_3_2_1_13_1","unstructured":"Daniel Larimer. Momentum: a memory-hard proof-of-work via finding birthday collisions. Daniel Larimer. Momentum: a memory-hard proof-of-work via finding birthday collisions."},{"key":"e_1_3_2_1_14_1","unstructured":"Colin Percival. Stronger key derivation via sequential memory-hard functions 2009. Colin Percival. Stronger key derivation via sequential memory-hard functions 2009."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_11"},{"key":"e_1_3_2_1_16_1","unstructured":"John Tromp. Cuckoo cycle: a memory-hard proof-of-work system 2014. John Tromp. Cuckoo cycle: a memory-hard proof-of-work system 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_19"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 on Cloud Computing Security Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3140649.3140652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3140649.3140652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:21Z","timestamp":1750212681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3140649.3140652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":17,"alternative-id":["10.1145\/3140649.3140652","10.1145\/3140649"],"URL":"https:\/\/doi.org\/10.1145\/3140649.3140652","relation":{},"subject":[],"published":{"date-parts":[[2017,11,3]]},"assertion":[{"value":"2017-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}