{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:40:23Z","timestamp":1737322823745,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72504-6_43","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"474-485","source":"Crossref","is-referenced-by-count":2,"title":["A Note on the Feasibility of Generalized Universal Composability"],"prefix":"10.1007","author":[{"given":"Andrew C. C.","family":"Yao","sequence":"first","affiliation":[]},{"given":"Frances F.","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Yunlei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Atenise, G., De Medeiros, B.: Identity-Based Chameleon Hash and Applications. Cryptology ePrint Archive, Report No. 2003\/167"},{"key":"43_CR2","unstructured":"Blum, M.: Coin Flipping by Telephone. In: Proc. IEEE Spring COMPCOM, pp. 133\u2013137 (1982)"},{"key":"43_CR3","unstructured":"Blum, M.: How to Prove a Theorem so No One Else can Claim It. In: Proceedings of the International Congress of Mathematicians, Berkeley, California, USA, pp. 1444\u20131451 (1986)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On Defining Proofs of Knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"43_CR5","unstructured":"Bellare, M., Goldreich, O.: On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. Electronic Colloquium on Computational Complexity 13(136) (2006), Available also from Cryptology ePrint Archive, Report No. 2006\/359"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and Composition of Cryptographic Protocols: A Tutorial. Distributed Computing column of SIGACT News 37(3-4) (2006), Available also from Cryptology ePrint Archive, Report 2006\/465","DOI":"10.1145\/1165555.1165570"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., et al.: Universally Composable Security with Global Setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"43_CR9","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.: Universal Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"43_CR10","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 Universal Composition Without Set-Up Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Universally Composable Two-Party and Multi-Party Secure Computation. In: ACM Symposium on Theory of Computing, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal Composition with Joint State. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 265\u2013281. Springer, Heidelberg (2003)"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-39200-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"J.A. Garay","year":"2003","unstructured":"Garay, J.A., MacKenzie, P., Yang, K.: Strengthening Zero-Knowledge Protocols Using Signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 177\u2013194. Springer, Heidelberg (2003)"},{"key":"43_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography-Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundation of Cryptography-Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design. In: IEEE Symposium on Foundations of Computer Science, pp. 174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"43_CR16","series-title":"Lecture Notes in Computer Science","first-page":"104","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Prove all $\\mathcal{NP}$ -Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 104\u2013110. Springer, Heidelberg (1987)"},{"issue":"1","key":"43_CR17","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity or All language in $\\mathcal{NP}$ Have Zero-Knowledge Proof Systems. Journal of the Association for Computing Machinery\u00a038(1), 691\u2013729 (1991), Preliminary version appears in IEEE Symposium on Foundations of Computer Science, pp. 174\u2013187 (1986), and Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 171\u2013185. Springer, Heidelberg (1987)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"43_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"Hastad, J., et al.: Construction of a Pseudorandom Generator from Any One-Way Function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General Composition and Universal Composability in Secure Multi-Party Computation. In: IEEE Symposium on Foundations of Computer Science, pp. 394\u2013403 (2003)","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"43_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit Commitment Using Pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On Deniabililty in the Common Reference String and Random Oracle Models. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"43_CR23","unstructured":"Yao, A.C.C., Yao, F.F., Zhao, Y.: A Note on Universal Composable Zero-Knowledge in the Common Reference String Model. Appears in the same proceedings (2007)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:27:12Z","timestamp":1737322032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_43"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725039","9783540725046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}