{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:40:02Z","timestamp":1749494402102,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031910913"},{"type":"electronic","value":"9783031910920"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91092-0_11","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:58:06Z","timestamp":1745758686000},"page":"301-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Memory Checking with\u00a0Covert Security"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0360-8129","authenticated-orcid":false,"given":"Elette","family":"Boyle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1647-2112","authenticated-orcid":false,"given":"Ilan","family":"Komargodski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0555-4200","authenticated-orcid":false,"given":"Neekon","family":"Vafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: SNARKs for virtual machines via lookups. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. LNCS, vol. 14656, pp. 3\u201333. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_1","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: CCS, pp. 598\u2013609. ACM (2007)","DOI":"10.1145\/1315245.1315318"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M Blum","year":"1994","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12, 225\u2013244 (1994)","journal-title":"Algorithmica"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: CRYPTO, pp. 649\u2013680 (2021)","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00f9, M.: Gemini: elastic SNARKs for diverse environments. In: EUROCRYPT, pp. 427\u2013457 (2022)","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Komargodski, I., Vafa, N.: Memory checking requires logarithmic overhead. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, pp. 1712\u20131723. ACM (2024)","DOI":"10.1145\/3618260.3649686"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: ASIACRYPT, pp. 65\u201397 (2021)","DOI":"10.1007\/978-3-030-92078-4_3"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00145-015-9216-2","volume":"30","author":"D Cash","year":"2017","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious RAM. J. Cryptol. 30(1), 22\u201357 (2017)","journal-title":"J. Cryptol."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Clarke, D.E., Suh, G.E., Gassend, B., Sudan, A., van Dijk, M., Devadas, S.: Towards constant bandwidth overhead integrity checking of untrusted data. In: IEEE S &P, pp. 139\u2013153 (2005)","DOI":"10.1109\/SP.2005.24"},{"key":"11_CR12","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. IACR Cryptol. ePrint Arch, p.\u00a086 (2016)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: CRYPTO, pp. 649\u2013665 (2010)","DOI":"10.1007\/978-3-642-14623-7_35"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: TCC, pp. 503\u2013520 (2009)","DOI":"10.1007\/978-3-642-00457-5_30"},{"key":"11_CR15","unstructured":"Goldreich, O.: On the lower bound on the length of relaxed locally decodable codes. Electron. Colloquium Comput. Complex. TR23-064 (2023)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"V Goyal","year":"2008","unstructured":"Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 289\u2013306. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_17"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Hall, W.E., Jutla, C.S.: Parallelizable authentication trees. In: Selected Areas in Cryptography, pp. 95\u2013109 (2005)","DOI":"10.1007\/11693383_7"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. J. Cryptol. 23(3), 422\u2013456 (2010). https:\/\/doi.org\/10.1007\/S00145-008-9034-X","DOI":"10.1007\/S00145-008-9034-X"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Juels, A., Jr., B.S.K.: PORs: proofs of retrievability for large files. In: CCS, pp. 584\u2013597. ACM (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Mathialagan, S.: Memory checking for parallel RAMs. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. TCC 2023. LNCS, vol. 14370, pp. 436\u2013464. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_15","DOI":"10.1007\/978-3-031-48618-0_15"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A certified digital signature. In: Advances in Cryptology - CRYPTO, pp. 218\u2013238 (1989)","DOI":"10.1007\/0-387-34805-0_21"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462155","volume":"56","author":"M Naor","year":"2009","unstructured":"Naor, M., Rothblum, G.N.: The complexity of online memory checking. J. ACM 56(1), 1\u201346 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211\u2013219 (1993)","journal-title":"SIAM J. Comput."},{"key":"11_CR24","unstructured":"Oprea, A., Reiter, M.K.: Integrity checking in cryptographic file systems with constant trusted storage. In: USENIX (2007)"},{"key":"11_CR25","unstructured":"Ozdemir, A., Wahby, R.S., Whitehat, B., Boneh, D.: Scaling verifiable computation using efficient set accumulators. In: USENIX, pp. 2075\u20132092 (2020)"},{"key":"11_CR26","unstructured":"Papamanthou, C., Tamassia, R.: Optimal and parallel online memory checking. Cryptology ePrint Archive (2011)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Setty, S.T.V.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: CRYPTO, pp. 704\u2013737 (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"11_CR28","unstructured":"Setty, S.T.V., Thaler, J.: Twist and shout: faster memory checking arguments via one-hot addressing and increments. IACR Cryptol. ePrint Arch, p.\u00a0105 (2025). https:\/\/eprint.iacr.org\/2025\/105"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. LNCS, vol. 14656, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"issue":"3","key":"11_CR30","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00145-012-9129-2","volume":"26","author":"H Shacham","year":"2013","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2013)","journal-title":"J. Cryptol."},{"key":"11_CR31","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: aggregating and maintaining proofs in vector commitments. In: USENIX Security Symposium, pp. 3001\u20133018 (2022)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: IEEE S &P, pp. 926\u2013943 (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Wang, W., Lu, Y., Papamanthou, C., Zhang, F.: The locality of memory checking. In: ACM CCS, pp. 1820\u20131834 (2023)","DOI":"10.1145\/3576915.3623195"},{"key":"11_CR34","unstructured":"Wang, W., Ulichney, A., Papamanthou, C.: BalanceProofs: maintainable vector commitments with fast aggregation. In: USENIX Security Symposium, pp. 4409\u20134426 (2023)"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: CRYPTO, pp. 733\u2013764 (2019)","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: IEEE S &P, pp. 859\u2013876 (2020)","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91092-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:22:53Z","timestamp":1749493373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}