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 条
  • [31] Long-term security and universal composability
    Mueller-Quade, Jorn
    Unruh, Dominique
    [J]. THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2007, 4392 : 41 - +
  • [32] Long-Term Security and Universal Composability
    Mueller-Quade, Joern
    Unruh, Dominique
    [J]. JOURNAL OF CRYPTOLOGY, 2010, 23 (04) : 594 - 671
  • [33] (Almost) all objects are universal in message passing systems (Extended abstract)
    Delporte-Gallet, C
    Fauconnier, H
    Guerraoui, R
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, 3724 : 184 - 198
  • [34] TEMPORAL REASONING UNDER GENERALIZED FAIRNESS CONSTRAINTS - (EXTENDED ABSTRACT)
    EMERSON, EA
    LEI, CL
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 21 - 35
  • [35] Universal composability framework for analysis of proxy threshold signature
    Hong X.
    Li X.-X.
    Gong Z.
    Chen K.-F.
    [J]. Journal of Shanghai Jiaotong University (Science), 2009, 14 E (01) : 107 - 111
  • [36] Universal Composability from Essentially Any Trusted Setup
    Rosulek, Mike
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 406 - 423
  • [37] General Composition and Universal Composability in Secure Multiparty Computation
    Yehuda Lindell
    [J]. Journal of Cryptology, 2009, 22 : 395 - 428
  • [38] On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Extended abstract)
    Kikuchi, Y
    Shibata, Y
    [J]. COMPUTING AND COMBINATORICS, 2001, 2108 : 400 - 408
  • [39] The IITM Model: A Simple and Expressive Model for Universal Composability
    Kuesters, Ralf
    Tuengerthal, Max
    Rausch, Daniel
    [J]. JOURNAL OF CRYPTOLOGY, 2020, 33 (04) : 1461 - 1584
  • [40] Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
    Barbosa, Manuel
    Barthe, Gilles
    Gregoire, Benjamin
    Koutsos, Adrien
    Strub, Pierre-Yves
    [J]. CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 2541 - 2563
12345