A Review on Various Attribute Based Data Sharing Techniques with Encryption

(1)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459,ISO 9001:2008 Certified Journal, Volume 4, Issue 9, September 2014)

832

A Review on Various Attribute Based Data Sharing

Techniques with Encryption

Neeru Yadav

1

_{, Prof. Anurag Jain}

2 1_{RITS College, Bhopal, M.P., India}

2_{HOD, CES Dept. RITS College,l Bhopal, M.P., India}

Abstract— Recently when huge amount of documents and web contents are available, so security of data is somewhat difficult. Since most of the systems are based on the distributed network so the sharing of data and more important the security of data on such systems are important.It is a trend to store data in to third party servers for either sharing or cost effective storage. But this private data should need proper protection. In this paper we are presenting various security enhanced method and secure data sharing techniques.

Keywords—Security, Data Sharing, Attibute Based Encryption, Data Efficiency.

I. INTRODUCTION

Protecting networks from computer security attacks is a vital apprehension of computer security. Since the large amount of text is usually uploaded into many sites and thus it need to be secured especially when sensitive information is uploaded. Protecting networks from computer security attacks is a vital apprehension of computer security.

Currently network and computing are more developed technologies. These enable many users to easily share and update their sensitive information with others via online storage. Peoples are usually sharing their life events with friends and family by uploading photographs and other sensitive information in to social networking sites like Facebook, Orkut, twitter etc. As people enjoy the advantages of these new technologies & services, their main concerns about data security and efficient access control also take place. Inappropriate access of the data by the storage server or unauthorized access by outside users could be potential threats to their data [1].Since the data is private and needs to be made secure from un-authorized users in the network. Also the data security is made possible by providing various access policies in the network based n the attributes or identity of the users [4].

It is essential to protected data that is uploaded in to various social sites or stored online. Attribute-based encryption (ABE) is a promising cryptographic method that achieves a fine-grained data access control [5], [6], [7], [8]. It gives a way of defining access policies based on various attributes of the requested user, scenario, or the data object.

Particularly, cipher text policy attribute-based encryption (CP-ABE) enables an encryptor ( who encrypt data) to define the attribute set over a universe of attributes that a decryptor (that decrypt data)requires to possess in order to decrypt the ciphertext, and enforce it on the contents [5]. Thus, each user with a different set of attributes is permitted to decrypt different pieces of data per the security policy.

Although there are various techniques implemented for the encryption of the data in the network, one such technique is IBE. Identity based encryption is a technique which is based on the encryption of the data using identity of users. The idea is to generate a key pairs which is based on the identity of the users and the encryption and decryption of the data is possible using these identities. Fuzzy IBE is a technique which is more efficient as compared to the existing IBE, since fuzzy IBE provides authentication using biometric technique and encryption based on the biometric identity of the user[5].

In Attribute-Based Encryption an encryptor will associate encrypted data with a set of attributes. An authority will concern users diverse private keys, where a user’s private key is associated with an access structure over attributes and reflects the access policy ascribed to the user [8]. In an ABE system, the various keys are generated based on the attribute of the users and also the respective cipher text.Such type of techniques needs to be more accurate and efficient and error free as compared to other identity based encryptions and is also useful for large systems [6].

Ciphertext-policy attribute based encryption (CP-ABE) [6] is a public-key cryptography primitive that is used to resolve the exact issue of fine-grained access control on shared data in one-to-many communications. In CP-ABE, each user is assigned a set of attributes which are embedded into the user’s secret key. A public key component is defined for each user attribute. When encrypting the message, the encryptor chooses an access structure on attributes, and encrypts the message under the access structure via encrypting with the corresponding public key components [4].

(2)

International Journal of Emerging Technology and Advanced Engineering

[image:2.595.56.297.173.337.2]

833 This system contains Key generation center, Data-storing center, Data owner, and user.

Figure 1: Data Sharing System [1].

Here the Data Owner can send the data to the user by providing the attributes. On each bloc of the data an attribute is generated and encrypted data using these attributes to the data storing center. The Key generation center is used for the generation of keys with the attributes generation from the data owner. It is an authority which is responsible for the generation of keys from the various public parameters [1].

Since both of the key managers, the Key Generation Center (KGC) and the datastoringcenter are semi-trusted, it should be preventedfrom accessing plaintext of the data to be shared; meanwhile,they should be still capable to concern secret keys tousers. Here 2PC communication between the key generation center and the Data storing center is provided. For improving the security we must consider some parameters that are essential like Data confidentiality, Collusion resistance and Backward and forward secrecy. Unauthorized users who do not have enough attribute satisfying the access policy should be prevented from accessing the plaintext of the data. Collusion resistance is one of the most important security property required in ABE systems [5], [6], [7]. If multiple users get together, they may be capable to decrypt a ciphertext by combining their attributes even if each of the users cannot decrypt the ciphertext alone. In the context of attribute-based encryption, backward secrecy signifies that some user who comes to hold an attribute (that satisfies the access policy) should be prevented from accessing the plaintext of the previous data distributed before he holds the attribute [1].

II. BACKGROUND

Identity (ID)-based encryption, or IBE for undersized, is an exciting unconventional to public-key encryption thateliminates the need for a Public Key Infrastructure (PKI) that makes publicly available the mapping among identities, public keys, and validity of the latter. The senders via an IBE do not requirelooking up the public keys and the corresponding certificates of the receivers, because the identities (e.g. emails or IP addresses) together with common public parameters are sufficient for encryption. The private keys of the users are concerned by a trusted third party called the private key generator (PKG). Although the techniques implemented for the encryption of data using public key based encryption provides security from various attacks in the network but is not so efficient when the data is complicated. This setting where the data-storingcenter knows the revocation list does not violate the securityrequirements, because it is only allowed to re-encrypt theciphertexts and can by no means obtain any informationabout the attribute keys of users.

III. RELATED WORK

Hur, Junbeom proposed Improving security and efficiency in attribute-based data sharing. They offered a novel CP-ABE scheme for a secure data sharing system, which features the following achievements. Here in this paper various problems such as Escrow based problem and proxy encryption based problems are resolved using attribute based encryption techniuqe [1].

Second, the immediate user revocation can be done via the proxy encryption mechanism together with the CP-ABE algorithm. Attribute group keys are selectively distributed to the valid users in each attribute group, which then are used to re-encrypt the ciphertext encrypted under the CPABE algorithm. The immediate user revocation enhances the backward/forward secrecy of the data on any membership alterations. Additionally, as the user revocation can be done on each attribute level rather than on system level extra fine-grained user access control can be achievable. Even if a user is retracted from several attribute groups, it would still be capable to decrypt the shared data as long as the other attributes that he holds satisfy the access policy of the ciphertext [1].

(3)

International Journal of Emerging Technology and Advanced Engineering

834 This scheme delegates most laborious tasks of membership management and user revocation to the data storing center while the KGC is responsible for the attribute key management as in the previous CP-ABE schemes without leaking any confidential information to the other parties. Consequently, this scheme is the most suitable for the data sharing scenarios where users encrypt the data only once and upload it to the data-storing centers, and disappear the rest of the odd jobs to the data-storing centers such as re-encryption and revocation [1].

This scheme features a keyissuing mechanism that removes key escrow during thekey generation. The user secret keys are produced througha secure two-party computation such that any curious keygeneration center or data-storing center cannot derive theprivate keys individually. Thus, this schemeenhances data privacy and confidentiality in the datasharing system against any system managers as well asadversarial outsiders without corresponding (enough) credentials. This scheme can do an immediateuser revocation on each attribute set while taking fulladvantage of the scalable access control provided by theciphertext policy attribute-based encryption. Therefore, this scheme achieves more secure and fine-graineddata access control in the data sharing system. According to result obtained this scheme is efficient andscalable to securely manage user data in the data sharingsystem [1].

[image:3.595.56.280.576.697.2]

Yu, Shucheng et al [4] suggested Attribute based data sharing with attribute revocation. They explore a feasible solution based on novel cryptographic methods. Fig.2shows semi-trustable proxy serversthat are always available for providing various types of content services. The scenario provided here in this technique is based on the semi-trusted servers where the data are shared among various users and the authentication is provided using the attribute policies provided to each user in the network[4].

Figure 2: Application Scenario of Data Sharing [4].

This scheme is proposed to resolve the issue of attribute revocation for applications such as data sharing as shown in Fig.2. Whenever an attribute revocation event occurs, the authority redefines the master key components for involved attributes.

Corresponding public key components are then updated accordingly. From then on, data will be encrypted with the new public key. Apparently, user secret keys should be updated accordingly for data access. For this purpose, the authority generates proxy re-key’s for updated master key components. With this proxy re-key’s, the proxy servers are able to securely update user secret keys to the latest version for all but the user for revocation1. This removes the involved attributes from that user’s attribute set since their corresponding secret key components no longer comply with the new master key [4].

In this scheme, the authority generates proxy re-key’s whenever an attribute revocation event occurs. Proxy key are then transmitted to proxy servers, who will re-encrypt existing ciphertexts stored on them and update user secret key components if necessary. They achieved this by uniquely combining the proxy re-encryption technique with CP-ABE and enabled the authority to delegate most laborious tasks to proxy servers. Our proposed scheme is provably secure against chosen ciphertext attacks. In addition, they also showed the applicability of our method to the KP-ABE scheme [4].

A. Sahai and B. Waters proposed Fuzzy Identity-Based Encryption. They present two constructions of Fuzzy IBE schemes. This construction can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity. This IBE schemes are both error-tolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. They prove the security of this scheme under the Selective-ID security model. They first introduced attribute based encryption (ABE) for encrypted access control. In an ABEsystem, both the user secret key and the ciphertext are associated with a set of attributes. Only if at least a thresholdnumber of attributes overlap between the ciphertext and hissecret key, can the user decrypt the ciphertext [5].

(4)

International Journal of Emerging Technology and Advanced Engineering

835 Bethencourt et al [7] suggested Ciphertext-Policy Attribute Based Encryption. They provide the first construction of a ciphertext-policy attribute-based encryption (CP-ABE) to address this problem, and give the first construction of such a scheme. In this system, a user’s private key will be associated with an arbitrary number of attributes expressed as strings. On the other hand, when a party encrypts a message in this system, they specify an associated access structure over attributes. A user will only be able to decrypt a ciphertext if that user’s attributes pass through the ciphertexts access structure. At a mathematical level, access structures in our system are described by a monotonic “access tree”, where nodes of the access structure are composed of threshold gates and the leaves describe attributes. They created a system for Ciphertext-Policy Attribute Based Encryption. Our system allows for a new type of encrypted access control where user’s private keys are specified by a set of attributes and a party encrypting data can specify a policy over these attributes specifying which users are able to decrypt. This system allows policies to be expressed as any monotonic tree access structure and is resistant to collusion attacks in which an attacker might obtain multiple private keys. Finally, they provided an implementation of this system, which included several optimization techniques [7].

R. Ostrovsky et al [8] proposed Attribute-Based Encryption with Non-Monotonic Access Structures. They present a new Attribute-Based Encryption scheme whereprivate keys can represent any access formula over attributes, including non-monotone ones. In particular, our construction can handle any access structure that can be represented by a Boolean formula involving AND, OR, NOT, and threshold operations. At a high level, the technical novelty in our work lies in finding a way to (implicitly) make a share “available” to the decryptor only if a given attribute is not present among the attributes of the ciphertext. In designing this construction several challenges arise from adapting these negation techniques while preserving the collusion resistance features that are necessary for Attribute-Based Encryption systems. They achieved this through a novel application of revocation methods into existing ABE schemes. In addition, the performance of our scheme compares very favorably to that of existing, less-expressive ABE systems. An important goal in ABE systems is to create even more expressive systems [8].

Boldyreva et al [9] proposed Identity-based encryption with efficient revocation. They propose a new way to mitigate the limitation of IBE with regard to revocation, and improve efficiency of the previous solution. They want to remove interaction form the process of key update, as keeping the PKG online can be a bottleneck, especially if the number of users is very large [9].

Chase, Melissa, and Sherman SM Chow proposed Improving privacy and security in multi-authority attribute-based encryption. They present a multi-authority ABE with user privacy and without the trusted authority. These requirements are non-trivial to satisfy, due in both cases to the collusion resistance requirement of ABE. They also present an anonymous key issuing protocol which allows multi-authority ABE with enhanced user privacy – 1) they allow the users to communicate with AAs via pseudonyms instead of having to provide their GIDs in the clear, and 2) they prevent the AAs from pooling their data and linking multiple attribute sets belonging to the same user. It is unrealistic to assume there is a single authority which can monitor every single attribute of all users. Multi-authority attribute-based encryption enables a more realistic deployment of attribute-based access control, such that different authorities are responsible for issuing different sets of attributes. The original solution by Chase employs a trusted central authority and the use of a global identifier for each user, which means the confidentiality, depends critically on the security of the central authority and the user-privacy depends on the honest behavior of the attribute-authorities. They propose an attribute-based encryption scheme without the trusted authority, and an anonymous key issuing protocol which works for both existing schemes and for our new construction. We hope that our work gives a more practice oriented attribute based encryption system [10].

(5)

International Journal of Emerging Technology and Advanced Engineering

836 They proposed a new ABBE scheme which allows performing encryptions based on different access policies expressed either in CNF or DNF form along with efficient individual receiver revocation ability. Since these two forms is the most general way of expressing Boolean access policies, they also relying on it to achieve the generality that other ABBE scheme do not necessarily provide. The security of our scheme is proven in the generic model of groups with pairing [11].

Ibraimi et al [13] suggested Mediated ciphertext-policy attribute-based encryption and its application. They propose a new scheme for attribute revocation in CP-ABE called mediated Ciphertext-Policy Attribute-Based Encryption (mCP-ABE). In this scheme the secret key is divided into two shares, one share for the mediator and the other for the user. To decrypt the data, the user must contact the mediator to receive a decryption token. The mediator keeps an attribute revocation list (ARL) and refuses to issue the decryption token for revoked attributes. They also define a security model for the proposed scheme which formalizes the security attacks and provide a security proof under the generic group model.

The mCP-ABE scheme consists of three entities: a trusted authority (TA), a mediator and users. The TA uses the master key to generate a user secret key, which is then divided into two shares such that the first share of the user secret key is sent to the mediator and the second share of the user secret key is sent to a user. The mediator has to stay online all the time, while the TA can be put offline once it has generated secret keys for all users [13]. Di Vimercati et al [14] proposed Over-encryption: management of access control evolution on outsourced data. They propose a solution that removes these issues, facilitating the successful development of outsourcing data in emerging scenarios. in scenarios involving potentially huge sets of resources of considerable size, re-encryption and re-transmission by the owner may not be acceptable. The advantage compared with a solution requiring re-sending a novel encrypted version of the resource is typically huge and arbitrarily large. An important strength of this solution is that it does not substitute the current proposals, rather it complements them, enabling them to support encryption in a selective form and easily enforce dynamic policy changes [14].

IV.COMPARISION

S. No.

Paper

Author

Technique

Used

Advantages

Issues

1 Improving Security and

Efficiency in Attribute-Based Data Sharing

JunbeomHur Here CP-ABE

attribute based data sharing technique

is used which solves key escrow problem and proxy

encryption.

It provides an efficient technique of attribute based

encryption which prevents

from various attacks.

Cost ineffective and chances of

security is less.

2 A Survey on Attribute Based Encryption Scheme in Cloud

Computing

Minu George, Dr. C.Suresh Gnanadhas, Saranya.K

Here in this paper presented a survey on various attribute based encryption techniques.

The paper contains various

attribute based encryption techniques to be used in cloud

computing such as ABE, CP-ABE, and KP-ABE.

Computational cost and time as well as user revocation

3 Attribute-Based Encryption for Circuits

from Multilinear Maps

Sanjam Garg Craig Gentry Shai Halevi

Amit Sahai Brent Waters Here in this paper proposed a new technique for the attribute based encryption using the concept of

Here the circuits are used for the generation of attributes through which

. The

(6)

International Journal of Emerging Technology and Advanced Engineering

837

Multilinear Maps. the encryption is done. The construction is done for using multilinear maps.

Key-Policy and Ciphertext- Policy and hence the performance is better.

4 Fuzzy Identity-Based Encryption

AmitSahai, Brent Waters A Fuzzy IBE scheme can be applied to enable

encryption using biometric inputs as identities;

the error-tolerance property of a Fuzzy

IBE scheme is precisely what allows for the use

of biometric identities, which

inherently will have some noise each time they are

sampled.

It allows for error-tolerance

between the identity of a private key and

the public key used to encrypt

a ciphertext.

An open problem is to

build other Fuzzy-IBE schemes that use different

distance metrics between identities.

5 Attribute-Based Encryption for

Fine-Grained Access Control

of Encrypted Data

VipulGoyalOmkantPandey,AmitSahai,

Brent Waters cryptosystem for a new ¯ne-grained

sharing of encrypted data that we call Key-Policy Attribute-Based Encryption

(KP-ABE). In this cryptosystem,

ciphertexts are labeled with sets of

attributes and private keys are

associated with access structures that control which

ciphertexts a user is able to decrypt.

supports delegation of

private keys which subsumes Hierarchical Identity-Based

Encryption (HIBE).

Less secure and prevention frpm various

attacks.

6 Attribute Based Data Sharing with Attribute

Revocation

Shucheng Yu, Cong Wang, KuiRen Here CP-ABE based attribute policy is described along with the fine grained control of

encryption

The property of proposed scheme is that

it places minimal load

on authority upon attribute

Another direction for

future work is to allow proxy

servers to update user

(7)

International Journal of Emerging Technology and Advanced Engineering

838

revocation

events. disclosing without user attribute

information. 7 Overencryption:

Management of Access Control Evolution on

Outsourced Data

Sabrina De Capitani di Vimercati Our proposal is based on the application of

selective encryption as a means to

enforce authorizations.

Two layers of encryption are imposed on data: the inner layer is

imposed by the owner for providing initial protection, the

outer layer is imposed by the

server to reflect policy modifications.

It protect the resource confidentiality

from both unauthorized users as well as

“honest-but-curious”

servers.

a huge number of resources

of considerable size and that have to be distributed in a selective

way to a variety of

users.

V. CONCLUSION

Today’s computing technologies have attracted more and more people to store their private data on third-party servers either for ease of sharing or for cost saving. Data confidentiality on the shared data against outside users who have not enough attributes can be trivially guaranteed. There is a trend for sensitive user data to be stored by third parties on the Internet. The survey regarding various attribute based key encryptions are implemented some of them provides more security but other may contains some of the limitations. For this various schemes were proposed by numerous researchers. In this paper we present some of them.

Acknowledgment

I would like to thank HOD Computer Science Department Prof. Anurag Jain, for accepting me to work under his valuable guidance. He closely supervises the work over the past few months and advised many innovative ideas, helpful suggestion, valuable advice and support.

REFERENCES

[1] Hur, Junbeom. "Improving security and efficiency in attribute-based data sharing", IEEE Transactions On Knowledge And Data Engineering, Vol. 25, No. 10, pp. 2271 – 2282, October 2013. [2] Minu George1, Dr. C.Suresh Gnanadhas2, Saranya.K3,” A

Survey on Attribute Based Encryption Scheme in Cloud Computing”, IJARCCE November 2013.

[3] Sanjam Garg Craig Gentry Shai Halevi Amit Sahai Brent Waters,” Attribute-Based Encryption for Circuits from Multilinear Maps”, 2012.

[4] Yu, Shucheng, Cong Wang, Kui Ren, and Wenjing Lou. "Attribute based data sharing with attribute revocation." In Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, pp. 261-270. ACM, 2010.

[5] A. Sahai and B. Waters, “Fuzzy Identity-Based Encryption,” Proceedings International Conference on Theory and Applications of Cryptographic Techniques (Eurocrypt ’05), pp. 457-473, 2005. [6] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-BasedEncryption for Fine-Grained Access Control of Encrypted Data,”Proceedings of ACM Conference on Computer and Communication Security, pp. 89-98, 2006.

[7] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-PolicyAttribute Based Encryption,” Proceedings IEEE Symposium Security andPrivacy, pp. 321-334, 2007.

[8] R. Ostrovsky, A. Sahai, and B. Waters, “Attribute-Based Encryptionwith Non-Monotonic Access Structures,” Proceedings ACM Conference Computer and Comm. Security, pp. 195-203, 2007.

[9] Boldyreva, Alexandra, Vipul Goyal, and Virendra Kumar. "Identity-based encryption with efficient revocation." In Proceedings of the 15th ACM conference on Computer and communications security, pp. 417-426. ACM, 2008.

[10] Chase, Melissa, and Sherman SM Chow. "Improving privacy and security in multi-authority attribute-based encryption." In Proceedings of the 16th ACM conference on Computer and communications security, pp. 121-130. ACM, 2009.

(8)

International Journal of Emerging Technology and Advanced Engineering

839 [12] Boneh, Dan, Craig Gentry, and Brent Waters. "Collusion resistant

broadcast encryption with short ciphertexts and private keys." In Advances in Cryptology–CRYPTO 2005, pp. 258-275. Springer Berlin Heidelberg, 2005.

[13] Ibraimi, Luan, Milan Petkovic, Svetla Nikova, Pieter Hartel, and Willem Jonker. "Mediated ciphertext-policy attribute-based encryption and its application." In Information Security Applications, pp. 309-323. Springer Berlin Heidelberg, 2009.