{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T01:14:33Z","timestamp":1780708473134,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":6,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1652259,2247308,2153768"],"award-info":[{"award-number":["1652259,2247308,2153768"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623195","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"1820-1834","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The Locality of Memory Checking"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3280-706X","authenticated-orcid":false,"given":"Weijie","family":"Wang","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2534-5790","authenticated-orcid":false,"given":"Yujie","family":"Lu","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1905-9403","authenticated-orcid":false,"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8525-4514","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2023. Bitcoin Developer Network. https:\/\/bitcoindev.network\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457312"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54455-6_8"},{"key":"e_1_3_2_1_4_1","volume-title":"USA","author":"Bellare Mihir","year":"2007","unstructured":"Mihir Bellare, Alexandra Boldyreva, and Adam O'Neill. 2007. Deterministic and efficiently searchable encryption. In Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings 27. Springer, 535--552."},{"key":"e_1_3_2_1_5_1","volume-title":"EUROCRYPT '93","author":"Benaloh Josh","unstructured":"Josh Benaloh and Michael de Mare. 1994. One-Way Accumulators: A Decentralized Alternative to Digital Signatures. In EUROCRYPT '93, Tor Helleseth (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 274--285."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185212"},{"key":"e_1_3_2_1_7_1","volume-title":"Checking the Correctness of Memories. In 32nd Annual Symposium on Foundations of Computer Science","author":"Blum Manuel","year":"1991","unstructured":"Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, and Moni Naor. 1991. Checking the Correctness of Memories. In 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1--4 October 1991. IEEE Computer Society, 90--99."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"e_1_3_2_1_10_1","volume-title":"Marcel-Cua tua lin Rocs u, and Michael Steiner","author":"Cash David","year":"2014","unstructured":"David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit Jutla, Hugo Krawczyk, Marcel-Cua tua lin Rocs u, and Michael Steiner. 2014. Dynamic searchable encryption in very-large databases: Data structures and implementation. Cryptology ePrint Archive (2014)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363202"},{"key":"e_1_3_2_1_14_1","volume-title":"Edrax: A Cryptocurrency with Stateless Transaction Validation. https:\/\/eprint.iacr.org\/2018\/969.","author":"Chepurnoy Alexander","year":"2018","unstructured":"Alexander Chepurnoy, Charalampos Papamanthou, and Yupeng Zhang. 2018. Edrax: A Cryptocurrency with Stateless Transaction Validation. https:\/\/eprint.iacr.org\/2018\/969."},{"key":"e_1_3_2_1_15_1","volume-title":"USA","author":"Demertzis Ioannis","year":"2018","unstructured":"Ioannis Demertzis, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2018. Searchable encryption with optimal locality: Achieving sublogarithmic read efficiency. In Advances in Cryptology-CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part I 38. Springer, 371--406."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070838.1070856"},{"key":"e_1_3_2_1_17_1","volume-title":"Utreexo: A dynamic hash-based accumulator optimized for the Bitcoin UTXO set. https:\/\/eprint.iacr.org\/2019\/611.","author":"Dryja Thaddeus","year":"2019","unstructured":"Thaddeus Dryja. 2019. Utreexo: A dynamic hash-based accumulator optimized for the Bitcoin UTXO set. https:\/\/eprint.iacr.org\/2019\/611."},{"key":"e_1_3_2_1_18_1","volume-title":"Theory of Cryptography","author":"Dwork Cynthia","unstructured":"Cynthia Dwork, Moni Naor, Guy N. Rothblum, and Vinod Vaikuntanathan. 2009. How Efficient Can Memory Checking Be?. In Theory of Cryptography, Omer Reingold (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 503--520."},{"key":"e_1_3_2_1_19_1","unstructured":"Ethereum. 2023 a. Etherscan. https:\/\/etherscan.io\/."},{"key":"e_1_3_2_1_20_1","unstructured":"Ethereum. 2023 b. go-ethereum. https:\/\/github.com\/ethereum\/go-ethereum."},{"key":"e_1_3_2_1_21_1","first-page":"2023","article-title":"a. Optimistic Rollups. https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/optimistic-rollups","year":"2023","unstructured":"Ethereum. 2023 a. Optimistic Rollups. https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/optimistic-rollups. Accessed: 2023-05.","journal-title":"Accessed"},{"key":"e_1_3_2_1_22_1","first-page":"2023","article-title":"b. Zero-Knowledge Rollups. https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/zk-rollups\/","year":"2023","unstructured":"Ethereum. 2023 b. Zero-Knowledge Rollups. https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/zk-rollups\/. Accessed: 2023-05.","journal-title":"Accessed"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Zhenhuan Gao Yuxuan Hu and Qinfan Wu. 2021. Jellyfish Merkle Tree. (2021).","DOI":"10.1155\/2021\/9977744"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387523"},{"key":"e_1_3_2_1_25_1","unstructured":"Google. 2011. LevelDB Benchmarks. http:\/\/www.lmdb.tech\/bench\/microbench\/benchmark.html."},{"key":"e_1_3_2_1_26_1","first-page":"2023","article-title":"LevelDB. https:\/\/github.com\/google\/leveldb","year":"2018","unstructured":"Google. 2018a. LevelDB. https:\/\/github.com\/google\/leveldb. Accessed: 2023-04.","journal-title":"Accessed"},{"key":"e_1_3_2_1_27_1","first-page":"2023","article-title":"LevelDB - Key Layout. https:\/\/github.com\/google\/leveldb\/blob\/main\/doc\/index.md##key-layout","year":"2018","unstructured":"Google. 2018b. LevelDB - Key Layout. https:\/\/github.com\/google\/leveldb\/blob\/main\/doc\/index.md##key-layout. Accessed: 2023-09.","journal-title":"Accessed"},{"key":"e_1_3_2_1_28_1","unstructured":"Google. 2023. Chromium README. https:\/\/chromium.googlesource.com\/chromium\/src\/\/HEAD\/third_party\/leveldatabase\/README.chromium\/."},{"key":"e_1_3_2_1_29_1","volume-title":"Pointproofs: Aggregating Proofs for Multiple Vector Commitments. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Gorbunov Sergey","year":"2020","unstructured":"Sergey Gorbunov, Leonid Reyzin, Hoeteck Wee, and Zhenfei Zhang. 2020. Pointproofs: Aggregating Proofs for Multiple Vector Commitments. In CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9-13, 2020, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM, 2007--2023."},{"key":"e_1_3_2_1_30_1","volume-title":"An Introduction to Combinatorics and Graph Theory","author":"Guichard David","unstructured":"David Guichard. 2017. An Introduction to Combinatorics and Graph Theory. Whitman College."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_32_1","unstructured":"Polygon Labs. 2022. Introducing Plonky2. https:\/\/polygon.technology\/blog\/introducing-plonky2."},{"key":"e_1_3_2_1_33_1","volume-title":"Guang Yang, Ming Wu, Wei Xu, and Fan Long.","author":"Li Chenxing","year":"2023","unstructured":"Chenxing Li, Sidi Mohamed Beillahi, Guang Yang, Ming Wu, Wei Xu, and Fan Long. 2023. LVMT: An Efficient Authenticated Storage for Blockchain. (2023)."},{"key":"e_1_3_2_1_34_1","volume-title":"Universal Accumulators with Efficient Nonmembership Proofs","author":"Li Jiangtao","unstructured":"Jiangtao Li, Ninghui Li, and Rui Xue. 2007. Universal Accumulators with Efficient Nonmembership Proofs. In Applied Cryptography and Network Security, Jonathan Katz and Moti Yung (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 253--269."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/646752.704751"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_37_1","volume-title":"USENIX Annual Technical Conference. 333--347","author":"Ponnapalli Soujanya","year":"2021","unstructured":"Soujanya Ponnapalli, Aashaka Shah, Souvik Banerjee, Dahlia Malkhi, Amy Tai, Vijay Chidambaram, and Michael Wei. 2021. RainBlock: Faster Transaction Processing in Public Blockchains.. In USENIX Annual Technical Conference. 333--347."},{"key":"e_1_3_2_1_38_1","unstructured":"Pandian Raju Soujanya Ponnapalli Evan Kaminsky Gilad Oved Zachary Keener Vijay Chidambaram and Ittai Abraham. 2018. mLSM: Making Authenticated Storage Faster in Ethereum.. In HotStorage."},{"key":"e_1_3_2_1_39_1","volume-title":"CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III. Springer, 704--737","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty. 2020. Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In Advances in Cryptology-CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III. Springer, 704--737."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"e_1_3_2_1_41_1","unstructured":"Meta Open Source. 2023. RocksDB. https:\/\/rocksdb.org\/."},{"key":"e_1_3_2_1_42_1","volume-title":"Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments. In 31st USENIX Security Symposium (USENIX Security 22)","author":"Srinivasan Shravan","year":"2022","unstructured":"Shravan Srinivasan, Alexander Chepurnoy, Charalampos Papamanthou, Alin Tomescu, and Yupeng Zhang. 2022. Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments. In 31st USENIX Security Symposium (USENIX Security 22). USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/srinivasan"},{"key":"e_1_3_2_1_43_1","volume-title":"How to Keep a Secret and Share a Public Key (Using Polynomial Commitments). Ph.,D. Dissertation","author":"Tomescu Alin","unstructured":"Alin Tomescu. 2020. How to Keep a Secret and Share a Public Key (Using Polynomial Commitments). Ph.,D. Dissertation. Massachusetts Institute of Technology, Cambridge, MA, USA."},{"key":"e_1_3_2_1_44_1","first-page":"2023","article-title":"Binomial theorem - Wikipedia, the free encyclopedia, 2023. https:\/\/en.wikipedia.org\/wiki\/Binomial_theorem","author":"Wikipedia","year":"2023","unstructured":"Wikipedia contributors. 2023. Binomial theorem - Wikipedia, the free encyclopedia, 2023. https:\/\/en.wikipedia.org\/wiki\/Binomial_theorem. Accessed: 2023-07.","journal-title":"Accessed"},{"key":"e_1_3_2_1_45_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, Vol. 151, 2014 (2014), 1--32."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623195","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:43:26Z","timestamp":1755740606000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":45,"alternative-id":["10.1145\/3576915.3623195","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623195","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}