Page 1 of 5

Journal for Studies in Management and Planning

Available at

http://edupediapublications.org/journals/index.php/JSMaP/

e-ISSN: 2395-0463

Volume 02 Issue 11

November 2016

Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 50

Key- Aggregate Searchable Encryption (KASE) For Group Data

Sharing Via Cloud Storage

Vankattula gopi chand Adavelli Ramesh vanam gopinath

Mtech (CSE) Asso. Prof & HOD(CSE) Assoc. Prof. & Mtech(CSE)

SLC’s College of Engineering and Technology, hyd

Abstract- The capability of selectively sharing

encrypted data with different users via public cloud

storage may greatly ease security concerns over

inadvertent data leaks in the cloud. A key challenge to

designing such encryption schemes lies in the efficient

management of encryption keys. The desired flexibility

of sharing any group of selected documents with any

group of users demands different encryption keys to be

used for different documents. However, this also

implies the necessity of securely distributing to users a

large number of keys for both encryption and search,

and those users will have to securely store the received

keys, and submit an equally large number of keyword

trapdoors to the cloud in order to perform search over

the shared data. The implied need for secure

communication, storage, and complexity clearly

renders the approach impractical. In this paper, we

address this practical problem, which is largely

neglected in the literature, by proposing the novel

concept of key aggregate searchable encryption

(KASE) and instantiating the concept through a

concrete KASE scheme, in which a 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 shared documents. The security analysis and

performance evaluation both confirm that our

proposed schemes are provably secure and practically

efficient.

Keywords- Searchable encryption, data sharing, cloud

storage, data privacy.

I. INTRODUCTION

With growing dependency on internet for globalization,

cost for owning IT Infrastructure, resources have

increased. Cloud computing is a new concept that

usually is an on demand leasing service for internet

applications and IT resources. According to NIST

definition, “Cloud computing is a model for enabling

ubiquitous, 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”.

Cloud computing reduces huge upfront investments and

recurring ongoing maintenance cost due to its principle

of “pay for what you use”. In cloud computing, the

resources can be in someone else’s premises or network

commonly known as providers. The resources can be

leased and are accessed remotely by cloud users or

cloud service buyers via internet or network. All request

received by the cloud servers are processed and the

output is sent back as normal process.

The cloud computing gives three sensitive states of

concern in operational context of cloud

 Sending of data to the cloud,

 Receiving of data from the cloud to client’s

computer,

 Storage of data in cloud server which client

may or may not own.

Cloud computing has several advantages but at the

same time it opens up risks on security issues. The

remote access could lead to security threats for

which Information System (IS) Audit can be helpful.

OBJECTIVE

First, a data owner only needs to distribute a single

Aggregate key (instead of a group of keys) to a user for

sharing any number of files. Second, the user only

needs to submit a single aggregate trapdoor (instead of

a group of Trapdoors) to the cloud for performing

keyword search over any numbers of shared files.

MODULE DESCRIPTION

Data Owner-In this module we executed by the data

owner to setup an account on an untrusted server. On

input a security level parameter and the number of

cipher text classes n (i.e., class index should be an

integer bounded by 1 and n), it outputs the public

system parameter param, which is omitted from the

input of the other algorithms for brevity.

Network Storage (Drop box)-With our solution, Alice

can simply send Bob a single aggregate key via a secure

e-mail. Bob can download the encrypted photos from

Alice’s Drop box space and then use this aggregate key

Page 2 of 5

Journal for Studies in Management and Planning

Available at

http://edupediapublications.org/journals/index.php/JSMaP/

e-ISSN: 2395-0463

Volume 02 Issue 11

November 2016

Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 51

to

decrypt these encrypted photos. In this Network Storage

is untrusted third party server or drop box.

Fig 1: Network Storage (drop box)

Encrypted Aggregate Key and Searchable

Encrypted key Transfer-The data owner

establishes the public system parameter via Setup

and generates a public/master-secret key pair via

Key Gen. Messages can be encrypted via Encrypt

by anyone who also decides what cipher text class

is associated with the plaintext message to be

encrypted. The data owner can use the master- secret to generate an aggregate decryption key for a

set of cipher text classes via Extract. The generated

keys can be passed to delegates securely (via secure

e-mails or secure devices) finally; any user with an

aggregate key can decrypt any cipher text provided

that the cipher text’s class is contained in the

aggregate key via Decrypt.

Fig 2: Encrypted Aggregate Key and Searchable Encrypted Key Transfer

Trapdoor generation-Trapdoor generation

algorithm is run by the user who has the aggregate

key to perform a search. It takes as input the

aggregate searchable encryption key agg and a

keyword w, then outputs only one trapdoor Tr.

Page 3 of 5

Journal for Studies in Management and Planning

Available at

http://edupediapublications.org/journals/index.php/JSMaP/

e-ISSN: 2395-0463

Volume 02 Issue 11

November 2016

Available online: http://edupediapublications.org/journals/index.php/JSMaP/ P a g e | 52

Fig 3: Trapdoor generation

File User-The generated keys can be passed to delegates securely (via secure e-mails or secure devices) finally;

any user with the Trapdoor keyword generation process can decrypt any cipher text provided that the cipher text

class is contained in the Encrypted aggregate key and Searchable Encrypted key via Decrypt.

We Propose A Concrete KASE Scheme As Follows:

1) Setup(1

λ

, n): the cloud server will use this algorithm to initialize system parameters as follows:

 Generate a bilinear map group system B=(p,G,G1, e(·,·)), where p is the order of G and 2λ

≤ p≤2λ+1

.

 Set n as the maximum possible number of documents which belongs to a data owner.

 Pick a random generator g ε G and a random αεZp, and computes gi = g(αi

) ε G for i =

{1,2,······,n,n+2,···,2n}.

 Select a one-way hash function H: f0; 1g_ !G. Finally, cloud server publishes the system parameters

params = (B, PubK, H), where PubK = (g; g1; _ _ _; gn; gn+2; :::; g2n) 2 G2n+1.

2) Keygen: data owner uses this algorithm to generate his/her key pair. It picks a random 2 Zp, and outputs:

pk = v = g; msk= γ.

3) Encrypt(pk, i): data owner uses this algorithm to encrypt data and generate its keyword cipher texts when

uploading the i-th document. To generate the keyword ciphertexts, this algorithm takes as input the file index iε

{1,····,n}, and:

 randomly picks a t ε Zp as the searchable encryption key ki of this document.

 generates a delta ∆i

for ki by computing:

c1 = g

t

, c2 = (v·gi)t

.

 for a keyword w, outputs its ciphertext cw as:

cw= e(g,,H(w))t

/e(g1

,gn

)

t

.

Note that c1; c2 are public and can be stored in the cloud server.

4) Extract(msk, S): data owner uses this algorithm to generate an aggregate searchable encryption key. For any

subset S which contains the indices of documents, this algorithm takes as input the owner’s master-secret key

msk and outputs the aggregate key kagg by

computing: kagg = ΠjεS g

γ

n+1-j

.

To delegate the keyword search right to a user, data owner will send kagg and the set S to the user.