An Efficient IBE Scheme using IFP and DDLP
نویسنده
چکیده
In 1984, Shamir introduced the concept of an identity-based encryption. In this system, each user needs to visit a private key generation (PKG) and identify himself before joining a communication network. Once a user is accepted, the PKG will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the ―identity‖ of his communication partner and the public key of the PKG. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based encryption, but only in constructing an identity-based signature (IBS) scheme. In this paper, we propose an identity based encryption (IBE) based on the factorization problem (IFP) and double discrete logarithm problem (DDLP) and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.
منابع مشابه
Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communicatio...
متن کاملEfficient revocable identity-based encryption via subset difference methods
Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user’s credential (or private key) can be expired or revealed. Revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme for key revocation. In this paper, we present a new technique fo...
متن کاملVariants of Waters’ Dual-System Primitives Using Asymmetric Pairings
Waters, in 2009, introduced an important technique, called dual-system encryption, to construct identity-based encryption (IBE) and related schemes. The resulting IBE scheme was described in the setting of symmetric pairing. A key feature of the construction is the presence of random tags in the ciphertext and decryption key. Later work by Lewko and Waters has removed the tags and proceeding th...
متن کاملEfficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
In 2015, Hofheinz et al. [PKC, 2015] extended Chen and Wee’s almost-tight reduction technique for identity based encryptions (IBE) [CRYPTO, 2013] to the multi-instance, multi-ciphertext (MIMC, or multi-challenge) setting, where the adversary is allowed to obtain multiple challenge ciphertexts from multiple IBE instances, and gave the first almost-tightly secure IBE in this setting using composi...
متن کاملA new biometric identity based encryption scheme secure against DoS attacks
Recently, Sarier [1] proposed an efficient biometric Identity Based Encryption (IBE) scheme called BIO-IBE using the Sakai Kasahara Key Construction and prove its security in the random oracle model based on the well-exploited k-BDHI computational problem. Despite its efficiency compared to other fuzzy IBE systems implemented for biometric identities, BIO-IBE is not secure against a new type of...
متن کامل