{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T04:12:16Z","timestamp":1793938336596,"version":"4.8.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"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-30545-0_16","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T10:02:10Z","timestamp":1681552930000},"page":"456-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["NanoGRAM: Garbled RAM with\u00a0$$\\widetilde{O}(\\log N)$$ Overhead"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6012-7124","authenticated-orcid":false,"given":"Wei-Kai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Applebaum, B.: Garbling xor gates \"for free\" in the standard model. In: TCC (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_10","DOI":"10.1007\/978-3-642-36594-2_10"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Asharov, G., Komargodski, I., Lin, W.K., Nayak, K., Peserico, E., Shi, E.: OptORAMa: Optimal Oblivious RAM. In: Eurocrypt (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_14","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: American Federation of Information Processing Societies: AFIPS Conference Proceedings (1968). https:\/\/doi.org\/10.1145\/1468075.1468121","DOI":"10.1145\/1468075.1468121"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Raykova, M.: Adaptive succinct garbled RAM or: How to delegate your database. In: TCC (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_3","DOI":"10.1007\/978-3-662-53644-5_3"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Canetti, R., Holmgren, J.: Fully succinct garbled RAM. In: ITCS, pp. 169\u2013178. ACM (2016). https:\/\/doi.org\/10.1145\/2840728.2840765","DOI":"10.1145\/2840728.2840765"},{"key":"16_CR6","doi-asserted-by":"publisher","unstructured":"Chan, T.H., Nayak, K., Shi, E.: Perfectly secure oblivious parallel RAM. In: TCC (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_23","DOI":"10.1007\/978-3-030-03810-6_23"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Chan, T.H., Shi, E.: Circuit OPRAM: unifying statistically and computationally secure orams and oprams. In: TCC (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_3","DOI":"10.1007\/978-3-319-70503-3_3"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Chan, T.H., Shi, E., Lin, W., Nayak, K.: Perfectly oblivious (parallel) RAM revisited, and improved constructions. In: ITC (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.8","DOI":"10.4230\/LIPIcs.ITC.2021.8"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y., Chow, S.S.M., Chung, K., Lai, R.W.F., Lin, W., Zhou, H.: Cryptography for parallel RAM from indistinguishability obfuscation. In: ITCS. pp. 179\u2013190. ACM (2016). https:\/\/doi.org\/10.1145\/2840728.2840769","DOI":"10.1145\/2840728.2840769"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.S.: On the security of the \"free-xor\" technique. In: TCC (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_3","DOI":"10.1007\/978-3-642-28914-9_3"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: TCC, pp. 144\u2013163 (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10","DOI":"10.1007\/978-3-642-19571-6_10"},{"key":"16_CR12","unstructured":"Fincher, D.: The curious case of benjamin button, film (2008)"},{"key":"16_CR13","unstructured":"Fletcher, C., Naveed, M., Ren, L., Shi, E., Stefanov, E.: Bucket ORAM: Single online roundtrip, constant bandwidth Oblivious RAM. Cryptology ePrint Archive, Report 2015\/1065 (2015)"},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.22","author":"S Garg","year":"2015","unstructured":"Garg, S., Lu, S., Ostrovsky, R.: Black-box garbled RAM. In: FOCS (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.22","journal-title":"Black-box garbled RAM. In: FOCS"},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746593","author":"S Garg","year":"2015","unstructured":"Garg, S., Lu, S., Ostrovsky, R., Scafuro, A.: Garbled ram from one-way functions. STOC (2015). https:\/\/doi.org\/10.1145\/2746539.2746593","journal-title":"Garbled ram from one-way functions. STOC"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Gentry, C., Goldman, K.A., Halevi, S., Jutla, C.S., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: PETS (2013). https:\/\/doi.org\/10.1007\/978-3-642-39077-7_1","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Lu, S., Ostrovsky, R., Raykova, M., Wichs, D.: Garbled ram revisited. In: EUROCRYPT (2014)","DOI":"10.1007\/978-3-642-55220-5_23"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: STOC (1987). https:\/\/doi.org\/10.1145\/28395.28416","DOI":"10.1145\/28395.28416"},{"key":"16_CR19","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (1996). https:\/\/doi.org\/10.1145\/233551.233553","journal-title":"J. ACM"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lilintal, M.: Gradual gram and secure computation for ram programs. In: Security and Cryptography for Networks (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_12","DOI":"10.1007\/978-3-030-57990-6_12"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-030-56880-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Heath","year":"2020","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 763\u2013792. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_27"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: Logstack: Stacked garbling with O(b log b) computation. In: EUROCRYPT (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_1","DOI":"10.1007\/978-3-030-77883-5_1"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: One hot garbling. In: CCS (2021). https:\/\/doi.org\/10.1145\/3460120.3484764","DOI":"10.1145\/3460120.3484764"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: Epigram: Practical garbled ram. In: EUROCRYPT (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_1","DOI":"10.1007\/978-3-031-06944-4_1"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"V Kolesnikov","year":"2014","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: FleXOR: flexible garbling for xor gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25"},{"key":"16_CR26","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved Garbled Circuit: Free XOR Gates and Applications. In: ICALP (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"16_CR27","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":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-38348-9_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: How to Garble RAM programs? In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 719\u2013734. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_42"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Lu, S., Ostrovsky, R.: Black-box parallel garbled RAM. In: CRYPTO (2017)","DOI":"10.1007\/978-3-319-63715-0_3"},{"key":"16_CR30","unstructured":"Park, A., Lin, W.K., Shi, E.: NanoGRAM: Garbled RAM with $$\\widetilde{O}(\\log N)$$ overhead. Cryptology ePrint Archive, Paper 2022\/191 (2022). https:\/\/eprint.iacr.org\/2022\/191"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: Panorama: Oblivious ram with logarithmic overhead. In: FOCS (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00087","DOI":"10.1109\/FOCS.2018.00087"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"16_CR33","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":"16_CR34","doi-asserted-by":"publisher","unstructured":"Stefanov, E., et al.: Path ORAM - an extremely simple oblivious ram protocol. In: CCS (2013). https:\/\/doi.org\/10.1145\/2508859.2516660","DOI":"10.1145\/2508859.2516660"},{"key":"16_CR35","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. In: Network and Distributed System Security Symposium (NDSS) (2012)"},{"key":"16_CR36","doi-asserted-by":"publisher","unstructured":"Waksman, A.: A permutation network. J. ACM 15(1), 159\u2013163 (jan 1968). https:\/\/doi.org\/10.1145\/321439.321449","DOI":"10.1145\/321439.321449"},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Wang, X.S., Chan, T.H.H., Shi, E.: Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. In: CCS (2015). https:\/\/doi.org\/10.1145\/2810103.2813634","DOI":"10.1145\/2810103.2813634"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Wang, X.S., et al.: Oblivious Data Structures. In: CCS (2014). https:\/\/doi.org\/10.1145\/2660267.2660314","DOI":"10.1145\/2660267.2660314"},{"key":"16_CR39","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: FOCS (1982). https:\/\/doi.org\/10.5555\/1382436.1382751","DOI":"10.5555\/1382436.1382751"},{"key":"16_CR40","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Zahur, S., Evans, D.: Circuit Structures for Improving Efficiency of Security and Privacy Tools. In: IEEE S & P (2013). https:\/\/doi.org\/10.1109\/SP.2013.40","DOI":"10.1109\/SP.2013.40"},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:04:22Z","timestamp":1744754662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","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":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"16","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)"}}]}}