{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:37Z","timestamp":1725558817226},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_7","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"104-127","source":"Crossref","is-referenced-by-count":6,"title":["Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation"],"prefix":"10.1007","author":[{"given":"Manoj","family":"Prabhakaran","sequence":"first","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: FOCS 2001, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. In: FOCS 2002, pp. 345\u2013355 (2002)","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR4","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.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally Composable Notions of Key Exchange and Secure Channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"key":"7_CR7","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, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable Cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: STOC 1998, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-36108-1_2","volume-title":"Distributed Computing","author":"S. Goldwasser","year":"2002","unstructured":"Goldwasser, S., Lindell, Y.: Secure Computation without Agreement. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 17\u201332. Springer, Heidelberg (2002)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC 2001, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: STOC 2003, pp. 683\u2013692 (2003)","DOI":"10.1145\/780542.780641"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-57332-1_32","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"T. Okamoto","year":"1993","unstructured":"Okamoto, T.: An Extension of Zero-Knowledge Proofs and Its Applications. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 368\u2013381. Springer, Heidelberg (1993)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 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.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In: STOC 2004, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In: FOCS 2003, pp. 404\u2013413 (2003)","DOI":"10.1109\/SFCS.2003.1238214"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM Conference on Computer and Communications Security 2000, pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero Knowledge with Logarithmic Round-Complexity. In: FOCS 2002, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New Notions of Security: Achieving Universal Composability without Trusted Setup. In: STOC 2004, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable Non-interactive Zero Knowledge and Adaptive Chosen Ciphertext Security. In: FOCS 1999, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:56Z","timestamp":1605759836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}