International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 4 Issue: 5 204 - 206

___________________________________________________________________________________________________
Sharing of Data Using Key Aggregation and Searchable Encryption

V. Vignesh Kumar Dr. Sunanda Dixit Nadia Saba

Dept.Information Science and Engg
Dayananda Sagar College of
Engineering,
Bangalore, India.
Email: vignesh1431995@gmail.com
Dept.of Information Science and Engg.
Dayananda Sagar College of
Engineering,
Bangalore, India.
Email: sunanda.bms@gmail.com
Dept.Information Science and Engg
Dayananda Sagar College of
Engineering,
Bangalore, India.
Email: nadiasaba38@gmail.com

Priyanka Surana Viyani Sushmitha M J

Dept.of Information Science and Engg. Dept.Information Science and Engg
Dayananda Sagar College of Engineering, Dayananda Sagar College of Engineering,
Bangalore, India. Bangalore, India.
Email: priyankasurana94@gmail.com Email: chummi.viyani@gmail.com

Abstract - Sharing data with different users is an important functionality of the cloud. However, while enjoying the convenience provided by the
cloud storage, users main concern is regarding the data leakage present in cloud. A promising approach to prevent this is encryption of data
before uploading onto cloud. The desire to selectively and securely share documents with any group of users demands different documents to
have different encryption keys. This necessitates the distribution of a large number of keys to users for both encryption and search, those users
will have to securely store these keys, and submit an equally large number of keyword trapdoors to the cloud in order to perform search. In this
paper, we resolve this problem by extending the concept of Key Aggregate Searchable Encryption (KASE) scheme which employs a single
aggregate key and a single trapdoor. Here, the data owner only needs to distribute a single key to a user for sharing a large number of documents,
and the user only needs to submit a single trapdoor to the cloud for querying the documents. Also, we provide a functionality of selection of
keyword based on their rank by the Data owner in such a way that the selected keywords describe the file. Thus, this scheme makes the
management of the keys efficient and also makes the sharing of documents over the cloud more secure.

Keywords- Key Aggregation, Searchable Encryption, Secure Cloud

__________________________________________________*****_________________________________________________

I. INTRODUCTION
Clouds are large pool of easily usable and accessible
virtualized resources which can be dynamically reconfigured
to provide optimal resource utilization. As per the definition
provided by National Institute for Standards and Technology
(NIST) Cloud Computing is a model for enabling
convenient, on-demand network access to a shared pool of
configurable computing resources (e.g., networks, servers,
storage, applications, and services) that can be rapidly
provisioned and released with minimal management effort or
service provider interaction. Data sharing is one of the
important functionality in cloud storage. One among the
research challenges is the data leakage present in cloud. An
approach to deal with this challenge is, the data owner should
encrypt all the data before uploading them onto cloud, so that
the encrypted data may be retrieved and decrypted by only
those who have the decryption keys. Such a cloud storage is
often called the cryptographic cloud storage [1]. However, the
encryption of data makes it challenging for users to search and
then selectively retrieve only the data containing given
keywords. A common solution is to employ a searchable
encryption (SE) scheme in which the data owner is required to
encrypt potential keywords and upload them to the cloud
together with encrypted data [6]. For retrieving data which
matches a keyword, the user will send the corresponding
keyword trapdoor to the cloud for performing search over the
encrypted data [6]. Since each encrypted file is assigned a key,
implies that the number of keys that need to be distributed to
IJRITCC | May 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
users, both for them to search over the encrypted files and to
decrypt the files, will be proportional to the number of such
files. Such large number of keys must not only be distributed
to users via secure channels, but also be securely stored and
managed by the users on their devices. In order to handle both
these problems we have used a scheme where the need for
sharing multiple keys with the user is eliminated by
aggregating all the keys into one single aggregate key and also
made search more efficient and easy by hashing the keywords.
II. RELATED WORKS
Maintenance and security of data is one of the important
vision of any organization. At the same time, selectively
sharing the data has been a problem for quite some time now.
With the advancement of Cloud Technology and adoption of
the same by various organizations has made their operations
easy but, the security and privacy of Cloud still remains as one
among important issues to be addressed. Sharing of data
selectively and minimizing the number of keys required to
provide access to the documents has been of interest to many.
Various solutions have been proposed and many analysis has
been made over the reasons for security concern in cloud.
Reza Curtmola et al. addresses the problem of searchable
symmetric encryption by first reviewing the existing notions
of security and then proposed a new and stronger security
mechanism [1]. E. Seetha et al. proposes a new cryptographic
method for secure Proof of Ownership (PoW), based on the
joint use of convergent encryption, for providing dynamic
sharing between users and ensuring efficient data
204
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 4 Issue: 5
___________________________________________________________________________________________________
deduplication [2]. Cheng-Kang Chu et al. discusses how to
allow decryption of multiple cipher texts, without increasing
its size and have introduced a special type of public key
encryption as it is more secure compared to single key
encryption, and termed it as key aggregate cryptosystem
(KAC) [3]. R.A. Popa et al. constructs a searchable encryption
scheme that enables keyword search over data encrypted with
different keys [4]. Zheli Liu et al. proposed in their paper
multi-user searchable encryption using hybrid cloud with
coarse-grained access control [5]. Baojiang Cui et al. has
proposed a secure way to share data selectively by using a
scheme called Key Aggregate Searchable Encryption [6]. J.W.
Li et al. tackles the challenge of searchable encryption not
effectively supporting fine- grained access control, by
introducing a private cloud as an access interface between
users and public cloud under a hybrid architecture [7]. Peter
Van Liesdonk et al. proposes a novel symmetric searchable
encryption scheme that offers searching at a constant time in
the number if unique keywords stored in the server [8]. Sen
Kamara et al. proposes a SSE( Searchable Symmetric
Encryption) scheme to satisfy the following properties:
sublinear search time, security against adaptive chosen-
keyword attacks, compact indexes and the ability to add and
delete files efficiently [9]. Dan Boneh et al. addresses the
problem of searching on data that is encrypted using a public
key system and hence proposes a solution for it [10]. Changyu
Dong et al. proposes and encryption scheme where each
authorized user in the system has his own keys to encrypt and
decrypt data [11]. C. Wang et al. utilize and uniquely combine
the public key based homomorphic authenticator with random
masking to achieve the privacy preserving public cloud data
auditing system which meets the requirements [12].
III. PROPOSED WORKS
The concept of Key Aggregate Searchable Encryption is based
on the ideas presented in Multi-Key Searchable Encryption
scheme and Key-Aggregate Data Sharing scheme. In this
scheme, instead of having different encryption keys for
different documents, we create a single aggregate key with
which the user can access multiple documents and is required
to submit only a single trapdoor to the cloud for querying these
documents to perform search. In the used system, the data
owner first logs in and creates the user profile for all those
users who have access to the documents uploaded by him/her.
During the creation of the user profiles, each user is assigned a
particular grade by the data owner. Each grade is assigned a
grade key using a random function. The data owner then
selects the documents to be shared and provides access control
for the files to the user. The files to be uploaded onto the cloud
are encrypted using RSA algorithm. A list of keywords are
extracted from the files and ranked on the basis of their
frequency in the file and is being displayed to the data owner.
The data owner then selects five key words on the basis of
their frequency in such a way that they describe the file
completely. These keywords are then converted into hash
codes and stored as indexes to make the search operation more
efficient. MD5 algorithm is used for hashing the keywords.
The aggregate key which is a combination of the data owners
public key and the grade key is generated. This aggregate key
is encrypted for further security using DES algorithm and then
sent to the user along with the username and password as
IJRITCC | May 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
204 - 206
registered by the data owner through an e-mail. The data user
receives the e-mail and logs in into the system by providing
the username and password received. The data user then
submits the received aggregate key. Correct aggregate key
submitted would ensure that the user is authorized to access
the documents. The data user then submits the keyword of
his/her interest to carry out the search operation through all the
documents that can be accessed by them. This operation
retrieves all files containing the keyword mentioned by the
data user in decreasing order of their keyword ranking. The
data user can then select the file of his/her interest from the list
of decrypted files available and download it.
The implementation requirements of the KASE scheme
includes-
A. Eclipse, which is a universal platform for integrating
development tools, acts as a common base for web
based projects and permits unrestricted content types.
B. SQLYOG, which is a GUI tool for the RDBMS
MySQL.
C. Apache Tomcat Server (compatible version).
IV. RESULT
The implementation of the proposed idea requires
perfect handling of required tools and some basic Java and
J2EE programming knowledge. It takes around three months
for the implementation of this idea. We, at the end of two
months were successfully able to complete a good percentage
of the total work. The work done so far consists of:
A. Data Owner(Admin for this scenario) logging in
B. Data Owner creates user accounts and assigns grades
C. Key generation for encryption of files.
D. Grade key generation for each of the grades.
E. The uploading of file( which also includes key word
extraction and ranking)
F. The following screenshots would give a glimpse
about the work completed so far.
Figure 1:Data Owner Logs in
Figure 2: User Account Creation
Figure 1, shows the home page where the user logs in which is
the primary activity to be accomplished for the entire process
to start.
205
International Journal on Recent and Innovation Trends in Computing and Communication
Volume: 4 Issue: 5
___________________________________________________________________________________________________
Figure 2, has the User details entry page, filling in the
necessary details subsequently will lead to grade assignment
page for the user. Once a grade is assigned to a user the user
will be able to receive the documents which are uploaded by
the data owner for that particular grade.
Figure 3: User Data retrieved from Database
Figure 3, show the details of the user. These are retrieved from group data sharing.
the database. The data owner on completion of the task of
User account creation all of the details get inserted into the
database for future use.
Figure 4: Key Generation
Figure 4, displays a message which indicates the generation of
the Key which will be used for encrypting the uploaded files.
The remaining work would consist of:
A. Generation of aggregate key
B. Sending of the aggregate key to Users of Different
grades
C. Performing a single- and multi-keyword search over
the documents by Users.
Moving ahead with the same momentum, the remaining work
will also be completed soon.
The remaining work will be articulated in the next paper along
with the problems being faced while development of this
project, the pros and cons of the project.
V. LIMITATIONS
Although the KASE scheme achieved in providing an efficient
mechanism for large number of keys management. With its
reduction to a single aggregate key for sharing any number of
documents and making possible only a single trapdoor
submission by the user to the cloud for its retrieval operation,
its limitation in case of multiple owners gives rise to a future
work. When user submits the keyword, he at times might not
be able to retrieve the file of his interest as the selected
keywords might not cover all possible ones. At the same time
the application of KASE scheme in the case of federal clouds
IJRITCC | May 2016, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
ISSN: 2321-8169
204 - 206
also requires future work that would provide a solution for
KASE in the case of federal clouds.
VI. CONCLUSIONS
This paper aimed at flexible data sharing of any
group of selected documents with any group of users with
efficient management of large number of encryption keys. In
the extended KASE scheme this goal is been achieved by
versatile cryptographic techniques and searchable encryption
method, which enables the data owner for the distribution of
single aggregate key instead of group of keys to a user for
sharing any number of files and at the user end submission of
single aggregate trapdoor to the cloud for performing keyword
search over any number of shared files. Thus reducing the
large number of keys to a single aggregate key enhances the
key management requirements. Considering the importance of
data sharing functionality in cloud storage, the extended
KASE scheme thus provides secure, efficient and flexible
REFERENCES
[1] Reza Curtmola, Juan Garay, Seny Kamara, Rafail Ostrovsky.
Searchable symmetric encryption: improved denitions and
efcient constructions, In: Proceedings of the 13th ACM
conference on Com- puter and Communications Security, ACM
Press, pp. 79-88, 2006.
[2] E. Seetha and D. Ponniselvi A Dynamic Authentication for
Client Side Deduplication in Cloud Storage Environment,
International Journal Of Innovative Research In Computer And
Communication Engineering, Vol:3, Issue: 8, August 2015.
[3] Cheng-Kang Chu, Sherman S. M. Chow, Wen -GueyTzeng,
Jianying Zhou and Robert H.Deng Key-Aggregate
Cryptosystem for Scalable Data Sharing in Cloud Storage,
IEEE Transactions on Parallel and Distributed Systems, 2014,
25(2): 468-477.
[4] R. A. Popa ,N. Zeldovich. Multi-key searchable encryption.
Cryptology e-Print Archive, Report 2013/508, 2013.
[5] Z. Liu, Z. Wang, X. Cheng, Multi-user Searchable Encryption
with Coarser-Grained Access Control in Hybrid Cloud, Fourth
International Conference on Emerging Intelligent Data and Web
Technologies (EIDWT), IEEE, pp. 249-255, 2013.
[6] Baojiang Cui, Zheli Liu* and Lingyu Wang Key-Aggregate
Searchable Encryption (KASE) for Group Data Sharing via
Cloud Storage, IEEE Transaction On Computers Vol:6, No:1,
January 2015.
[7] Jingwei Li, Jin Li, Xiaofeng Chen, Chunfu Jia and Zheli Liu
Efcient Keyword Search over Encrypted Data with Fine-
Grained Access Control in Hybrid Cloud, In: Network and
System Security 2012, LNCS, pp. 490502, 2012.
[8] Peter Van Liesdonk, Saeed Sedghi, Jeroen Doumen, Willem
Jonker Computationally efcient searchable symmetric
encryption, Secure Data Management, pp. 87-100, 2010.
[9] Sen Kamara, Charalampos Papamanthou, Tom Roeder.
Dynamic searchable symmetric encryption, Proceedings of the
2012 ACM conference on Computer and communications
security (CCS), ACM, pp. 965976, 2012.
[10] Dan Boneh, Giovanni Di Creseenzo, Rafail Ostrovsky,
Giuseppe Persiano. Public Key Encryption with Keyword
Search, EUROCRYPT 2004, pp. 506C522, 2004.
[11] Changyu Dong, Giovanni Russello, Naranker Dulay. Shared
and searchable encrypted data for untrusted servers,Journal of
Computer Security, pp. 367-397, 2011.
[12] C. Wang, Qian Wang, Kui Ren, and Wenjing Lou, Privacy-
Preserving Public Auditing for Data Storage Security in Cloud
Computing, Proc. IEEE INFOCOM, pp. 525-533, 2010.
206