Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography

Aniket Kate, Ian Goldberg, David R. Cheriton

Published Jan 1, 2009• 17 citations

Abstract

An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages over the Internet. However, an IBE scheme necessarily requires a private-key generator (PKG), which can create private keys for clients, and so can passively eavesdrop on all encrypted communications. Although a distributed PKG has been suggested as a way to mitigate this problem for Boneh and Franklin’s IBE scheme, the security of this distributed protocol has not been proven and the proposed solution does not work over the asynchronous Internet. Further, a distributed PKG has not been considered for any other IBE scheme. In this paper, we design distributed PKG setup and private key extraction protocols in an asynchronous communication model for three important IBE schemes; namely, Boneh and Franklin’s IBE, Sakai and Kasahara’s IBE, and Boneh and Boyen’s BB1-IBE. We give special attention to the applicability of our protocols to all possible types of bilinear pairings and prove their IND-ID-CCA security in the random oracle model. Finally, we also perform a comparative analysis of these protocols and present recommendations for their use. 1

Related papers

Identity Based Proxy Re-encryption From BB1 IBE

Jindan Zhang, Xu An Wang, Xiaoyuan Yang

In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opened under Bob’s decryption key. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE (Certificate Based Public Key Encryption) to IBE (Identity Based Encryption) (type 1), IBE to IBE (type 2), IBE to CBE (type 3), CBE to CBE (type 4). In this paper, we find that if we allow the PKG to use its masterkey in the process of generating re-encryption key for proxy re-encryption in identity based setting, many open problems can be solved. We give the new security models for proxy reencryption in identity based setting, especially considering PKG’s involving in the re-encryption key generation process and PKG’s master-key’s security. We construct the new IND-ID-CPA and the first IND-ID-CCA2 secure proxy reencryption schemes based on BB1 IBE. We also prove their security by introducing some new techniques which maybe have independent interest. At last, we compare our new schemes with existing ones, the results show that our scheme can achieve high security levels and are very efficient for re-encryption and, which are very important for practical applications.

Journal of ComputersMay 18, 20131 citation

An IBE Scheme to Exchange Authenticated Secret Keys.

Waldyr Benits, Routo Terada

We present a variant of the Boneh & Franklin Identiybased Encryption IBE scheme to derive an authenticated symmetric key-exchange protocol, when combined with a signature scheme. Our protocol uses IBE as a secure channel to establish a symmetric key between two users and, after that, further communication can be done by symmetric cryptography, much faster than pairing-based cryptography.

Jan 1, 20045 citations

Identity-Based Threshold Decryption Schemes Secure against Chosen Ciphertext Attacks in the Standard Model

Mei Qi, He Da

We propose two efficient Identity-Based threshold decryption schemes.They are proved secure against chosen ciphertext attacks under the standard decisional bilinear Diffie-Hellman assumption.The first one is constructed from(one of) the Selective ID-Based Encryption(Selective-IBE) scheme proposed by Boneh and Boyen recently,yet the second one is transformed from the Full ID-Based Encryption(Full-IBE) scheme obtained by Waters.As the based IBE schemes,the attacker in the first proposal has to choose the challenge identity before the common parameter is generated.while the attacker in the second one could choose the identity adaptively.To the best of our knowledge,previous related schemes could only be proved secure in the random oracle model.

Journal of the Graduate School of the Chinese Academy of SciencesJan 1, 20061 citation

Efficient Identity-Based Encryption from Lattice

Huiyan Chen, Dongmei Chen, Yanshuo Zhang

At present, most of the identity based encryption (IBE) schemes from the lattice originate from the results of Gentry et.al., and regard each identity as a bit string with equal length and then map a matrix to every bit of identity string. Consequently, they are considerably less efficient. In our paper, we construct an IBE which is efficient from standard learning with errors problem and handles identities as a chunk for performance. In the standard model, our paper gives a proof which our IBE is IND-sID-CCA secure. Mean-while, we also show which our IBE construction is also IND-ID-CCA secure via the technique i.e., imposing additional restrictions on the identities, presented by Boyen and Boneh.

International Conference on Information Science and Cloud Computing Companion (ISCC-C)Dec 1, 20130 citations

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Mohammad Sabzinejad Farash, Mahmoud Ahmadian‐Attari

A B S T R A C T Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is generated by a trusted Private Key Generator (PKG). However, it is unrealistic to assume that a single PKG will be responsible for issuing private keys to members of dierent organizations or a large-scale nation. Hence, it is needed to consider multiple PKG environments with dierent system parameters. In this paper, we propose an identity-based key agreement protocol among users of dierent networks with independent PKGs, which makes use of elliptic curves. We prove the security of the proposed protocol in the random oracle model and show that all security attributes are satised. We also demonstrate a comparison between our protocol and some related protocols in terms of the communication costs and the execution time. The results show that the execution time of our protocol is less than 10%, and its communication costs are about 50% of the competitor protocols.

Jan 1, 201320 citations

On the Role of PKG for Proxy Re-encryption in Identity Based Setting.

Xu An Wang, Xiaoyuan Yang, Fagen Li

Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption[3]. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opened under Bob’s decryption key. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE(Certificate Based Public Key Encryption) to IBE(Identity Based Encryption)(type 1), IBE to IBE(type 2), IBE to CBE (type 3), CBE to CBE (type 4)[29]. Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working group[31]. In this paper, based on [29] we pay attention to the role of PKG for proxy re-encryption in identity based setting. We find that if we allow the PKG to use its master-key in the process of generating re-encryption key for proxy re-encryption in identity based setting, many open problems can be solved. Our main results are as following: We construct the first proxy re-encryption scheme from CBE to IBE which can resist malicious PKG attack, the first proxy re-encryption scheme from IBE to CBE, the second proxy re-encryption scheme based on a variant of BB1 IBE 1, the first proxy re-encryption scheme based on BB2 IBE, the first proxy re-encryption scheme based on SK IBE, we also prove their security in their corresponding security models. 1

Jan 1, 20084 citations