Fuzzy Identity-based Encryption Scheme Research Articles

IoT-friendly, pre-computed and outsourced attribute based encryption

The Internet of Things (IoT) and its applications are growing at an unprecedented rate. In such a complex network with an enormous number of nodes, an important challenge is how to securely handle the access control problem. Attribute Based Encryption (ABE) is a powerful and flexible cryptographic primitive to address the challenge of realizing fine-grained access control in many systems. However, using ABE in IoT systems is often problematic due to the heavy computational overhead originating from the bilinear pairing operations and the relatively large key sizes of ABE schemes.This paper deals with this challenge by proposing some solutions to overcome the limitations of using ABE in IoT systems. The contributions of this paper are divided into three parts. In the first part, we propose modified fuzzy identity-based encryption (FIBE) schemes that use fewer optimal ate pairing operations compared to the original FIBE. FIBE is a special case of ABE, in which the access structure simplifies to a threshold gate. We also introduce a new security notion named the Conditional Chosen Ciphertext Attack-2 (Conditional CCA-2) selective security which is stronger than the CPA selective security notion. We prove that the proposed FIBE schemes have Conditional CCA-2 selective security, under the Asymmetric Decisional Modified Bilinear Diffie–Hellman (ADMBDH) assumption. In the second part, we proposed Key Policy Attribute Based Encryption (KP-ABE) schemes that use fewer pairing operations compared to the previous KP-ABE schemes. Our FIBE and KP-ABE schemes use elliptic curve groups which ensure shorter keys. In the third part of our contribution, we propose secure methods to outsource the heavy operations in FIBE and KP-ABE schemes (i.e. scalar multiplication by a curve point, exponentiation, and pairing) such that IoT devices can cope with the complexity.

Fully secure fuzzy identity-based encryption for secure IoT communications

How to securely transmit data is an important problem in Internet of Things (IoT). Fuzzy identity-based encryption (FIBE) is a good candidate for resolving this problem. However, existing FIBE schemes suffer from the following disadvantages: rely on random oracle models, merely secure in selective-ID model, long public parameters, and loose security reduction. In this paper, we propose a new FIBE scheme. Our scheme is secure in the full model without random oracles, and at the same time has a tight security reduction and short public parameters. This means that our scheme is quite suitable for secure transmitting data in IOT.

SECURITY ANALYSIS OF A FUZZY IDENTITY-BASED ENCRYPTION SCHEME

Fuzzy identity-based encryption (FIBE) scheme is a kind of identity-based encryption (IBE) scheme, in which any user's identity is composed by a set of attributes and any ciphertext encrypted under identity ID can be decrypted by using a private key corresponding to identity ID′ if ID′ is close to ID as measured by some metric. Due to the error-tolerance property, FIBE scheme is very useful in real-world applications. However, most FIBE schemes are provable secure only in a weaker security model. In order to eliminate this problem, Ren et al. recently proposed a new FIBE scheme and proved that it is fully chosen-ciphertext secure in the standard model. Unfortunately, in this paper, we will show that their FIBE scheme is even not chosen-plaintext secure.

Improvement on a Fuzzy Identity-based Encryption Scheme

Sahai and Waters introduced a fuzzy id-based encryption (FIBE) scheme in which an identity was viewed as a set of descriptive attributes, and any user with a private key for an identity was allowed to decrypt a ciphertext encrypted with an identity , if and only if the identity and were close to each other as measured by the “set overlap” distance metric. After that, Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris and Hoeteck Weeto constructed a fuzzy id-based encryption scheme from the hardness of the Learning With Errors ( ) problem. The two schemes both had more longer public and private keys, and it was not very efficient. This paper gives more efficient fuzzy id-based encryption scheme from lattice, in which the public keys are greatly reduced, and there are two vectors corresponding to each bit of the identity by using of the algorithm Sampleleft introduced by Shweta Agrawal, Dan Boneh and Xavier Boyen, and only a trapdoor basis is the secret key. Furthermore, the scheme is dealing with information and is also secure from the hardness of the Learning With Errors ( ) problem, and all these greatly raise efficiency.

Private mutual authentications with fuzzy matching

A private mutual authentication, or unlinkable secret handshake, originally allows two members from the same organisations to anonymously authenticate each other. In this paper, a new privacy-preserving mutual authentication protocol is constructed to achieve fuzzy private matching. The proposed protocol supports more flexible threshold-based appropriate matching under the multiple-groups environment, which is not limited to authenticate between members from the same groups. Our new protocol is constructed from the fuzzy identity-based encryption scheme and constant-size group signature. Without using the random oracle, the new protocol is proved secure by assuming the intractability of the decisional bilinear Diffie-Hellman problems. Compared with previous works, our proposed protocol can adapt to many different applications.

Fuzzy Certificateless Identity-Based Encryption Protocol from Lattice

Due to their conjectured resistance to quantum cryptanalysis, strong worst-case/average-case security guarantees, ease of implementation and increasing practicality, lattice-based cryptography is one of the hottest and fastest moving areas in mathematical cryptography today. In this paper, we give a fuzzy certificateless identity-based encryption scheme from lattice, whose security is based on the hardness of the Learning With Errors (LWE) problem. In the scheme, the user can choose his own secret key that the KGC cannot obtain, which is an efficient approach to mitigate the key escrow problem in fuzzy identity-based encryption scheme.

A provable secure fuzzy identity based signature scheme

To use biometrics identities in an identity based encryption system, Sahai and Waters first introduced the notion of fuzzy identity based encryption (FIBE) in 2005. Yang et al. extended it to digital signature and introduced the concept of fuzzy identity based signature (FIBS) in 2008, and constructed an FIBS scheme based on Sahai and Waters’s FIBE scheme. In this paper, we further formalize the notion and security model of FIBS scheme and propose a new construction of FIBS scheme based on bilinear pairing. The proposed scheme not only provides shorter public parameters, private key and signature, but also have useful structures which result in more efficient verification than that of Yang et al.’s FIBS scheme. The proposed FIBS scheme is proved to be existentially unforgeable under a chosen message attack and selective fuzzy identity attack in the random oracle model under the discrete logarithm assumption.

Cryptanalysis of a Fuzzy Identity Based Encryption Scheme in the Standard Model

Fuzzy identity based encryption (FIBE), proposed by Sahai and Waters, is a new kind of identity based encryption. It allows users with identity w can decrypt ciphertext for w' if and only if w is close enough to w'. Recently, Ren et al. proposed a new FIBE scheme and claimed it is fully CCA2 secure in the standard model with a tight reduction. However, in this paper we will show that their scheme is not correct. Furthermore, the key generation process of their scheme cannot resist the collusion attack, which is a basic security requirement for FIBE. At last, we propose a new fully secure FIBE scheme based on the Sahai–Waters FIBE scheme and prove its security by using the “dual system encryption” technique.

A new biometric identity based encryption scheme secure against DoS attacks

AbstractRecently, Sarier 1 proposed an efficient biometric Identity Based Encryption (IBE) scheme called BIO‐IBE using the Sakai Kasahara Key Construction and proved its security in the Random Oracle Model (ROM) based on the well‐exploited k‐BDHI computational problem. Despite its efficiency compared to other fuzzy IBE systems implemented for biometric identities, BIO‐IBE is not secure against a new type of denial of service (DoS) attack that we present. In this context, we describe a new biometric IBE scheme and show that our scheme is immune against this attack due to the signature applied on the public value PAR of the user. This way, the sender can detect whether PAR of the receiver that is stored publicly is modified by an active adversary, thus the generation of a ciphertext based on a wrong identity is avoided. The main difference of the new scheme is the structure of the key generation algorithm, where a unique biometric identity string ID obtained from the biometric attributes is used instead of picking a different polynomial for each user as in other fuzzy IBE schemes. In addition to the well‐defined security model for current fuzzy IBE schemes, we describe a stronger security model and prove the security of our scheme in this framework achieving a better reduction cost compared to BIO‐IBE. Finally, our scheme provides security against DoS attacks and better efficiency in terms of the key generation and decryption algorithms compared to the existing fuzzy IBE schemes. Copyright © 2009 John Wiley & Sons, Ltd.

New Fuzzy Identity-Based Encryption in the Standard Model

In a fuzzy identity-based encryption (IBE) scheme, a user with the secret key for an identity ID is able to decrypt a ciphertext encrypted with another identity ID' if and only if ID and ID' are within a certain distance of each other as judged by some metric. Fuzzy IBE also allows to encrypt a document to all users that have a certain set of attributes. In 2005, Sahai and Waters first proposed the notion of fuzzy IBE and proved the security of their scheme under the selective-ID model. Currently, there is no fuzzy IBE scheme available that is fully CCA2 secure in the standard model. In this paper, we propose a new fuzzy IBE scheme which achieves IND-FID-CCA2 security in the standard model with a tight reduction. Moreover, the size of public parameters is independent of the number of attributes associated with an identity.