{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:07:41Z","timestamp":1764133661572,"version":"3.41.2"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031385506"},{"type":"electronic","value":"9783031385513"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38551-3_4","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"95-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MacORAMa: Optimal Oblivious RAM with\u00a0Integrity"],"prefix":"10.1007","author":[{"given":"Surya","family":"Mathialagan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neekon","family":"Vafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-662-54365-8_5","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"I Abraham","year":"2017","unstructured":"Abraham, I., Fletcher, C.W., Nayak, K., Pinkas, B., Ren, L.: Asymptotically tight bounds for composing ORAM with PIR. In: Fehr, S. (ed.) PKC 2017, Part I. LNCS, vol. 10174, pp. 91\u2013120. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_5"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$O(n \\log n)$$ sorting network. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-54631-0_8","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"D Apon","year":"2014","unstructured":"Apon, D., Katz, J., Shi, E., Thiruvengadam, A.: Verifiable oblivious storage. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 131\u2013148. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_8"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Arasu, A., et al.: Concerto: a high concurrency key-value store with integrity. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 251\u2013266 (2017)","DOI":"10.1145\/3035918.3064030"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., Shi, E.: OptORAMa: optimal oblivious RAM. J. ACM 70(1) (2022). https:\/\/doi.org\/10.1145\/3566049","DOI":"10.1145\/3566049"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Asharov, G., Komargodski, I., Lin, W.K., Shi, E.: Oblivious RAM with worst-case logarithmic overhead. J. Cryptol. 36(2), 7 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09447-5","DOI":"10.1007\/s00145-023-09447-5"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 598\u2013609. ACM Press, October 2007. https:\/\/doi.org\/10.1145\/1315245.1315318","DOI":"10.1145\/1315245.1315318"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference. AFIPS 1968 (Spring), New York, NY, USA, pp. 307\u2013314. Association for Computing Machinery (1968). https:\/\/doi.org\/10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Bindschaedler, V., Naveed, M., Pan, X., Wang, X., Huang, Y.: Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 837\u2013849. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813649","DOI":"10.1145\/2810103.2813649"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-319-61204-1_34","volume-title":"Applied Cryptography and Network Security","author":"E-O Blass","year":"2017","unstructured":"Blass, E.-O., Mayberry, T., Noubir, G.: Multi-client oblivious RAM secure against malicious servers. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 686\u2013707. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_34"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: 32nd FOCS, pp. 90\u201399. IEEE Computer Society Press, October 1991. https:\/\/doi.org\/10.1109\/SFCS.1991.185352","DOI":"10.1109\/SFCS.1991.185352"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 668\u2013679. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813700","DOI":"10.1145\/2810103.2813700"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-70694-8_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T-HH Chan","year":"2017","unstructured":"Chan, T.-H.H., Chung, K.-M., Shi, E.: On the depth of oblivious parallel RAM. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 567\u2013597. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_20"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-319-70694-8_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T-HH Chan","year":"2017","unstructured":"Chan, T.-H.H., Guo, Y., Lin, W.-K., Shi, E.: Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 660\u2013690. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_23"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-030-03810-6_23","volume-title":"Theory of Cryptography","author":"T-HH Chan","year":"2018","unstructured":"Chan, T.-H.H., Nayak, K., Shi, E.: Perfectly secure oblivious parallel RAM. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 636\u2013668. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_23"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-030-64834-3_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"SSM Chow","year":"2020","unstructured":"Chow, S.S.M., Fech, K., Lai, R.W.F., Malavolta, G.: Multi-client oblivious RAM with poly-logarithmic communication. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 160\u2013190. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_6"},{"key":"4_CR17","doi-asserted-by":"publisher","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: 2005 IEEE Symposium on Security and Privacy, pp. 139\u2013153. IEEE Computer Society Press, May 2005. https:\/\/doi.org\/10.1109\/SP.2005.24","DOI":"10.1109\/SP.2005.24"},{"key":"4_CR18","unstructured":"Connell, G.: Technology deep dive: building a faster ORAM layer for enclaves (2022). https:\/\/signal.org\/blog\/building-faster-oram\/"},{"key":"4_CR19","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive, Report 2016\/086 (2016). https:\/\/eprint.iacr.org\/2016\/086"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Dauterman, E., Fang, V., Demertzis, I., Crooks, N., Popa, R.A.: Snoopy: Surpassing the scalability bottleneck of oblivious storage. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 655\u2013671 (2021)","DOI":"10.1145\/3477132.3483562"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49099-0_6","volume-title":"Theory of Cryptography","author":"S Devadas","year":"2016","unstructured":"Devadas, S., van Dijk, M., Fletcher, C.W., Ren, L., Shi, E., Wichs, D.: Onion ORAM: a constant bandwidth blowup oblivious RAM. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 145\u2013174. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_6"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-642-00457-5_30","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2009","unstructured":"Dwork, C., Naor, M., Rothblum, G.N., Vaikuntanathan, V.: How efficient can memory checking be? In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 503\u2013520. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_30"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Dijk, M.v., Devadas, S.: A secure processor architecture for encrypted computation on untrusted programs. In: Proceedings of the seventh ACM Workshop on Scalable Trusted Computing, pp. 3\u20138 (2012)","DOI":"10.1145\/2382536.2382540"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Fletcher, C.W., Ren, L., Kwon, A., van Dijk, M., Devadas, S.: Freecursive oram: [nearly] free recursion and integrity verification for position-based oblivious ram. In: Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems. ASPLOS 2015, New York, NY, USA, pp. 103\u2013116. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2694344.2694353, https:\/\/doi.org\/10.1145\/2694344.2694353","DOI":"10.1145\/2694344.2694353"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-27576-0_11","volume-title":"Financial Cryptography and Data Security","author":"M Franz","year":"2012","unstructured":"Franz, M., et al.: Oblivious outsourced storage with delegation. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 127\u2013140. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27576-0_11"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-28166-7_9","volume-title":"Applied Cryptography and Network Security","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Halevi, S., Jutla, C., Raykova, M.: Private database access with HE-over-ORAM architecture. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 172\u2013191. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_9"},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 576\u2013587. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_46"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX 2001, vol. 2, pp. 68\u201382. IEEE (2001)","DOI":"10.1109\/DISCEX.2001.932160"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11693383_7","volume-title":"Selected Areas in Cryptography","author":"WE Hall","year":"2006","unstructured":"Hall, W.E., Jutla, C.S.: Parallelizable authentication trees. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 95\u2013109. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_7"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Hoang, T., Guajardo, J., Yavuz, A.A.: MACAO: a maliciously-secure and client-efficient active ORAM framework. In: NDSS 2020. The Internet Society, February 2020","DOI":"10.14722\/ndss.2020.24313"},{"key":"4_CR33","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS 2012. The Internet Society, February 2020"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Juels, A., Kaliski Jr., B.S.: PORS: proofs of retrievability for large files. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 584\u2013597. ACM Press, October 2007. https:\/\/doi.org\/10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"4_CR35","unstructured":"Katz, J., Koo, C.Y.: On constructing universal one-way hash functions from arbitrary one-way functions. Cryptology ePrint Archive, Report 2005\/328 (2005). https:\/\/eprint.iacr.org\/2005\/328"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press, May 1992. https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-030-84259-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Komargodski","year":"2021","unstructured":"Komargodski, I., Lin, W.-K.: A logarithmic lower bound for oblivious RAM (for All Parameters). In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 579\u2013609. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_20"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in)security of hash-based oblivious RAM and a new balancing scheme. In: Rabani, Y. (ed.) 23rd SODA, pp. 143\u2013156. ACM-SIAM, January 2012","DOI":"10.1137\/1.9781611973099.13"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-96881-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"KG Larsen","year":"2018","unstructured":"Larsen, K.G., Nielsen, J.B.: Yes, there is an oblivious RAM lower bound! In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: ObliVM: a programming framework for secure computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 359\u2013376. IEEE Computer Society Press, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.29","DOI":"10.1109\/SP.2015.29"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-36594-2_22","volume-title":"Theory of Cryptography","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: Distributed oblivious RAM for secure two-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 377\u2013396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_22"},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"Maffei, M., Malavolta, G., Reinert, M., Schr\u00f6der, D.: Privacy and access control for outsourced personal records. In: 2015 IEEE Symposium on Security and Privacy, pp. 341\u2013358. IEEE Computer Society Press, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.28","DOI":"10.1109\/SP.2015.28"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-319-61204-1_32","volume-title":"Applied Cryptography and Network Security","author":"M Maffei","year":"2017","unstructured":"Maffei, M., Malavolta, G., Reinert, M., Schr\u00f6der, D.: Maliciously secure multi-client ORAM. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 645\u2013664. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_32"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Mathialagan, S., Vafa, N.: MacORAMa: Optimal Oblivious RAM with Integrity. Cryptology ePrint Archive, Paper 2023\/083 (2023). https:\/\/eprint.iacr.org\/2023\/083","DOI":"10.1007\/978-3-031-38551-3_4"},{"key":"4_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"4_CR46","doi-asserted-by":"publisher","unstructured":"Mishra, P., Poddar, R., Chen, J., Chiesa, A., Popa, R.A.: Oblix: an efficient oblivious search index. In: 2018 IEEE Symposium on Security and Privacy, pp. 279\u2013296. IEEE Computer Society Press, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00045","DOI":"10.1109\/SP.2018.00045"},{"issue":"1","key":"4_CR47","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 (JACM) 56(1), 1\u201346 (2009)","journal-title":"J. ACM (JACM)"},{"key":"4_CR48","unstructured":"Nissim, K., Naor, M.: Certificate revocation and certificate update. In: Rubin, A.D. (ed.) USENIX Security 98. USENIX Association, January 1998"},{"key":"4_CR49","unstructured":"Oprea, A., Reiter, M.K.: Integrity checking in cryptographic file systems with constant trusted storage. In: Provos, N. (ed.) USENIX Security 2007. USENIX Association, August 2007"},{"key":"4_CR50","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: 29th ACM STOC, pp. 294\u2013303. ACM Press, May 1997. https:\/\/doi.org\/10.1145\/258533.258606","DOI":"10.1145\/258533.258606"},{"issue":"2","key":"4_CR51","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"4_CR52","unstructured":"Papamanthou, C., Tamassia, R.: Optimal and parallel online memory checking. Cryptology ePrint Archive, Report 2011\/102 (2011). https:\/\/eprint.iacr.org\/2011\/102"},{"key":"4_CR53","doi-asserted-by":"publisher","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: PanORAMa: oblivious RAM with logarithmic overhead. In: Thorup, M. (ed.) 59th FOCS, pp. 871\u2013882. IEEE Computer Society Press, October 2018. https:\/\/doi.org\/10.1109\/FOCS.2018.00087","DOI":"10.1109\/FOCS.2018.00087"},{"key":"4_CR54","doi-asserted-by":"publisher","unstructured":"Ren, L., Fletcher, C.W., Yu, X., van Dijk, M., Devadas, S.: Integrity verification for path oblivious-ram. In: 2013 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20136 (2013). https:\/\/doi.org\/10.1109\/HPEC.2013.6670339","DOI":"10.1109\/HPEC.2013.6670339"},{"key":"4_CR55","doi-asserted-by":"publisher","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: 22nd ACM STOC, pp. 387\u2013394. ACM Press, May 1990. https:\/\/doi.org\/10.1145\/100216.100269","DOI":"10.1145\/100216.100269"},{"issue":"3","key":"4_CR56","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00145-012-9129-2","volume":"26","author":"H Shacham","year":"2012","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2012). https:\/\/doi.org\/10.1007\/s00145-012-9129-2","journal-title":"J. Cryptol."},{"key":"4_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_11"},{"key":"4_CR58","doi-asserted-by":"publisher","unstructured":"Stefanov, E., et al.: Path ORAM: an extremely simple oblivious ram protocol. J. ACM 65(4) (2018). https:\/\/doi.org\/10.1145\/3177872","DOI":"10.1145\/3177872"},{"key":"4_CR59","doi-asserted-by":"publisher","unstructured":"Stefanov, E., Shi, E.: Multi-cloud oblivious storage. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 247\u2013258. ACM Press, November 2013. https:\/\/doi.org\/10.1145\/2508859.2516673","DOI":"10.1145\/2508859.2516673"},{"key":"4_CR60","doi-asserted-by":"publisher","unstructured":"Wang, X.S., Huang, Y., Chan, T.H.H., Shelat, A., Shi, E.: SCORAM: oblivious RAM for secure computation. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 191\u2013202. ACM Press, November 2014. https:\/\/doi.org\/10.1145\/2660267.2660365","DOI":"10.1145\/2660267.2660365"},{"key":"4_CR61","doi-asserted-by":"publisher","unstructured":"Zahur, S., Wang, X.S., Raykova, M., Gasc\u00f3n, A., Doerner, J., Evans, D., Katz, J.: Revisiting square-root ORAM: Efficient random access in multi-party computation. In: 2016 IEEE Symposium on Security and Privacy, pp. 218\u2013234. IEEE Computer Society Press, May 2016. https:\/\/doi.org\/10.1109\/SP.2016.21","DOI":"10.1109\/SP.2016.21"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38551-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:44Z","timestamp":1753567424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38551-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385506","9783031385513"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38551-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}