乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:52:08Z","timestamp":1725699128250},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320088"},{"type":"electronic","value":"9783642320095"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32009-5_25","type":"book-chapter","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T06:40:28Z","timestamp":1344235228000},"page":"424-442","source":"Crossref","is-referenced-by-count":15,"title":["Impossibility Results for Static Input Secure Computation"],"prefix":"10.1007","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[]},{"given":"Abishek","family":"Kumarasubramanian","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"25_CR3","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, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509978.509980"},{"key":"25_CR5","unstructured":"Barak, B., Canetti, R., Nielsen, J., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186\u2013195 (2004)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Pass, R., Shelat, A.: Cryptography from sunspots: How to use an imperfect reference string. In: FOCS, pp. 249\u2013259 (2007)","DOI":"10.1109\/FOCS.2007.70"},{"key":"25_CR7","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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New Constructions for UC Secure Computation Using Tamper-Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A unified framework for concurrent security: universal composability from stand-alone non-malleability. In: STOC, pp. 179\u2013188 (2009)","DOI":"10.1145\/1536414.1536441"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-74143-5_18","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J Groth","year":"2007","unstructured":"Groth, J., Ostrovsky, R.: Cryptography in the Multi-string Model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 323\u2013341. Springer, Heidelberg (2007)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-78524-8_9","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2008","unstructured":"Goyal, V., Katz, J.: Universally Composable Multi-party Computation with an Unreliable Common Reference String. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 142\u2013154. Springer, Heidelberg (2008)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-19571-6_19","volume-title":"Theory of Cryptography","author":"S Garg","year":"2011","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Bringing People of Different Beliefs Together to Do UC. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 311\u2013328. Springer, Heidelberg (2011)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: FOCS, pp. 367\u2013378 (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"25_CR14","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":"25_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"EUROCRYPT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"25_CR17","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: FOCS, pp. 543\u2013552. IEEE Computer Society (2005)"},{"key":"25_CR18","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, pp. 541\u2013550 (2010)","DOI":"10.1109\/FOCS.2010.86"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"25_CR20","unstructured":"Goyal, V.: Positive results for concurrently secure computation in the plain model. Cryptology ePrint Archive, Report 2011\/602 (2011), http:\/\/eprint.iacr.org\/"},{"key":"25_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":"25_CR22","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds (2003)","DOI":"10.1145\/1007352.1007393"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2004","unstructured":"Lindell, Y.: Lower Bounds for Concurrent Self Composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Lower bounds and impossibility results for concurrent self composition. J. Cryptology 21(2), 200\u2013249 (2008)","DOI":"10.1007\/s00145-007-9015-5"},{"key":"25_CR25","unstructured":"Garay, J.A., MacKenzie, P.D.: Concurrent oblivious transfer. In: FOCS, pp. 314\u2013324 (2000)"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptology 19(2), 135\u2013167 (2006)","DOI":"10.1007\/s00145-005-0419-9"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: FOCS, pp. 345\u2013354 (2006)","DOI":"10.1109\/FOCS.2006.21"},{"key":"25_CR28","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":"25_CR29","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, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"25_CR31","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366\u2013375 (2002)"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Simon, J. (ed.) STOC, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC 2000, pp. 316\u2013324. ACM, New York (2000)","DOI":"10.1145\/335305.335342"},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The All-or-Nothing Nature of Two-Party Secure Computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-32009-5_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Agrawal","year":"2012","unstructured":"Agrawal, S., Goyal, V., Jain, A., Prabhakaran, M., Sahai, A.: New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 443\u2013460. Springer, Heidelberg (2012)"},{"key":"25_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-01001-9_3","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"V Goyal","year":"2009","unstructured":"Goyal, V., Sahai, A.: Resettably Secure Computation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 54\u201371. Springer, Heidelberg (2009)"},{"key":"25_CR37","doi-asserted-by":"crossref","unstructured":"Goyal, V., Maji, H.K.: Stateless cryptographic protocols. In: FOCS (2011), http:\/\/research.microsoft.com\/en-us\/people\/vipul\/gm11.pdf","DOI":"10.1109\/FOCS.2011.74"},{"key":"25_CR38","unstructured":"Goyal, V., Maji, H.K.: Personal communication (2012)"},{"key":"25_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-Time Programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 39\u201356. Springer, Heidelberg (2008)"},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory 42(6), 1769\u20131780 (1996)","DOI":"10.1109\/18.556673"},{"key":"25_CR41","series-title":"LNCS","first-page":"17","volume-title":"DISC 2002","author":"S Goldwasser","year":"2002","unstructured":"Goldwasser, S., Lindell, Y.: Secure Computation Without Agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"25_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0028162","volume-title":"Security Protocols 1997","author":"J Kelsey","year":"1998","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Protocol Interactions and the Chosen Protocol Attack. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 91\u2013104. Springer, Heidelberg (1998)"},{"key":"25_CR43","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: FOCS, pp. 394\u2013403. IEEE Computer Society (2003)"},{"key":"25_CR44","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC, pp. 553\u2013560. ACM (1991)","DOI":"10.1145\/103418.103475"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32009-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T19:08:29Z","timestamp":1643137709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32009-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320088","9783642320095"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32009-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}