{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:02:43Z","timestamp":1742958163024,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662479995"},{"type":"electronic","value":"9783662480007"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48000-7_3","type":"book-chapter","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T22:27:46Z","timestamp":1438295266000},"page":"43-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent Secure Computation with Optimal Query Complexity"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Goyal, V., Jain, A., Prabhakaran, M., Sahai, A.: New impossibility results on concurrently secure computation and a non-interactive completeness theorem for secure computation. In: CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_26"},{"key":"3_CR2","unstructured":"Barak, B., Canetti, R., Nielsen, J., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS (2004)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.21"},{"key":"3_CR4","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition using super-polynomial simulation. In: Proc. \n                      \n                        \n                      \n                      $$46$$\n                      \n                        \n                          \n                            46\n                          \n                        \n                      \n                    th FOCS (2005)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC (2002)","DOI":"10.1145\/509907.509980"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 19. Springer, Heidelberg (2001)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires \n                      \n                        \n                      \n                      $$\\stackrel{\\sim }{\\Omega }(\\log n)$$\n                      \n                        \n                          \n                            \n                              \u03a9\n                              \u223c\n                            \n                            \n                              (\n                              log\n                              n\n                              )\n                            \n                          \n                        \n                      \n                     rounds. In: STOC, pp. 570\u2013579 (2001)","DOI":"10.1145\/380752.380852"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Eurocrypt (2003)","DOI":"10.1007\/3-540-39200-9_5"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.86"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (electronic) (2000), preliminary version in STOC 1991","DOI":"10.1137\/S0097539795291562"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-29011-4_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Garg","year":"2012","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Concurrently secure computation in constant rounds. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 99\u2013116. Springer, Heidelberg (2012)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-32009-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Garg","year":"2012","unstructured":"Garg, S., Kumarasubramanian, A., Ostrovsky, R., Visconti, I.: Impossibility results for static input secure computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 424\u2013442. Springer, Heidelberg (2012)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 Feburary 1996. \n                      http:\/\/epubs.siam.org\/sam-bin\/dbq\/article\/22068\n                      \n                    , preliminary version appeared in ICALP1990","DOI":"10.1137\/S0097539791220688"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-44647-8_24","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O., Lindell, Y.: Session-key generation using human passwords only. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 408. Springer, Heidelberg (2001)"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00145-006-0233-z","volume":"19","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O., Lindell, Y.: Session-key generation using human passwords only. J. Cryptology 19(3), 241\u2013340 (2006)","journal-title":"J. Cryptology"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Positive results for concurrently secure computation in the plain model. In: FOCS (2012)","DOI":"10.1109\/FOCS.2012.13"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-40084-1_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Gupta, D., Jain, A.: What information is leaked under concurrent composition? In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 220\u2013238. Springer, Heidelberg (2013)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-38348-9_40","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Jain, A.: On concurrently secure computation in the multiple ideal query model. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 684\u2013701. Springer, Heidelberg (2013)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-14623-7_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Jain, A., Ostrovsky, R.: Password-authenticated session-key generation on the internet in the plain model. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 277\u2013294. Springer, Heidelberg (2010)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Katz","year":"2007","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115\u2013128. Springer, Heidelberg (2007)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC (2001)","DOI":"10.1145\/380752.380851"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: STOC, pp. 683\u2013692. ACM (2003)","DOI":"10.1145\/780637.780641"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: STOC (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78967-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"O Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Sahai, A., Tseng, W.-L.D., Venkitasubramaniam, M.: Precise concurrent zero knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 397\u2013414. Springer, Heidelberg (2008)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Eurocrypt (2003)","DOI":"10.1007\/3-540-39200-9_10"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00145-012-9137-2","volume":"27","author":"R Pass","year":"2014","unstructured":"Pass, R., Tseng, W.L.D., Venkitasubramaniam, M.: Concurrent zero knowledge, revisited. J. Cryptology 27(1), 45\u201366 (2014)","journal-title":"J. Cryptology"},{"key":"3_CR30","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 415. Springer, Heidelberg (1999)"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- CRYPTO 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48000-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T20:06:45Z","timestamp":1565381205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48000-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662479995","9783662480007"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48000-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}