Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Universally Composable Identity-Based Encryption

Ryo Nishimaki, Yoshifumi Manabe, Tatsuaki Okamoto

Published Jan 1, 2006• 3 citations
Publisher
DOI
10.1007/11958239_23

Related papers

Universally composable security of identity-based signature schemes

Zecheng Wang

Journal of Computer Applications•Mar 21, 2011•0 citations

Universally Composable Identity Based Adaptive Oblivious Transfer with Access Control

Vandana Guleria, Ratna Dutta

Lecture notes in computer science•Jan 1, 2015•3 citations

Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

Communications in computer and information science•Jan 1, 2012•3 citations

Identity-Based Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation

Universally Composable Identity-Based Encryption

Ryo Nishimaki, Y. MANABE, T. OKAMOTO

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, FIBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2008•4 citations

Universal Composability Notion for Functional Encryption Schemes

Sadikin Rifki, Youngho Park, Kil-houm Park +1 more

We have developed an ideal functionality for security requirement of functional encryption schemes. The functionality is needed when we want to show the security of a functional encryption scheme in universal composable (UC) framework. A functionality $F_{fe}$ was developed to represent ideal respond of a functional encryption scheme against any polynomial time active attacker. We show that UC security notion of functional encryption scheme $F_{fe}$ is as strong as fully secure functional encryption in an indistinguishable game with chosen cipher text attack. The proof used a method that showing for any environment algorithm, it can not distinguish ideal world where the attacker play with ideal functionality $F_{fe}$ and real world where the attacker play a fully secure functional encryption scheme.

Journal of the Korea Industrial Information Systems Research•Jun 30, 2013•2 citations
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, FIBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.
We have developed an ideal functionality for security requirement of functional encryption schemes. The functionality is needed when we want to show the security of a functional encryption scheme in universal composable (UC) framework. A functionality FfeF_{fe}Ffe​ was developed to represent ideal respond of a functional encryption scheme against any polynomial time active attacker. We show that UC security notion of functional encryption scheme FfeF_{fe}Ffe​ is as strong as fully secure functional encryption in an indistinguishable game with chosen cipher text attack. The proof used a method that showing for any environment algorithm, it can not distinguish ideal world where the attacker play with ideal functionality FfeF_{fe}Ffe​ and real world where the attacker play a fully secure functional encryption scheme.