{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:16:10Z","timestamp":1757452570718,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Defense Advanced Research Projects Agency","award":["HR00112020023"],"award-info":[{"award-number":["HR00112020023"]}]},{"name":"NSF (National Science Foundation)","award":["CNS-2154149,DGE-2141064"],"award-info":[{"award-number":["CNS-2154149,DGE-2141064"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649686","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1712-1723","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Memory Checking Requires Logarithmic Overhead"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0360-8129","authenticated-orcid":false,"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"Reichman University, Herzliya, Israel \/ NTT Research, Sunnyvale, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel \/ NTT Research, Sunnyvale, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0555-4200","authenticated-orcid":false,"given":"Neekon","family":"Vafa","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3566049"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-023-09447-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185212"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Jonathan Bootle Alessandro Chiesa Yuncong Hu and Michele Orr\u00f9. 2022. Gemini: Elastic SNARKs for Diverse Environments. In Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques Trondheim Norway May 30 - June 3 2022 Proceedings Part II Orr Dunkelman and Stefan Dziembowski (Eds.) (Lecture Notes in Computer Science Vol. 13276). Springer 427\u2013457. https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15 10.1007\/978-3-031-07085-3_15","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840761"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-015-9216-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.24"},{"key":"e_1_3_2_1_12_1","unstructured":"Victor Costan and Srinivas Devadas. 2016. Intel SGX Explained. IACR Cryptol. ePrint Arch. 86. http:\/\/eprint.iacr.org\/2016\/086"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_30"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_15_1","volume-title":"TR23-064","author":"Goldreich Oded","year":"2023","unstructured":"Oded Goldreich. 2023. On the Lower Bound on the Length of Relaxed Locally Decodable Codes. Electron. Colloquium Comput. Complex., TR23-064 (2023), ECCC:TR23-064. https:\/\/eccc.weizmann.ac.il\/report\/2023\/064"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315317"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_20"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_18"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 11th USENIX conference on File and Storage Technologies, FAST 2013","author":"Lorch Jacob R.","year":"2013","unstructured":"Jacob R. Lorch, Bryan Parno, James W. Mickens, Mariana Raykova, and Joshua Schiffman. 2013. Shroud: ensuring private access to large-scale data in the data center. In Proceedings of the 11th USENIX conference on File and Storage Technologies, FAST 2013, San Jose, CA, USA, February 12-15, 2013, Keith A. Smith and Yuanyuan Zhou (Eds.). USENIX, 199\u2013214. https:\/\/www.usenix.org\/conference\/fast13\/technical-sessions\/presentation\/lorch"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48618-0_15"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462153.1462155"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222016"},{"key":"e_1_3_2_1_28_1","volume-title":"Integrity Checking in Cryptographic File Systems with Constant Trusted Storage. In Proceedings of the 16th USENIX Security Symposium","author":"Oprea Alina","year":"2007","unstructured":"Alina Oprea and Michael K. Reiter. 2007. Integrity Checking in Cryptographic File Systems with Constant Trusted Storage. In Proceedings of the 16th USENIX Security Symposium, Boston, MA, USA, August 6-10, 2007, Niels Provos (Ed.). USENIX Association. https:\/\/www.usenix.org\/conference\/16th-usenix-security-symposium\/integrity-checking-cryptographic-file-systems-constant"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_3_2_1_30_1","volume-title":"Scaling Verifiable Computation Using Efficient Set Accumulators. In 29th USENIX Security Symposium, USENIX Security 2020","author":"Ozdemir Alex","year":"2020","unstructured":"Alex Ozdemir, Riad S. Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling Verifiable Computation Using Efficient Set Accumulators. In 29th USENIX Security Symposium, USENIX Security 2020, August 12-14, 2020, Srdjan Capkun and Franziska Roesner (Eds.). USENIX Association, 2075\u20132092. https:\/\/www.usenix.org\/conference\/usenixsecurity20\/presentation\/ozdemir"},{"key":"e_1_3_2_1_31_1","unstructured":"Charalampos Papamanthou and Roberto Tamassia. 2011. Optimal and Parallel Online Memory Checking. Cryptology ePrint Archive."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00087"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2013.6670339"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-012-9129-2"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177872"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623195"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":40,"alternative-id":["10.1145\/3618260.3649686","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649686","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}