{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:23:18Z","timestamp":1773840198999,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T00:00:00Z","timestamp":1498089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"William and Flora Hewlett Foundation","award":["037897"],"award-info":[{"award-number":["037897"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,22]]},"DOI":"10.1145\/3080556.3084082","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:21:49Z","timestamp":1497986509000},"page":"37-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Better Not to Know?"],"prefix":"10.1145","author":[{"given":"Nick","family":"Merrill","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.7146\/aahcc.v1i1.21199"},{"key":"e_1_3_2_1_2_1","unstructured":"David P Anderson. 2004. Public Computing : Reconnecting People to Science. Knowledge Creation Diffusion Utilization (2004) 1--6. http:\/\/boinc.berkeley.edu\/boinc2.pdf  David P Anderson. 2004. Public Computing : Reconnecting People to Science. Knowledge Creation Diffusion Utilization (2004) 1--6. http:\/\/boinc.berkeley.edu\/boinc2.pdf"},{"key":"e_1_3_2_1_3_1","unstructured":"Jane Bennett. 2013. Vibrant Matter: a political ecology of things. Vol. 53. 1689--1699 pages. arXiv:arXiv:1011.1669v3  Jane Bennett. 2013. Vibrant Matter: a political ecology of things. Vol. 53. 1689--1699 pages. arXiv:arXiv:1011.1669v3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_3"},{"key":"e_1_3_2_1_5_1","unstructured":"Craig Buckler. 2016. Browser Trends January 2016: 12 Month Review. (2016). https:\/\/www.sitepoint.com\/ browser-trends-january-2016--12-month-review\/  Craig Buckler. 2016. Browser Trends January 2016: 12 Month Review. (2016). https:\/\/www.sitepoint.com\/ browser-trends-january-2016--12-month-review\/"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. Int. Symp on Process Organization Studies","author":"Dourish Paul","year":"2011"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5040\/9781350070660"},{"key":"e_1_3_2_1_8_1","unstructured":"Ryan et al Sleevi. 2014. Intent to Deprecate: SHA-1 certificates. (2014). https:\/\/groups.google.com\/a\/chromium.org\/forum\/  Ryan et al Sleevi. 2014. Intent to Deprecate: SHA-1 certificates. (2014). https:\/\/groups.google.com\/a\/chromium.org\/forum\/"},{"key":"e_1_3_2_1_9_1","unstructured":"Antti Koivisto. 2017. Bug 168774 - Add a test verifying cache deduplication is not sensitive to SHA1 collision attack. (2017). https:\/\/bugs.webkit.org\/show  Antti Koivisto. 2017. Bug 168774 - Add a test verifying cache deduplication is not sensitive to SHA1 collision attack. (2017). https:\/\/bugs.webkit.org\/show"},{"key":"e_1_3_2_1_10_1","unstructured":"Mozilla. 2017. CA:Problematic Practices. (2017). https:\/\/wiki. mozilla.org\/CA:Problematic  Mozilla. 2017. CA:Problematic Practices. (2017). https:\/\/wiki. mozilla.org\/CA:Problematic"},{"key":"e_1_3_2_1_12_1","unstructured":"Q-Success. 2017. Usage of SSL certificate authorities for websites. (2017). https:\/\/w3techs.com\/technologies\/overview\/ssl  Q-Success. 2017. Usage of SSL certificate authorities for websites. (2017). https:\/\/w3techs.com\/technologies\/overview\/ssl"},{"key":"e_1_3_2_1_13_1","unstructured":"Bruce Schneier. 2005. Cryptanalysis of SHA-1. (2005). https: \/\/www.schneier.com\/blog\/archives\/2005\/02\/cryptanalysis  Bruce Schneier. 2005. Cryptanalysis of SHA-1. (2005). https: \/\/www.schneier.com\/blog\/archives\/2005\/02\/cryptanalysis"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5210\/fm.v20i8.6128"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Ale Stamos. 2015. The SHA-1 Sunset. (2015).  Ale Stamos. 2015. The SHA-1 Sunset. (2015).","DOI":"10.1002\/9783527678679.dg12665"},{"key":"e_1_3_2_1_16_1","volume-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":"Stevens Marc"},{"key":"e_1_3_2_1_17_1","unstructured":"Marc Stevens. 2017. cr-marcstevens\/sha1collisiondetection. (2017). https:\/\/github.com\/cr-marcstevens\/ sha1collisiondetection  Marc Stevens. 2017. cr-marcstevens\/sha1collisiondetection. (2017). https:\/\/github.com\/cr-marcstevens\/ sha1collisiondetection"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Marc Stevens Elie Bursztein Pierre Karpman Ange Albertini and Yarik Markov. 2017. The first collision for full SHA-1. (2017). https:\/\/shattered.it\/static\/shattered.pdf  Marc Stevens Elie Bursztein Pierre Karpman Ange Albertini and Yarik Markov. 2017. The first collision for full SHA-1. (2017). https:\/\/shattered.it\/static\/shattered.pdf","DOI":"10.1007\/978-3-319-63688-7_19"},{"key":"e_1_3_2_1_19_1","volume-title":"Re: SHA1 collisions found.","author":"Torvalds Linus","year":"2017"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_2"},{"key":"e_1_3_2_1_21_1","first-page":"148","article-title":"Do artifacts have politics","volume":"109","author":"Winner Langdon","year":"2003","journal-title":"Technology and the Future"}],"event":{"name":"LIMITS '17: Workshop on Computing Within Limits","location":"Santa Barbara California USA","acronym":"LIMITS '17","sponsor":["SIGCAS ACM Special Interest Group on Computers and Society"]},"container-title":["Proceedings of the 2017 Workshop on Computing Within Limits"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3080556.3084082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3080556.3084082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:58Z","timestamp":1750217818000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3080556.3084082"}},"subtitle":["The SHA1 Collision & the Limits of Polemic Computation"],"short-title":[],"issued":{"date-parts":[[2017,6,22]]},"references-count":20,"alternative-id":["10.1145\/3080556.3084082","10.1145\/3080556"],"URL":"https:\/\/doi.org\/10.1145\/3080556.3084082","relation":{},"subject":[],"published":{"date-parts":[[2017,6,22]]},"assertion":[{"value":"2017-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}