selective-ID Model Research Articles

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.

Protecting data in cloud environment with attribute-based encryption

Traditional file systems cannot satisfy the recent requirements in the cloud environment. Meanwhile, current file systems designed for cloud computing cannot provide enough flexibility, fine-grained access control and access security. In this paper, a novel secure file sharing scheme based on attribute control is presented. In order to design a practical cloud file system with attribute based encryption, we give a systematic definition of attribute computing in cloud computing environment. Based on the definition, we present a secure and practical attribute based encryption scheme without pairings CP-ABE-WP under cloud computing scenarios. Then we design a secure cloud file system applying our CP-ABE-WP to provide data management and secure data sharing. According to our analysis and test, the scheme is chosen plaintext secure in selective ID model with acceptable performance and can satisfy the file sharing application in cloud computing.

New identity-based key-encapsulation mechanism and its applications in cloud computing

Identity-based encryption IBE is an important primitive of identity-based cryptography. As such, it is a type of public-key encryption in which the public key of a user is some unique information about the identity of the user e.g., a user's e-mail address. As a special form of IBE, identity-based key encapsulation mechanism IB-KEM can be used to create a random session key for encrypting messages. Any IB-KEM can be updated to a full IBE scheme by adding a symmetric encryption scheme with appropriate security properties. Currently, IB-KEM is a fundamental primitive of cryptography, and can be used to protect information system security, network security, cloud security, etc. In this paper, we construct a new IB-KEM in a generic levelled multilinear map setting and prove its security under multilinear decisional Diffie-Hellman assumption in the selective-ID model. Then, we make our IB-KEM translated to the GGH framework, which is proposed by Garg et al. 2013a. This framework defines an approximate version of a multilinear group family from ideal lattices. Finally, as an application of our new scheme, we introduce how to achieve secure transmission in the hierarchical architecture for cloud computing HACC.

Multi-authority attribute-based encryption with honest-but-curious central authority

An attribute-based encryption scheme capable of handling multiple authorities was recently proposed by Chase. The scheme is built upon a single-authority attribute-based encryption scheme presented earlier by Sahai and Waters. Chase's construction uses a trusted central authority that is inherently capable of decrypting arbitrary ciphertexts created within the system. We present a multi-authority attribute-based encryption scheme in which only the set of recipients defined by the encrypting party can decrypt a corresponding ciphertext. The central authority is viewed as ‘honest-but-curious’: on the one hand, it honestly follows the protocol, and on the other hand, it is curious to decrypt arbitrary ciphertexts thus violating the intent of the encrypting party. The proposed scheme, which like its predecessors relies on the Bilinear Diffie–Hellman assumption, has a complexity comparable to that of Chase's scheme. We prove that our scheme is secure in the selective ID model and can tolerate an honest-but-curious central authority.

Fully CCA2 secure identity-based broadcast encryption with black-box accountable authority

AbstractThe concept of accountable authority identity-based encryption was introduced as a convenient tool to reduce the amount of trust in authorities in identity-based encryption. In this model, if the Private Key Generator (PKG) maliciously re-distributes users’ decryption keys, it runs the risk of being caught and prosecuted. Libert and Vergnaud proposed an accountable authority identity-based broadcast encryption, which allows white-box tracing or weak black-box tracing. Their scheme was proved only secure in selective-ID model. We present a weak black-box accountable authority identity-based broadcast encryption scheme, which is proven as fully CCA2 secure against adaptive adversary with tight reduction. Our scheme achieves O(m) public keys size, O(m) private keys size, and O(1) ciphertext length, where m is the maximum number of receivers allowed in each broadcast.

Anonymous HIBE Scheme Secure Against Full Adaptive-ID Attacks

This paper constructs a new anonymous IBE scheme,and expands it to an anonymous HIBE scheme secure against full adaptive-ID attacks.These systems are built in composite order groups,which have four prime order subgroups.To achieve the anonymity,the authors blinded the public parameters and ciphertexts using the random elements of same subgroup.Moreover,the authors used the random elements of different subgroup to construct secret key for properly decryption.This idea is inspired by the related work,which proposed by Seo et al.in PKC 2009.To obtain full security,the authors applied the new techniques for dual system encryption recently introduced by Lewko and Waters in TCC 2010.Like the techniques used in their paper,the authors also used the semi-functional structures,and employed a hyhrid argument in the security by a sequence of games proof.And employed an additional dummy semi-functional structure to overcome the difficulty in the proof of the anonymity.The new anonymous HIBE scheme has short ciphertexts,and can be proven to be secure in the full-ID model using static assumptions.However,the previous schemes were only proven in the selective-ID model,under some non-static assumption which depended on the depth of the hierarchy.

Secure and Efficient IBE-PKE Proxy Re-Encryption

In proxy re-encryption schemes, a semi-trusted entity called a proxy can convert a ciphertext encrypted for Alice into a new ciphertext for Bob without seeing the underlying plaintext. Several proxy re-encryption schemes have been proposed, however, only two schemes which enables the conversion of IBE ciphertexts to PKE ciphertexts has been proposed. One of schemes has some drawbacks such that the size of the re-encrypted ciphertext increases and Bob must be aware of existence of the proxy, which means Bob cannot decrypt a re-encrypted ciphertext with same PKE decryption algorithm. The other one achieves security under Selective-ID model. We propose a new, efficient scheme that enables the conversion of IBE ciphertexts to PKE ciphertexts, and prove full-ID CPA security in the standard model. In our scheme, the size of the re-encrypted ciphertext is optimal and Bob should not aware of existence of the proxy. As far as we know, this is the first IBE-PKE type scheme that holds the above properties.

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.

A new threshold signature scheme based on fuzzy biometric identity

The focus of this paper is to present the first threshold signature scheme based on biometric identity, which is acquired from a recently proposed fuzzy identities-based encryption scheme. An important feature of this scheme, which is different from other previous ID-based threshold signature schemes, is that it can be applied to situations using not only average personal attributes in social contact but also people’s noisy biometric inputs as identities. The security of our scheme in the selective-ID model reduces the limit in the hardness of the Decisional BDH Assumption.

Chosen ciphertext secure fuzzy identity based encryption without ROM

Two new constructions of chosen-ciphertext secure fuzzy identity-based encryption (fuzzy-IBE) schemes without random oracle are proposed. The first scheme combines the modification of chosen-plaintext secure Sahai and Waters’ “large universe” construction and authenticated symmetric encryption, and uses consistency checking to handle with ill-formed ciphertexts to achieve chosen-ciphertext security in the selective ID model. The second scheme improves the efficiency of first scheme by eliminating consistency checking. This improved scheme is more efficient than existing chosen-ciphertext secure fuzzy-IBE scheme in the standard model.

Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions

Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions