{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:51:27Z","timestamp":1769313087228,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327318","type":"print"},{"value":"9783540327325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_18","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"343-359","source":"Crossref","is-referenced-by-count":23,"title":["Generalized Environmental Security from Number Theoretic Assumptions"],"prefix":"10.1007","author":[{"given":"Tal","family":"Malkin","sequence":"first","affiliation":[]},{"given":"Ryan","family":"Moriarty","sequence":"additional","affiliation":[]},{"given":"Nikolai","family":"Yakovenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 336\u2013354. Springer, Heidelberg (2004)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net \u2013 concurrent composition via super-polynomial simulation. In: Proc. of the 46th Annu. IEEE Symp. on Foundations of Computer Science (to appear, 2005)","DOI":"10.1109\/SFCS.2005.43"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of the 42nd Annu. IEEE Symp. on Foundations of Computer Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_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":"18_CR5","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: Advances in Cryptology \u2013 EUROCRYPT 2003, pp. 68\u201386 (2003)","DOI":"10.1007\/3-540-39200-9_5"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. of the 34th Annu. ACM Symp. on the Theory of Computing, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Groth, J.: Non-interactive and reusable non-malleable commitment schemes. In: Proc. of the 35th Annu. ACM Symp. on the Theory of Computing, pp. 426\u2013437 (2003)","DOI":"10.1145\/780601.780605"},{"key":"18_CR8","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":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0028162","volume-title":"Security Protocols","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.\u00a01361, pp. 91\u2013104. Springer, Heidelberg (1998)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: Proc. of the 44rd Annu. IEEE Symp. on Foundations of Computer Science, pp. 394\u2013403 (2003)","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"18_CR11","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.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Advances in Cryptology \u2013 EUROCRYPT 2003, pp. 160\u2013176 (2003)","DOI":"10.1007\/3-540-39200-9_10"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: Proc. of the 36th Annu. ACM Symp. on the Theory of Computing, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-30576-7_7","volume-title":"Theory of Cryptography","author":"M. Prabhakaran","year":"2005","unstructured":"Prabhakaran, M., Sahai, A.: Relaxing environmental security: Monitored functionalities and client-server computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 104\u2013127. Springer, Heidelberg (2005)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proc. of the 7th Annu. ACM Conference on Computer and Communications Security (CCS 2003), pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:44Z","timestamp":1619507804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11681878_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}