{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:34:56Z","timestamp":1648676096160},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2016,6,8]],"date-time":"2016-06-08T00:00:00Z","timestamp":1465344000000},"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":[[2018,2]]},"abstract":"<jats:p>Yao et al. (A note on the feasibility of generalized universal composability.<jats:italic>Theory and Applications of Models of Computation<\/jats:italic>pp. 474\u2013485, 2007; A note on the feasibility of generalised universal composability.<jats:italic>Mathematical Structures in Computer Science<\/jats:italic>,<jats:bold>19<\/jats:bold>(1), pp. 193\u2013205) claimed a potential limitation on the class of protocols that could be securely implemented in the generalized universal composability (GUC) framework proposed by Canetti et al. (Universally composable security with global setup.<jats:italic>Lecture Notes in Computer Science<\/jats:italic>, pp. 61\u201385, 2007). Specifically, Yao et al. presented a concrete attack on a GUC Zero Knowledge (GUCZK) protocol, a natural adaptation Blum's ZK proof for Directed Hamiltonicity using the general GUC feasibility of Canetti et al. (Universally composable security with global setup.<jats:italic>Lecture Notes in Computer Science<\/jats:italic>, pp. 61\u201385, 2007). Interestingly, the attack was not analysed in the GUC model in Yao et al. (A note on the feasibility of generalised universal composability.<jats:italic>Mathematical Structures in Computer Science<\/jats:italic><jats:bold>19<\/jats:bold>(1), pp. 193\u2013205, 2009) but in the<jats:italic>FUC model<\/jats:italic>, a new UC-like framework proposed in the same work. Nonetheless, Yao et al. (A note on the feasibility of generalised universal composability.<jats:italic>Mathematical Structures in Computer Science<\/jats:italic><jats:bold>19<\/jats:bold>(1), pp. 193\u2013205, 2009) argued that, in light of this attack, GUC would lose its concurrent general composability and proof of knowledge properties. Concretely, they argue that GUC composability would now be with respect to some adversaries with limited access to external arbitrary protocols.<\/jats:p><jats:p>In this work, we show that the claimed attack from Yao et al. is indeed harmless and does not contradict the security of the mentioned GUCZK protocol, thus restoring the general feasibility for GUC.<\/jats:p>","DOI":"10.1017\/s0960129516000074","type":"journal-article","created":{"date-parts":[[2016,6,8]],"date-time":"2016-06-08T10:45:56Z","timestamp":1465382756000},"page":"141-154","source":"Crossref","is-referenced-by-count":0,"title":["A second note on the feasibility of generalized universal composability"],"prefix":"10.1017","volume":"28","author":[{"given":"ALONSO","family":"GONZ\u00c1LEZ","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEJANDRO","family":"HEVIA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,6,8]]},"reference":[{"key":"S0960129516000074_ref11","unstructured":"Walfish S. (2008). Enhanced Security Models for Network Protocols, Ph.D. Thesis, New York University, New York, NY, USA, AAI3310580."},{"key":"S0960129516000074_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.027"},{"key":"S0960129516000074_ref2","doi-asserted-by":"crossref","unstructured":"Canetti R. (2001). Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, 136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"S0960129516000074_ref10","doi-asserted-by":"crossref","unstructured":"Pass R. (2003). On deniability in the common reference string and random oracle model. In: CRYPTO: Proceedings of Crypto.","DOI":"10.1007\/978-3-540-45146-4_19"},{"key":"S0960129516000074_ref5","unstructured":"Canetti R. and Fischlin M. (2001). Universally composable commitments. Cryptology ePrint Archive, Report 2001\/055. Available at http:\/\/eprint.iacr.org\/."},{"key":"S0960129516000074_ref6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","article-title":"On the limitations of universally composable two-party computation without set-up assumptions","volume":"19","author":"Canetti","year":"2006","journal-title":"JCRYPTOL: Journal of Cryptology"},{"key":"S0960129516000074_ref1","unstructured":"Blum M. (1986). How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, volume 1, 2."},{"key":"S0960129516000074_ref9","doi-asserted-by":"crossref","unstructured":"Lindell Y. (2003). General composition and universal composability in secure multi-party computation. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS).","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"S0960129516000074_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129508007330"},{"key":"S0960129516000074_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"S0960129516000074_ref8","doi-asserted-by":"crossref","unstructured":"De Santis A. and Persiano G. (October 1992). Zero-knowledge proofs of knowledge without interaction. In: IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PN, IEEE Computer Society Press, 427\u2013436.","DOI":"10.1109\/SFCS.1992.267809"},{"key":"S0960129516000074_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_6"},{"key":"S0960129516000074_ref7","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: STOC: ACM Symposium on Theory of Computing (STOC).","DOI":"10.1145\/509907.509980"},{"key":"S0960129516000074_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72504-6_43"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129516000074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T21:49:35Z","timestamp":1600724975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129516000074\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,8]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["S0960129516000074"],"URL":"https:\/\/doi.org\/10.1017\/s0960129516000074","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,8]]}}}