V-BIBE: A New Identity Based Encryption Scheme

In public key encryption every user must have a pair of keys, public key and private key, for encrypting and decrypting messages. An Identity-based encryption (IBE) eliminates the need for a Public Key Infrastructure (PKI). IBE uses the human intelligible identities (e.g., unique name, email address, IP address, etc) as public keys. The sender using IBE encrypts message with the receivers' identity rather than looking for receivers' public key and corresponding certificate. Accordingly, receiver decrypts ciphertext using private key associated with the corresponding identity. The private keys of users are obtained from a trusted third party called as Private Key Generator (PKG). The motivation of this paper is to study and review an efficient and secure Identity based encryption scheme with outsourced revocation for cloud computing. .

2003

... Definition1 We say that an identity based signcryption scheme (IDSC) has the indistinguishability against adaptive chosen ciphertext attacks property (I”-IDSC-CCA) if no polynomially bounded adversary has a non-negligible advan-tage in the following game. ...

In a famous paper of Crypto'01, Boneh and Franklin proposed the first identity-based encryption scheme (IBE), around fifteen years after the concept was introduced by Shamir. Their scheme security (more precisely, the notion of resistance against an IND-ID-CCA attacker) relies in the random oracle model. However, the reduction is far from being tight, and notably depends on the number of extractions queries. In this paper, we present an efficient modification to the Boneh-Franklin scheme that provides a tight reduction. Our scheme is basically an IBE under two keys, one of which is (randomly) detained by the recipient. It can be viewed as a continuation of an idea introduced by Katz and Wang; we will however show how our construction improves this last scheme. Our scheme features a tight reduction to the list bilinear Diffie-Hellman (LBDH) problem, which can be itself reduced tightly either to the gap bilinear Diffie-Hellman (GBDH) or the decisional bilinear Diffie-Hellman (DBDH) problems. Furthermore, for a relaxed notion of tightness (called weak-tightness) that we introduce and discuss in our paper, we show that there is a weakly tight reduction from our scheme to the computational bilinear Diffie-Hellman (CBDH) problem. Our scheme is very efficient, as one can precompute most of the quantity involved in the encryption process. Furthermore, the ciphertext size is very short: for proposed parameters, they are |M | + 330 bits long. keywords: ID-based encryption, tight security reduction ¶ A simple recounting of the reduction with Galindo's strategy [7] is adopted here, while the original reduction given in is O(1/q 3 h ).

IACR Cryptol. ePrint Arch., 2003

An Identity-based cryptosystem is a Public Key cryptosystem in which the public keys of the entities are their identities, or strings derived from their identities. Signcryption combines digital signatures and encryption with a cost significantly smaller than that required for signature-thenencryption. This paper proposes an ID-based signcryption scheme based on bilinear pairings on elliptic curves. It is shown that the new scheme is an improved version of the existing signcryption scheme [10] by comparing the computations in both the schemes.

IJARIIT-Volume 5 issue 3, 2019

Cryptography is an art which provides confidentiality, integrity, non-repudiation, and authentication to the parties involve in communication. Identity-based systems allow any party to generate a public key from a known identity value such as an ASCII string. A trusted third party, called the Private Key Generator (PKG), generates the corresponding private keys. PKG uses user's credentials to publish the public key and after authentication of the user, it grants it is a master private key. Security of IBE depends on the trust of issuing authority. The purpose of this paper is to review the technological aspects in cryptography under Identity-based scheme. Section I provide an introduction of the scheme illustrating its background and procedure: Section II throw light on few schemes of IBC with their proofing algorithms while Section III mention the pros and cons of this scheme and finally the conclusion. Section IV summarises the content as the conclusion of the paper. Section V list the references that were sighted in the writing of this paper.

IJSRD, 2014

Cloud computing has become the important platform to provide the infrastructure for computation, data storage, software services using the virtualization concept. These services are provided over internet, so security issue of data must be taken into consideration. Intruder can attack to access data or interrupt the communication. To prevent the attacks like man-in-the-middle attack, chosen plaintext, chosen cipher text, denial of services, need to implement number of techniques. The encryption through Public Key Infrastructure (PKI) using private key and public key is most known technique but the computational process, storage and certificate management effort to high and difficult for the Certificate Authority (CA). To reduce this effort and difficulties, the other technique is Identity Based Encryption (IBE) which reduces the overhead of Certificate Management and all other difficulties. IBE does the task easy to prevent communication against above attacks. In this paper, different schemes will be analyzed used against different attacks under the different strategies. To provide better key management, IBE uses the Private Key Generator (PKG), instead of CA, generates Private Key from the Identity of user. It uses the Hash Functions to provide better security.

2019

1330 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Retrieval Number: F12700486S419/19©BEIESP DOI: 10.35940/ijitee.F1270.0486S419 Abstract— In computer based system, key for the problem of identification, authentication and secrecy can be found in the field of cryptography. Dependence on public key infrastructure and to receive certificates signed by Certificate Authority (CA) to authenticate oneself for exchange of encrypted messages is one of the most significant limitation for the widespread adoption of Public Key Cryptography (PKC) as this process is time engrossing and error prone. Identity based cryptography (IBC) aspires to reduce the certificate and key management overhead of PKC. IBC’s important primordial is Identity-based Encryption (IBE). IBE provided emergent for perception of Identity based signature (IBS) schemes. In this paper, overview of IBE and IBS schemes has been given. Also, a survey on various IBE and IBS schemes has been performed to ...

IACR Cryptology ePrint Archive, 2016

BasicIBE and AnonIBE are two space-efficient identity-based encryption (IBE) schemes based on quadratic residues, proposed by Boneh, Gentry, and Hamburg, and closely related to Cocks' IBE scheme. BasicIBE is secure in the random oracle model under the quadratic residuosity assumption, while AnonIBE is secure in the standard model under the interactive quadratic residuosity assumption. In this paper we revise the BasicIBE scheme and we show that if the requirements for the deterministic algorithms used to output encryption and decryption polynomials are slightly changed, then the scheme's security margin can be slightly improved.

… of the 15th ACM conference on …, 2008

Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Pub-lic Key Infrastructure (PKI). The senders using an IBE do not need to look up the public keys and the corresponding certificates of the ...

The ISC International Journal of Information Security, 2023

In the last two decades bilinear pairings have found many applications in cryptography. Meanwhile identity-based cryptosystems based on bilinear pairings have received particular attention. The IEEE, IETF, and ISO organizations have been working on standardization of pairing-based cryptographic schemes. The Boneh-Franklin identity-based encryption and Sakai-Kasahara identity-based signature are the most well-known identity-based schemes that have been standardized. So far, various schemes have been proposed to reduce the computational overhead of pairing operations. All these schemes are trying to outsource pairing operations in a secure manner. But besides pairing operations, there are other basic and costly operations in pairing-based cryptography and identity-based schemes, including scalar multiplication on elliptic curves. In this research, we outsource the Boneh-Franklin encryption in a more secure and efficient (in terms of computational and communication complexity) way than existing schemes. Also we outsource the BLMQ signature (based on Sakai-Kasahara) scheme for the first time. The proposed schemes are secure in the OMTUP model. Also, unlike previous schemes, we considered communication channels insecure. Moreover, compared with the trivial solution which outsources every single operation (such as pairing, scalar multiplication and modular exponentiation) as a separate subroutine, our schemes offer less complexity by seamlessly outsourcing the whole encryption scheme for the first time. https://www.isecure-journal.com/article_170579.html