A note on the feasibility of generalised universal composability
- 1 February 2009
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 19 (1) , 193-205
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.Keywords
This publication has 20 references indexed in Scilit:
- On Probabilistic versus Deterministic Provers in the Definition of Proofs of KnowledgeLecture Notes in Computer Science, 2011
- A Note on Universal Composable Zero Knowledge in Common Reference String Model2007
- On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions2003
- Foundations of Cryptography2001
- Universally Composable Commitments2001
- On Defining Proofs of Knowledge2001
- Universally composable security: a new paradigm for cryptographic protocols2001
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- The knowledge complexity of interactive proof-systems1985