{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:05:33Z","timestamp":1757624733273,"version":"3.44.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019127"},{"type":"electronic","value":"9783032019134"}],"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-032-01913-4_8","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:50Z","timestamp":1755332570000},"page":"247-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PicoGRAM: Practical Garbled RAM from\u00a0Decisional Diffie-Hellman"],"prefix":"10.1007","author":[{"given":"Tianyao","family":"Gu","sequence":"first","affiliation":[]},{"given":"Afonso","family":"Tinoco","sequence":"additional","affiliation":[]},{"given":"Sri Harish G.","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53644-5_1","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2016","unstructured":"Ananth, P., Chen, Y.-C., Chung, K.-M., Lin, H., Lin, W.-K.: Delegating RAM computations with adaptive soundness and privacy. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 3\u201330. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_1"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-03810-6_17","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Lombardi, A.: Succinct garbling schemes from functional encryption through a local simulation paradigm. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 455\u2013472. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_17"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Asharov, G., Komargodski, I., Lin, W., Nayak, K., Peserico, E., Shi, E.: Optorama: optimal oblivious RAM. J. ACM 70(1), 4:1\u20134:70 (2023). https:\/\/doi.org\/10.1145\/3566049","DOI":"10.1145\/3566049"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00145-023-09447-5","volume":"36","author":"G Asharov","year":"2023","unstructured":"Asharov, G., Komargodski, I., Lin, W., Shi, E.: Oblivious RAM with worst-case logarithmic overhead. J. Cryptol. 36(2), 7 (2023)","journal-title":"J. Cryptol."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC \u201990, pp. 503\u2013513. Association for Computing Machinery, New York (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher, pp. 478\u2013492 (2013). https:\/\/doi.org\/10.1109\/SP.2013.39","DOI":"10.1109\/SP.2013.39"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201915, pp. 439\u2013448. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746574","DOI":"10.1145\/2746539.2746574"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D Boneh","year":"1998","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48\u201363. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054851"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision Diffie-Hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108\u2013125. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_7"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., Naor, M.: Is there an oblivious ram lower bound? In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS \u201916, pp. 357\u2013368. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2840728.2840761","DOI":"10.1145\/2840728.2840761"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-53644-5_3","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Raykova, M.: Adaptive succinct garbled RAM or: how to delegate your database. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 61\u201390. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_3"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R., Holmgren, J.: Fully succinct garbled ram. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS \u201916, pp. 169\u2013178. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2840728.2840765","DOI":"10.1145\/2840728.2840765"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for ram programs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201915, pp. 429\u2013437. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746621","DOI":"10.1145\/2746539.2746621"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Chen, L., Moody, D., Regenscheid, A., Robinson, A., Randall, K.: Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters. Technical Report. NIST Special Publication (SP) 800-186, National Institute of Standards and Technology, Gaithersburg, MD (2023). https:\/\/doi.org\/10.6028\/NIST.SP.800-186","DOI":"10.6028\/NIST.SP.800-186"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Chen, Y.C., Chow, S.S., Chung, K.M., Lai, R.W., Lin, W.K., Zhou, H.S.: Cryptography for parallel ram from indistinguishability obfuscation. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS \u201916, pp. 179\u2013190. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2840728.2840769","DOI":"10.1145\/2840728.2840769"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-28914-9_3","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.-S.: On the security of the \u201cFree-XOR\u2019\u2019 technique. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 39\u201353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_3"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Doerner, J., Shelat, A.: Scaling oram for secure computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201917, pp. 523\u2013535. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3133967","DOI":"10.1145\/3133956.3133967"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 40\u201349 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Garg, S., Lu, S., Ostrovsky, R.: Black-box garbled ram. In: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), FOCS \u201915, pp. 210\u2013229. IEEE Computer Society, USA (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.22","DOI":"10.1109\/FOCS.2015.22"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Garg, S., Lu, S., Ostrovsky, R., Scafuro, A.: Garbled ram from one-way functions. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201915, pp. 449\u2013458. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746593","DOI":"10.1145\/2746539.2746593"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39077-7_1","volume-title":"Privacy Enhancing Technologies","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Goldman, K.A., Halevi, S., Julta, C., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39077-7_1"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-55220-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"C Gentry","year":"2014","unstructured":"Gentry, C., Halevi, S., Lu, S., Ostrovsky, R., Raykova, M., Wichs, D.: Garbled RAM revisited. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 405\u2013422. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_23"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996). https:\/\/doi.org\/10.1145\/233551.233553","DOI":"10.1145\/233551.233553"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Goodrich, M.T.: Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201911, pp. 379\u2013388. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1989493.1989555","DOI":"10.1145\/1989493.1989555"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. In: The ACM Conference on Computer and Communications Security, CCS\u201912, Raleigh, NC, USA, 16\u201318 October 2012, pp. 513\u2013524. ACM (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"8_CR26","unstructured":"Heath, D.: Parallel RAM from cyclic circuits. CoRR arxiv:2309.05133 (2023)"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. In: Advances in Cryptology - EUROCRYPT 2024: 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, 26\u201330 May 2024, Proceedings, Part V, pp. 3\u201331. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_1","DOI":"10.1007\/978-3-031-58740-5_1"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: Epigram: practical garbled ram. In: Advances in Cryptology - EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, 30 May\u20133 June 2022, Proceedings, Part I, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_1","DOI":"10.1007\/978-3-031-06944-4_1"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: Tri-state circuits: a circuit model that captures ram. In: Advances in Cryptology - CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part IV, pp. 128\u2013160. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_5","DOI":"10.1007\/978-3-031-38551-3_5"},{"key":"8_CR30","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure Two-Party computation using garbled circuits. In: 20th USENIX Security Symposium (USENIX Security 11). USENIX Association, San Francisco (2011). https:\/\/www.usenix.org\/conference\/usenix-security-11\/faster-secure-two-party-computation-using-garbled-circuits"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions (2020)","DOI":"10.1145\/3406325.3451093"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Keller, M.: Mp-spdz: A versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201920, pp. 1575\u20131590. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3372297.3417872","DOI":"10.1145\/3372297.3417872"},{"key":"8_CR33","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free xor gates and applications. In: International Colloquium on Automata, Languages and Programming (2008). https:\/\/api.semanticscholar.org\/CorpusID:7746167"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC \u201915, pp. 419\u2013428. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2746539.2746614","DOI":"10.1145\/2746539.2746614"},{"key":"8_CR35","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":"8_CR36","unstructured":"Lin, H., Pass, R.: Succinct garbling schemes and applications. IACR Cryptol. ePrint Arch. 2014, 766 (2014). https:\/\/api.semanticscholar.org\/CorpusID:18349655"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.: Automating efficient ram-model secure computation. In: 2014 IEEE Symposium on Security and Privacy, pp. 623\u2013638 (2014). https:\/\/doi.org\/10.1109\/SP.2014.46","DOI":"10.1109\/SP.2014.46"},{"key":"8_CR38","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 (2015). https:\/\/doi.org\/10.1109\/SP.2015.29","DOI":"10.1109\/SP.2015.29"},{"key":"8_CR39","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":"8_CR40","unstructured":"Lu, S., Ostrovsky, R.: Black-box parallel garbled RAM. Cryptology ePrint Archive, Paper 2015\/1068 (2015). https:\/\/eprint.iacr.org\/2015\/1068"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63715-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Lu","year":"2017","unstructured":"Lu, S., Ostrovsky, R.: Black-box parallel garbled RAM. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 66\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_3"},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, EC \u201999, pp. 129\u2013139. Association for Computing Machinery, New York (1999). https:\/\/doi.org\/10.1145\/336992.337028","DOI":"10.1145\/336992.337028"},{"key":"8_CR43","unstructured":"Ooms, J.: openssl: Toolkit for Encryption, Signatures and Certificates Based on OpenSSL (2024). https:\/\/github.com\/jeroen\/openssl. r package version 2.2.2"},{"key":"8_CR44","doi-asserted-by":"publisher","unstructured":"Park, A., Lin, W.K., Shi, E.: Nanogram: garbled ram with o(logn) overhead. In: Advances in Cryptology - EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, 23\u201327 April 2023, Proceedings, Part I, pp. 456\u2013486. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_16","DOI":"10.1007\/978-3-031-30545-0_16"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Raykova, M., Yeo, K.: Panorama: oblivious RAM with logarithmic overhead. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 871\u2013882. IEEE Computer Society (2018)","DOI":"10.1109\/FOCS.2018.00087"},{"key":"8_CR46","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, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"8_CR47","doi-asserted-by":"publisher","unstructured":"Songhori, E.M., Hussain, S.U., Sadeghi, A.R., Schneider, T., Koushanfar, F.: Tinygarble: highly compressed and scalable sequential garbled circuits. In: 2015 IEEE Symposium on Security and Privacy, pp. 411\u2013428 (2015). https:\/\/doi.org\/10.1109\/SP.2015.32","DOI":"10.1109\/SP.2015.32"},{"key":"8_CR48","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":"8_CR49","doi-asserted-by":"publisher","unstructured":"Wang, X., Chan, H., Shi, E.: Circuit oram: on tightness of the goldreich-ostrovsky lower bound. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS \u201915, pp. 850\u2013861. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2810103.2813634","DOI":"10.1145\/2810103.2813634"},{"key":"8_CR50","unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: efficient multiparty computation toolkit (2016). https:\/\/github.com\/emp-toolkit"},{"key":"8_CR51","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: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201914, pp. 191\u2013202. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2660267.2660365","DOI":"10.1145\/2660267.2660365"},{"key":"8_CR52","doi-asserted-by":"publisher","unstructured":"Yang, Y., Peceny, S., Heath, D., Kolesnikov, V.: Towards generic mpc compilers via variable instruction set architectures (visas). In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201923, pp. 2516\u20132530. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3616664","DOI":"10.1145\/3576915.3616664"},{"key":"8_CR53","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"8_CR54","doi-asserted-by":"publisher","unstructured":"Zahur, S., Evans, D.: Circuit structures for improving efficiency of security and privacy tools. In: Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP \u201913, pp. 493\u2013507. IEEE Computer Society, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.40","DOI":"10.1109\/SP.2013.40"},{"key":"8_CR55","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, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Zahur, S., et al.: Revisiting square-root oram: efficient random access in multi-party computation. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 218\u2013234 (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 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01913-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:56:43Z","timestamp":1757429803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_8","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":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}