Universally composable identity-based encryption

被引：1

作者：

Nishimaki, Ryo ^{[1
,2
]}

Manabe, Yoshifumi ^{[2
,3
]}

Okamoto, Tatsuaki ^{[2
,4
]}

机构：

[1] Tokyo Inst Technol, Dept Math & Comp Sci, Tokyo, Japan

[2] Kyoto Univ, Grad Sch Informat, Kyoto 6068501, Japan

[3] NTT Corp, NTT Commun Sci Lab, Atsugi, Kanagawa 2430198, Japan

[4] NTT Corp, NTT Informat Sharing Platform Lab, Musashino, Tokyo 1808585, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2008年 / E91A卷 / 01期

关键词：

identity-based encryption; IND-ID-CCA2; universal composition;

D O I：

10.1093/ietfec/e91-a.1.262

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relations among them have been clarified recently. This paper, for the first time, investigates the security of IBE in the universally composable (UC) framework. This paper first defines the UC-security of IBE, i.e., we define the ideal functionality of IBE, F-IBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.

引用

页码：262 / 271

页数：10

共 22 条

[1]

[Anonymous], 2001, LECT NOTES COMPUTER

[2] Relations among notions of security for identity based encryption schemes [J].

Attrapadung, N ;

Cui, Y ;

Galindo, D ;

Hanaoka, G ;

Hasuo, I ;

Imai, H ;

Matsuura, K ;

Yang, P ;

Zhang, R .

LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 :130-141

[3]

Barak B, 2005, LECT NOTES COMPUT SC, V3621, P361

[4] Universally composable protocols with relaxed set-up assumptions [J].

Barak, B ;

Canetti, R ;

Nielsen, JB ;

Pass, R .

45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, :186-195

[5]

Boneh D, 2005, LECT NOTES COMPUT SC, V3376, P87

[6]

Boneh D, 2004, LECT NOTES COMPUT SC, V3152, P443

[7]

Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223

[8]

BONEH D, 2001, LNCS, V2139

[9] Universally composable security: A new paradigm for cryptographic protocols [J].

Canetti, R .

42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145

[10] Universally composable signature, certification, and authentication [J].

Canetti, R .

17TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2004, :219-233

← 1 2 3 →