Skip to main navigation Skip to search Skip to main content

A note on the feasibility of generalised universal composability

  • Andrew C. C. Yao
  • , Frances F. Yao
  • , Yunlei Zhao

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

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 et al. (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 limited 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. © 2009 Cambridge University Press.
Original languageEnglish
Pages (from-to)193-205
JournalMathematical Structures in Computer Science
Volume19
Issue number1
DOIs
Publication statusPublished - Feb 2009

Fingerprint

Dive into the research topics of 'A note on the feasibility of generalised universal composability'. Together they form a unique fingerprint.

Cite this