An efficient identity-based QER cryptographic scheme

Chandrashekhar Meshram,P L Powar

doi:10.1007/s40747-016-0030-8

Chandrashekhar Meshram, P L Powar

Open Access

https://doi.org/10.1007/s40747-016-0030-8

Copy DOI

Journal: Complex & Intelligent Systems	Publication Date: Nov 10, 2016
Citations: 7	License type: CC BY 4.0

Affiliation: Rani Durgavati University

Abstract

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.

Highlights

Rapid advances in computer technology and the development of the Internet are changing the way of daily life
Meshram [8] used the variant of IFP and DLP to construct their identitybased encryption scheme and proposed many identity-based cryptographic techniques [9,10,11,12] which have been proposed
The offered out comes provides the special result from the security point of view, because we face the problem of solving IFP and DLP simultaneously in the multiplicative group define over finite fields as compared with the other identity-based cryptographic scheme

Summary

Introduction

Rapid advances in computer technology and the development of the Internet are changing the way of daily life. Meshram [8] used the variant of IFP and DLP to construct their identitybased encryption scheme and proposed many identity-based cryptographic techniques [9,10,11,12] which have been proposed In these techniques, the public key of each entity is an identity, it is some random number selected either by the entity or by the trusted authority. The rest of this paper is organized as follows: review of Meshram and Obaidat’s identity-based QER cryptographic scheme is discussed in Sect. PKG carries out the following steps to compute the private key of the entity i, whose identity is a k-dimensional binary vector IDi =

Compute

Conclusion