{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:10:36Z","timestamp":1648991436647},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T00:00:00Z","timestamp":1555977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00145-019-09321-3","type":"journal-article","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:04:19Z","timestamp":1556042659000},"page":"1144-1199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constant-Round Maliciously Secure Two-Party Computation in the RAM Model"],"prefix":"10.1007","volume":"32","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Avishay","family":"Yanai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,23]]},"reference":[{"key":"9321_CR1","unstructured":"A. Afshar, Z. Hu, P. Mohassel, M. Rosulek, How to efficiently evaluate RAM programs with malicious security, in EUROCRYPT (2015), pp. 702\u2013729"},{"key":"9321_CR2","unstructured":"D. Beaver, Foundations of secure interactive computing, in CRYPTO (1991), pp. 377\u2013391"},{"key":"9321_CR3","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols, in STOC (1990), pp. 503\u2013513"},{"key":"9321_CR4","unstructured":"M. Bellare, V.T. Hoang, P. Rogaway, Foundations of garbled circuits, in CCS (2012), pp. 784\u2013796"},{"issue":"4","key":"9321_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s00145-010-9078-6","volume":"24","author":"D Boneh","year":"2011","unstructured":"D. Boneh, X. Boyen, Efficient selective identity-based encryption without random oracles. J. Cryptol.\n                           24(4), 659\u2013693 (2011)","journal-title":"J. Cryptol."},{"issue":"3","key":"9321_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9321_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol.\n                           13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9321_CR8","unstructured":"T.H. Chan E. Shi, Circuit OPRAM: unifying statistically and computationally secure orams and oprams, in TCC (2017), pp. 72\u2013107"},{"key":"9321_CR9","unstructured":"K. Chung, R. Pass, A simple ORAM. IACR Cryptology ePrint Archive (2013), p. 243"},{"key":"9321_CR10","unstructured":"S.A. Cook, R.A. Reckhow, Time-bounded random access machines, in Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1\u20133, 1972, Denver, Colorado, USA (1972), pp. 73\u201380"},{"key":"9321_CR11","unstructured":"I. Damg\u00e5rd, S. Meldgaard, J.B. Nielsen, Perfectly secure oblivious RAM without random oracles, in TCC (2011), pp. 144\u2013163"},{"key":"9321_CR12","unstructured":"J. Doerner, A. Shelat, Scaling ORAM for secure computation, in CCS (2017), pp. 523\u2013535"},{"key":"9321_CR13","unstructured":"S. Garg, D. Gupta, P. Miao, O. Pandey, Secure multiparty RAM computation in constant rounds, in TCC (2016), pp. 491\u2013520"},{"key":"9321_CR14","unstructured":"S. Garg, S. Lu, R. Ostrovsky, Black-box garbled RAM, in FOCS (2015), pp. 210\u2013229"},{"key":"9321_CR15","unstructured":"S. Garg, S. Lu, R. Ostrovsky, A. Scafuro, Garbled RAM from one-way functions, in STOC (2015), pp. 449\u2013458"},{"key":"9321_CR16","unstructured":"C. Gentry, K.A. Goldman, S. Halevi, C.S. Jutla, M. Raykova, D. Wichs, Optimizing ORAM and using it efficiently for secure computation, in PETS (2013), pp. 1\u201318"},{"key":"9321_CR17","unstructured":"C. Gentry, S. Halevi, C.S. Jutla, M. Raykova, Private database access with he-over-oram architecture, in ACNS (2015), pp. 172\u2013191"},{"key":"9321_CR18","unstructured":"C. Gentry, S. Halevi, S. Lu, R. Ostrovsky, M. Raykova, D. Wichs, Garbled RAM revisited, in EUROCRYPT (2014), pp. 405\u2013422"},{"key":"9321_CR19","unstructured":"O. Goldreich, Towards a theory of software protection and simulation by oblivious rams, in STOC (1987), pp. 182\u2013194"},{"key":"9321_CR20","unstructured":"O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications (Cambridge University Press, New York, NY, USA, 2004)"},{"key":"9321_CR21","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in STOC (1987), pp. 218\u2013229"},{"issue":"3","key":"9321_CR22","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"O. Goldreich, R. Ostrovsky, Software protection and simulation on oblivious rams. J. ACM\n                           43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"9321_CR23","unstructured":"M.T. Goodrich, M. Mitzenmacher, O. Ohrimenko, R. Tamassia, Privacy-preserving group data access via stateless oblivious RAM simulation, in SODA (2012), pp. 157\u2013167"},{"key":"9321_CR24","unstructured":"S.D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, Y. Vahlis, Secure two-party computation in sublinear (amortized) time, in CCS (2012) pp. 513\u2013524"},{"key":"9321_CR25","unstructured":"Z. Hu, P. Mohassel, M. Rosulek, Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost, in CRYPTO (2015), pp. 150\u2013169"},{"key":"9321_CR26","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, M. Prabhakaran, A. Sahai, Efficient non-interactive secure computation, in EUROCRYPT (2011), pp. 406\u2013425"},{"key":"9321_CR27","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer - efficiently, in CRYPTO (2008), pp. 572\u2013591,","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9321_CR28","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai. Secure arithmetic computation with no honest majority, in TCC (2009), pp. 294\u2013314"},{"key":"9321_CR29","unstructured":"S. Jarecki, V. Shmatikov, Efficient two-party secure computation on committed inputs, in EUROCRYPT (2007), pp. 97\u2013114"},{"key":"9321_CR30","unstructured":"M. Keller, P. Scholl, Efficient, oblivious data structures for MPC, in ASIACRYPT (2014), pp. 506\u2013525"},{"key":"9321_CR31","unstructured":"E. Kushilevitz, S. Lu, R. Ostrovsky, On the (in)security of hash-based oblivious RAM and a new balancing scheme, in SODA (2012), pp. 143\u2013156"},{"key":"9321_CR32","unstructured":"Y. Lindell, Fast cut-and-choose based protocols for malicious and covert adversaries, in CRYPTO (2) (2013), pp. 1\u201317"},{"key":"9321_CR33","unstructured":"Y. Lindell, B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, in EUROCRYPT (2007), pp. 52\u201378"},{"issue":"2","key":"9321_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Y. Lindell, B. Pinkas, A proof of security of yao\u2019s protocol for two-party computation. J. Cryptol.\n                           22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"9321_CR35","unstructured":"Y. Lindell, B. Pinkas, Secure two-party computation via cut-and-choose oblivious transfer, in TCC (2011), pp. 329\u2013346"},{"key":"9321_CR36","unstructured":"C. Liu, Y. Huang, E. Shi, J. Katz, M.W. Hicks, Automating efficient ram-model secure computation, in IEEE Symposium on Security and Privacy (2014), pp. 623\u2013638"},{"key":"9321_CR37","unstructured":"S. Lu, R. Ostrovsky, How to garble RAM programs, in EUROCRYPT (2013), pp. 719\u2013734"},{"key":"9321_CR38","first-page":"907","volume":"2016","author":"P Miao","year":"2016","unstructured":"P. Miao, Cut-and-choose for garbled RAM. IACR Cryptol. ePrint Arch.\n                           2016, 907 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9321_CR39","unstructured":"S. Micali, P. Rogaway, Secure computation (abstract), in CRYPTO (1991), pp. 392\u2013404"},{"key":"9321_CR40","unstructured":"J.B. Nielsen, C. Orlandi, Lego for two-party secure computation, in TCC (2009), pp. 368\u2013386"},{"key":"9321_CR41","unstructured":"R. Ostrovsky, Efficient computation on oblivious rams, in STOC (1990), pp. 514\u2013523"},{"key":"9321_CR42","unstructured":"B. Pinkas, T. Schneider, N.P. Smart, S.C. Williams, Secure two-party computation is practical, in ASIACRYPT (2009), pp. 250\u2013267"},{"issue":"2","key":"9321_CR43","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N Pippenger","year":"1979","unstructured":"N. Pippenger, M.J. Fischer, Relations among complexity measures. J. ACM\n                           26(2), 361\u2013381 (1979)","journal-title":"J. ACM"},{"key":"9321_CR44","unstructured":"L. Ren, C.W. Fletcher, A. Kwon, E. Stefanov, E. Shi, M. van Dijk, S. Devadas, Constants count: Practical improvements to oblivious RAM, in USENIX (2015), pp. 415\u2013430"},{"key":"9321_CR45","unstructured":"E. Shi, T.H. Chan, E. Stefanov, M. Li, Oblivious RAM with o((logn)3) worst-case cost, in ASIACRYPT (2011), pp. 197\u2013214"},{"key":"9321_CR46","unstructured":"E. Stefanov, M. van Dijk, E. Shi, C.W. Fletcher, L. Ren, X. Yu, S. Devadas, Path ORAM: an extremely simple oblivious RAM protocol, in CCS (2013), pp. 299\u2013310"},{"key":"9321_CR47","unstructured":"X. Wang, T.H. Chan, E. Shi, Circuit ORAM: on tightness of the Goldreich-Ostrovsky lower bound, in CCS (2015), pp. 850\u2013861"},{"key":"9321_CR48","unstructured":"X.S. Wang, Y. Huang, T.H. Chan, A. Shelat, E. Shi, SCORAM: oblivious RAM for secure computation, in CCS (2014), pp. 191\u2013202"},{"key":"9321_CR49","unstructured":"P. Williams, R. Sion, Single round access privacy on outsourced storage, in CCS (2012), pp. 293\u2013304"},{"key":"9321_CR50","unstructured":"A.C. Yao, Protocols for secure computations (extended abstract), in FOCS (1982), pp. 160\u2013164"},{"key":"9321_CR51","unstructured":"A.C. Yao, How to generate and exchange secrets (extended abstract), in FOCS (1986), pp. 162\u2013167"},{"key":"9321_CR52","unstructured":"S. Zahur, X.S. Wang, M. Raykova, A. Gasc\u00f3n, J. Doerner, D. Evans, J. Katz, Revisiting square-root ORAM: efficient random access in multi-party computation, in SP (2016), pp. 218\u2013234"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09321-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09321-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09321-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:04:18Z","timestamp":1587510258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09321-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,23]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09321-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,23]]},"assertion":[{"value":"16 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}