Papers by Chandrashekhar Meshram
Complex & Intelligent Systems, 2016
Recently, an identity-based quadratic exponentiation randomized cryptosystem scheme using the dis... more Recently, an identity-based quadratic exponentiation randomized cryptosystem scheme using the discrete logarithm problem and the integer factorization problem has been developed. Their contribution lies in that they initiated an idea to create the identity-based cryptographic scheme without bilinear pair. This scheme can achieve the security goal of protecting data and prevent the adversary from snooping the encrypted data, and finding the secrete keys. In this paper, we have proposed some modification in setup phase using floor function and super-increasing sequence, and modified the encryption and decryption process in the identity-based quadratic exponentiation randomized cryptographic scheme. We also discuss how to enhance the security of proposed scheme and processing cost of the proposed scheme.
An ID-Based Public key Cryptosystem based on the Double Discrete Logarithm Problem
International Journal of Computer …, 2010
Information Processing Letters, 2012
In 1984, Shamir introduced the concept of an identity-based cryptosystem. In this system, each us... more In 1984, Shamir introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify himself 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 communication partner and the public key of the KAC. 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. In this paper, we propose an ID-based cryptosystem under the security assumptions of the generalized discrete logarithm problem and integer factorization problem. We consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.
Enhancing the security of Public key cryptosystem based on DLP γ≡ α aβ b (mod p)
… Journal of Research and Reviews in …, 2010
International Journal of Advanced Computer Science …, 2010
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, eac... more 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 communication partner and the public key of the KAC. 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 Agrawal [4] have proposed an id -based cryptosystem based on double discrete logarithm problem which uses the public key cryptosystem based on double discrete logarithm problem. In this paper, we propose the modification in an id based cryptosystem based on the double discrete logarithm 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.
Int. J. Contemp. Math. Sciences, 2011
This paper introduces mainly the concept of public key cryptosystem, whose security is based on d... more This paper introduces mainly the concept of public key cryptosystem, whose security is based on double generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on double generalized discrete logarithm problem, provides more security because of double computation comparing with the generalized discrete logarithm problem. Hence the adversary has to solve distinct discrete logarithm problems simultaneously in order to recover a corresponding plaintext from the received cipertext. Therefore, this scheme is expected to gain a higher level of security. We next show that, the newly developed scheme is efficient with respect to encryption and decryption and the validity of this algorithm is proven by applying to message that are text and returning the original message in numerical examples.
International Journal of Advanced Computer Science …, 2011
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, eac... more 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 communication partner and the public key of the KAC. 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 Agrawal [5] have proposed an id -based cryptosystem based on integer factoring and double discrete logarithm problem which uses the public key cryptosystem based on integer factoring and double discrete logarithm problem. In this paper, we propose the modification in an id based cryptosystem based on the integer factoring and double discrete logarithm 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.
An identity based beta cryptosystem
Information Assurance and Security …, 2011
In a modern open network system, data security technologies such as cryptosystems, signature sche... more In a modern open network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a large-scale network, ID-based systems such as the ID-based cryptosystem, the ID-based signature scheme, or the ID-based key distribution system are among the better countermeasures for establishing efficient and secure data transmission systems. The concept of an ID-based cryptosystem has been proposed by Shamir [1], and it is advantageous to public-key cryptosystems because a large public-key file is not required for such a system. This paper proposes an ID-based beta cryptosystem under the security assumptions of the generalized discrete logarithm problem and integer factorization problem, which is one of the earliest realizations in Shamir's sense. Furthermore, we consider the security against a conspiracy of some users in the proposed system, and show the possibility of establishing a more secure system.
Uploads
Papers by Chandrashekhar Meshram