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 language | English |
|---|---|
| Pages (from-to) | 193-205 |
| Journal | Mathematical Structures in Computer Science |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver