An efficient ID-based Beta Cryptosystem

Abstract

In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a public 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 cryptosystem, but only in constructing an identity-based signature scheme. Meshram and Meshram [5] have proposed an identity-based beta cryptosystem, security under the generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem. In this paper, we propose some modification in identity-based beta cryptosystem based on generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem 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.