Universally Composable Identity-Based Encryption
نویسندگان
چکیده
The 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 and the relations among them have been clarified recently. This paper, for the first time, investigate 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. This paper also introduces the UC-security of weaker security notions of IBE, which correspond to IND-ID-CPA IBE and IND-sID-CCA2. We finally prove that Boneh-Franklin’s suggestion on the construction of a secure signatures from an IND-ID-CPA IBE scheme is true in the UC framework.
منابع مشابه
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Canetti and Fischlin have recently proposed the security notion universal composability for commitment schemes and provided two examples. This new notion is very strong. It guarantees that security is maintained even when an unbounded number of copies of the scheme are running concurrently, also it guarantees non-malleability and security against adaptive adversaries. Both proposed schemes use ...
متن کاملUniversally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
We present a new general multiparty computation protocol for the cryptographic scenario which is universally composable — in particular, it is secure against an active and adaptive adversary, corrupting any minority of the parties. The protocol is as efficient as the best known statically secure solutions, in particular the number of bits broadcast (which dominates the complexity) is Ω(nk|C|), ...
متن کاملGUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party set-intersection computation based-on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. Compared with related works, this construction is provably GUC(generalized un...
متن کاملExtending a universally composable cryptographic library
Protocol verification is essential to guarantee the security of a certain protocol. For a long time there have been two methods for this job: formal and computational. However, for large and complex protocols we need an automated tool to verify them, because of error-prone nature of manual proofs. Such a tool motivates us to reconcile the two verification approaches. In this paper we define an ...
متن کاملUniversally Composable Secure Group Communication
This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion model and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM , FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption protocol πIDSC . Moreover, we shows that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 91-A شماره
صفحات -
تاریخ انتشار 2006