A note on the feasibility of generalized universal composability - (Extended abstract)

被引：0
|
作者：
Yao, Andrew C. C. [2 ]
Yao, Frances F. [3 ]
Zhao, Yunlei [1 ]
机构：
[1] Fudan Univ, Software Sch, Shanghai 200433, Peoples R China
[2] Tsinghua Univ, Ctr Adv Study, Beijing, Peoples R China
[3] City Univ Hong Kong, Dept Comp Sci, Hong Hom, Hong Kong, Peoples R China
来源：
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS | 2007年 / 4484卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：474 / +
页数：4
相关论文
共 50 条
  • [1] A second note on the feasibility of generalized universal composability
    Gonzalez, Alonso
    Hevia, Alejandro
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (02) : 141 - 154
  • [2] A note on the feasibility of generalised universal composability
    Yao, Andrew C. C.
    Yao, Frances F.
    Zhao, Yunlei
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2009, 19 (01) : 193 - 205
  • [3] On The Composability of Design Patterns: Extended Abstract
    Zhu, Hong
    Bayley, Ian
    [J]. 2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2017, : 369 - 370
  • [4] Symbolic Universal Composability
    Boehl, Florian
    Unruh, Dominique
    [J]. 2013 IEEE 26TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2013, : 257 - 271
  • [5] CHARACTERIZING COMPOSABILITY OF ABSTRACT IMPLEMENTATIONS
    OREJAS, F
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 335 - 346
  • [6] Symbolic universal composability
    Boehl, Florian
    Unruh, Dominique
    [J]. JOURNAL OF COMPUTER SECURITY, 2016, 24 (01) : 1 - 38
  • [7] A generalized birthday problem - (Extended abstract)
    Wagner, D
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2002, PROCEEDINGS, 2002, 2442 : 288 - 303
  • [8] Extended abstract theory of universal series and applications
    Hadjiloucas, Demetris
    [J]. MONATSHEFTE FUR MATHEMATIK, 2009, 158 (02): : 151 - 178
  • [9] Extended abstract theory of universal series and applications
    Demetris Hadjiloucas
    [J]. Monatshefte für Mathematik, 2009, 158 : 151 - 178
  • [10] AUC: Accountable Universal Composability
    Graf, Mike
    Kusters, Ralf
    Rausch, Daniel
    [J]. 2023 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP, 2023, : 1148 - 1167
12345