An Efficient IBE Scheme using IFP and DDLP | Zendy

Chandrashekhar Meshram | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient IBE Scheme using IFP and DDLP

Author(s) -

Chandrashekhar Meshram

Publication year - 2013

Publication title -

international journal of information technology and computer science

Language(s) - English

Resource type - Journals

eISSN - 2074-9015

pISSN - 2074-9007

DOI - 10.5815/ijitcs.2013.06.09

Subject(s) - computer science , discrete logarithm , identity (music) , public key cryptography , encryption , scheme (mathematics) , computer security , key (lock) , theoretical computer science , mathematics , mathematical analysis , physics , acoustics

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 him- self 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research