{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:16:38Z","timestamp":1649006198428},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p>In this paper we study (interpret) the precise composability guarantee of the generalised universal composability (GUC) feasibility with global setups that was proposed in the recent paper Canetti <jats:italic>et al<\/jats:italic>. (2007) from the point of view of full universal composability (FUC), that is, composability with arbitrary protocols, which was the original security goal and motivation for UC. By observing a counter-intuitive phenomenon, we note that the GUC feasibility implicitly assumes that the adversary has <jats:italic>limited<\/jats:italic> access to arbitrary external protocols. We then clarify a general principle for achieving FUC security, and propose some approaches for fixing the GUC feasibility under the general principle. Finally, we discuss the relationship between GUC and FUC from both technical and philosophical points of view. This should be helpful in gaining a precise understanding of the GUC feasibility, and for preventing potential misinterpretations and\/or misuses in practice.<\/jats:p>","DOI":"10.1017\/s0960129508007330","type":"journal-article","created":{"date-parts":[[2009,2,20]],"date-time":"2009-02-20T15:49:19Z","timestamp":1235144959000},"page":"193-205","source":"Crossref","is-referenced-by-count":3,"title":["A note on the feasibility of generalised universal composability"],"prefix":"10.1017","volume":"19","author":[{"given":"ANDREW C. C.","family":"YAO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCES F.","family":"YAO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YUNLEI","family":"ZHAO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2009,2,1]]},"reference":[{"key":"S0960129508007330_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_5"},{"key":"S0960129508007330_ref6","doi-asserted-by":"crossref","unstructured":"Canetti R. (2001) Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: IEEE Symposium on Foundations of Computer Science 136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"S0960129508007330_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"S0960129508007330_ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"S0960129508007330_ref5","article-title":"On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge","volume":"13","author":"Bellare","year":"2006","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"S0960129508007330_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72504-6_42"},{"key":"S0960129508007330_ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"S0960129508007330_ref2","unstructured":"Blum M. (1982) Coin Flipping by Telephone. In: Proc. IEEE Spring COMPCOM 133\u2013137."},{"key":"S0960129508007330_ref1","unstructured":"Atenise G. and De Medeiros B. (2003) Identity-Based Chameleon Hash and Applications. Cryptology ePrint Archive, Report No. 2003\/167."},{"key":"S0960129508007330_ref3","unstructured":"Blum M. (1986) How to Prove a Theorem so No One Else can Claim It. In: Proceedings of the International Congress of Mathematicians, Berkeley, California 1444\u20131451."},{"key":"S0960129508007330_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"S0960129508007330_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_28"},{"key":"S0960129508007330_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_2"},{"key":"S0960129508007330_ref12","doi-asserted-by":"crossref","unstructured":"Canetti R. , Lindell Y. , Ostrovsky R. and Sahai A. (2002) Universally Composable Two-Party and Multi-Party Secure Computation. In: ACM Symposium on Theory of Computing 494\u2013503.","DOI":"10.1145\/509907.509980"},{"key":"S0960129508007330_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"S0960129508007330_ref14","doi-asserted-by":"crossref","unstructured":"Garay J. A. , MacKenzie P. and Yang K. (2003) Strengthening Zero-Knowledge Protocols Using Signatures. Journal of Cryptology (to appear). (A preliminary version appears in Biham E. (ed.) Advances in Cryptology \u2013 Proceedings of EUROCRYPT 2003. Springer-Verlag Lecture Notes in Computer Science 2656 177\u2013194.)","DOI":"10.1007\/3-540-39200-9_11"},{"key":"S0960129508007330_ref16","doi-asserted-by":"crossref","unstructured":"Goldreich O. , Micali S. and Wigderson A. (1986a) Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design. In: IEEE Symposium on Foundations of Computer Science 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"S0960129508007330_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_8"},{"key":"S0960129508007330_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"S0960129508007330_ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"S0960129508007330_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_12"},{"key":"S0960129508007330_ref9","unstructured":"Canetti R. , Dodis Y. , Walfish S and Zhao Y. (2007) Personal communications."},{"key":"S0960129508007330_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_19"},{"key":"S0960129508007330_ref7","article-title":"Security and Composition of Cryptographic Protocols: A Tutorial","volume":"37","author":"Canetti","year":"2006","journal-title":"Distributed Computing column of SIGACT News"},{"key":"S0960129508007330_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_4"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129508007330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T16:20:55Z","timestamp":1554308455000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129508007330\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["S0960129508007330"],"URL":"https:\/\/doi.org\/10.1017\/s0960129508007330","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}