Abstract
We clarify the potential limitation of the general feasibility for generalized universal composability (GUC) proposed in the recent work [8], and discuss a general principle for fully realizing universal composability. This in particular demonstrates the hardness of achieving generalized universal composability, and prevents potential misinterpretation in applications. We also propose some fixing approaches, which involve a source/session-authentic ID-based trapdoor commitment scheme via the hash-then-commit paradigm that could possibly be of independent interest. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Yao, A. C. C., Yao, F. F., & Zhao, Y. (2007). A note on the feasibility of generalized universal composability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 474–485). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
