Sie sind auf Seite 1von 56

Sharing of Secure Data using Revocable Storage

Identity-based Encryption in Cloud Computing


A Project Report
Submitted in the partial fulfillment of the requirements for the award of the degree of

Bachelor of Technology
in

Department of Computer Science Engineering


By

K.Susmitha Reddy 150030396


K.Vineeth Sahu 150030429
A.Vasavi 150030048

Under the Supervision of

Dr. Srinivas Prasad

KONERU LAKSHMAIAH EDUCATION FOUNDATION,


Green Fields, Vaddeswaram- 522502, Guntur(District), Andhra Pradesh, India.

November - 2018

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page i


KONERU LAKSHMAIAH EDUCATION FOUNDATION

DEPARTMENT OF CSE

Declaration

The project Report entitled “Sharing of Secure Data using Recoverable Storage Identity-based
encryption in cloud computing” is a record of bonafide work K.Susmitha Reddy(150030396),
K.Vineeth Sahu(150030429) and A.Vasavi(150030048) submitted in partial fulfillment for the
award of Bachelor of Technology in CSE during the academic year 2018-19.

We also declare that this report is of our effort and it has not been submitted to any other
university for the award of any degree.

K.Susmitha Reddy 150030396


K.Vineeth Sahu 150030429
A.Vasavi 150030048

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page ii


KONERU LAKSHMAIAH EDUCATION FOUNDATION
DEPARTMENT OF CSE

CERTIFICATE

This is to certify that the project report entitled “Sharing of Secure Data using
Recoverable Storage Identity-based encryption in cloud computing” is being
submitted by K.Susmitha Reddy(150030396), K.Vineeth Sahu(150030429) and
A.Vasavi(150030048) in partial fulfillment for the award of Bachelor of

Technology in CSE during the academic year 2018-19.

Signature of the Supervisor Signature of the HOD

Dr.Srinivas Prasad Dr.V.HARI KIRAN

Signature of the EXTERNAL EXAMINER

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page iii


KONERU LAKSHMAIAH EDUCATION FOUNDATION
DEPARTMENT OF CSE

ACKNOWLEDGEMENT

Our sincere thanks to Dr. Srinivas Prasad for his outstanding support
throughout the thesis for the successful completion of the work.

We express our gratitude to Dr. V. Hari Kiran, Head of the Department for
Computer Science and Engineering for providing us with adequate facilities,
ways and means by which we can complete this thesis.

We would like to place on record the deep sense of gratitude to the Honorable
Vice Chancellor, K L University for providing the necessary facilities to carry
the concluded term paper work.

Last but not the least, we thank all Teaching and Non-Teaching Staff of our
department and especially my classmates and my friends for their support in the
completion of our term paper work.

K.Susmitha Reddy 150030396


K.Vineeth Sahu 150030429
A.Vasavi 150030048

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page iv


ABSTRACT

Streamed figuring gives a versatile and satisfying way for data sharing, which brings
different perfect conditions for both the general masses and individuals. In any case, there
exists a trademark security for customers to clearly re-appropriate the shared data to the cloud
server since the data from time to time contain essential information. Thusly, it is basic to put
cryptographically refreshed find the opportunity to control on the principal data. Identity
based encryption is a promising crypto graphical grungy to make a reasonable data sharing
structure. Notwithstanding, find the opportunity to control isn't static. That is, the point at
which some customer's endorsing is snuck past, there should be a segment that can empty
him/her from the structure. As necessities be, the denied customer can't get to both the
starting at now and thusly shared data. To this end, we propose an idea called revocable-limit
character based encryption (RS-IBE), which can give the forward/backward security of
cipher text by demonstrating the functionalities of customer foreswearing and cipher text
revive then. Furthermore, we present a strong movement of RS-IBE, and show its security in
the delineated security show up. The execution examinations exhibit that the proposed RS-
IBE plot has central fixations like regard and adequacy, and starting now and into the
foreseeable future is reachable for a down to earth and fiscally skillful data sharing system.
Finally, we give execution conceded results of the proposed arrangement to demonstrate its
practicability

Keywords: Cloud server, Internet of Things (IoT), Security, Cipher text.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page v


TABLE OF CONTENTS

Chapter Chapter Name Page numbers


i List of figures 1
ii List of Abbreviations 2
1 Introduction 3-8
1.1Structure of Cloud Computing 4
1.2 How Cloud Computing Works 4
1.3Characteristics of Cloud computing 5
1.4 Service models 6
1.5 Benefits of cloud computing 6-8
2 Literature Review 9-11
2.1 A break in the clouds: towards a cloud 9
definition.
2.2 Social cloud computing: A vision for 9
socially motivated resource sharing
2.3 Privacy preserving public auditing for 9
secure cloud storage
2.4 An efficient and secure dynamic auditing 10
protocol for data storage in cloud computing
2.5 An efficient and secure dynamic auditing 11
protocol for data storage in cloud computing
3 System Analysis 12-14
3.1 Existing System 12
3.2 Disadvantages of Existing System 13
3.4 Proposed Model 13-14
4 System Design 15-23

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page vi


5 Implementation 24-43
6 Resullts 43-49
7 Testing 50-54
8 Conclusion 54
9 References 54-57

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page vii


LIST OF FIGURES

Figure 1.1 Structure of cloud computing

Figure 1.2 Characteristics of cloud computing

Figure 1.3 Structure of service models

Figure 4.1 System Architecture

Figure 4.2 Data Flow Diagram

Figure 4.3 Utilize case Diagram

Figure 4.4 Class Diagram

Figure 4.5 Sequence Diagram

Figure 4.6 Activity Diagram

Figure 5.1 Java Technology

Figure 5.2 Java Platform

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 1


LIST OF ABBREVATIONS

MS – Management Server

IOT- Internet of Things

RS – Resolution server

IS – Information Server

FN – Fog Node

SHA- Secure Hash Algorithm

PR – Private Key

PU- Public Key

M – Message

H ( ) - Hash of

E ( ) - Encrypted

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 2


CHAPTER-1

INTRODUCTION

a) Cloud computing: The practice of using a network of remote servers hosted on the
Internet to store, manage, and process data, rather than a local server or a personal computer.

b) Fog computing: Fog computing is a decentralized computing infrastructure in which data,


compute, storage and applications are distributed in the most logical, efficient place between
the data source and the cloud.

c) Internet of Things: It refers to the ability of interconnection via the Internet of computing
devices embedded in everyday objects, enabling them to send and receive data.

1.1 Structure of cloud computing:


Appropriated registering is the usage of figuring resources (hardware and
programming) that are passed on as a relationship over a framework (frequently the Internet).
The name starts from the fundamental utilization of a cloud-shaped picture as a gathering for
the mind boggling structure it contains in system outlines. Disseminated processing depends
remote relationship with a customer's information, programming and estimation. Conveyed
registering contains mechanical assembly and programming resources made open on the
Internet as composed pariah affiliations. These affiliations typically offer access to front line
programming applications and awesome frameworks of server PCs.

figure 1. 1 Structure of cloud computing

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 3


1.2 How Cloud Computing Works

The objective of circulated figuring is to apply customary supercomputing, or world class


enlisting power, typically utilized by military and research working environments, to play out
a substantial number of means reliably, in purchaser planned applications, for example,
budgetary portfolios, to pass on changed information, to give information gathering or to
control expansive, immersive PC preoccupations.

The dispersed registering utilizes frameworks of clearing get-togethers of servers every now
and again running immaterial effort client PC advancement with specific association with
spread information preparing errands transversely completed them. This mutual IT
foundation contains broad pools of frameworks that are related together. Routinely,
virtualization systems are utilized to improve the essentialness of circulated figuring.

1.3 Characteristics of cloud computing

Characteristics and Services Models:

The striking characteristics of distributed computing in light of the definitions gave by the
National Institute of Standards and Terminology (NIST) are laid out underneath:

• On-ask for self-advantage: A purchaser can independently course of action figuring


capacities, for instance, server time and system accumulating, as required normally without
requiring human relationship with every authority organization's.

• Broad arrange get to: Capabilities are open over the system and got to through standard
segments that propel use by heterogeneous thin or thick client stages (e.g., phones, compact
workstations, and PDAs).

• Resource pooling: The provider's registering resources are pooled to serve different buyers
using a multi-tenant show, with different physical and virtual resources capably doled out and

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 4


reassigned by purchaser ask. There is a sentiment zone self-rule in that the customer
generally has no control or data over the right territory of the enabled resources however may
need to decide zone at a more hoisted measure of thought (e.g., country, state, or server
cultivate). Instances of advantages join limit, taking care of, memory, organize information
exchange limit, and virtual machines.

• Rapid adaptability: Capabilities can be rapidly and adaptably provisioned, occasionally


normally, to quickly scale out and immediately released to quickly scale in. To the client, the
limits available for provisioning every now and again radiate an impression of being
unfathomable and can be gained in any sum at whatever point.

• Measured advantage: Cloud systems therefore control and upgrade resource use by using a
metering limit at some level of reflection legitimate to the sort of organization (e.g., limit,
getting ready, information transmission, and dynamic customer accounts). Resource utilize
can be regulated, controlled, and uncovered offering straightforwardness to both the provider
and purchaser of the utilized organization.

figure 1. 2 Characteristics of cloud computing

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 5


1.4 Services Models
Distributed computing incorporates three particular organization models, to be particular
Infrastructure-as-a-Service (IaaS), Platform-as-a-Service (PaaS), and Software-as-a-Service
(SaaS). The three organization models or layer are done by an end customer layer that
epitomizes the end customer perspective on cloud organizations. The model is showed up in
figure underneath. In case a cloud customer gets to organizations on the system layer, for
instance, she can run her own specific applications on the benefits of a cloud establishment
and remain responsible for the assistance, upkeep, and security of these applications herself.
In case she gets to an organization on the application layer, these assignments are routinely
managed by the cloud authority association.

Fig 1.3.Structure of service models

1.5 Benefits of cloud computing


1. Achieve economies of scale – increment volume yield or efficiency with less individuals.
Your cost per unit, undertaking or item plunges.

2. Reduce spending on innovation foundation. Keep up simple access to your information


with insignificant forthright spending. Pay as you go (week after week, quarterly or yearly),
in view of interest.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 6


3. Globalize your workforce for barely anything. Individuals worldwide can get to the
cloud, if they have an Internet association.

4. Streamline procedures. Accomplish more work in less time with less individuals.

5. Reduce capital expenses. There's no compelling reason to spend enormous cash on


equipment, programming or authorizing expenses.

6. Improve availability. You approach whenever, anyplace, making your life so substantially
less demanding!

7. Monitor ventures all the more viably. Remain inside spending plan and in front of finish
process durations.

8. Less staff preparing is required. It takes less individuals to accomplish more work on a
cloud, with a negligible expectation to learn and adapt on equipment and programming
issues.

9. Minimize authorizing new programming. Extend and develop without the need to
purchase costly programming licenses or projects.

10. Improve flexibility. You can alter course without genuine "individuals" or "monetary"
issues in question.

Advantages:
1. Pay: Pay for just the assets utilized.

2. Security: Cloud occurrences are disengaged in the network from different cases for
enhanced security.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 7


3. Performance: Instances can be included right away for enhanced execution. Customers
approach the aggregate assets of the Cloud's center equipment.

4. Scalability: Auto-send cloud cases when required.

5. Uptime: Uses various servers for most extreme redundancies. If there should be an
occurrence of server disappointment, occasions can be naturally made on another server.

6. Control: Able to login from any area. Server preview and a product library gives you a
chance to convey custom examples.

7. Traffic: Deals with spike in traffic with fast deployment of extra cases to deal with the
heap.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 8


CHAPTER-2
LITERATURE SURVEY

2.1) A break in the clouds: towards a cloud definition


AUTHORS: L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner

This paper discusses Cloud Computing to achieve a whole importance of what a Cloud is,
using the rule traits frequently associated with this perspective in the composition. More than
20 definitions have been considered considering the extraction of an understanding definition
and likewise a base definition containing the fundamental traits. This paper gives cautious
thought to the Grid perspective, as it is as often as possible confused for Cloud propels. We
also delineate the associations and capabilities between the Grid and Cloud approaches.

2.2) Social cloud computing: A vision for socially motivated resource sharing
AUTHORS: K. Chard, K. Bubendorfer, S. Caton, and O. F. Rana
Online associations in informal communities are every now and again in perspective of
certifiable associations and can in this way be used to derive a level of trust between
customers. We propose using these associations with outline a dynamic "Social Cloud," in
this way engaging customers to share heterogeneous resources inside the setting of an
informal organization. Moreover, the intrinsic socially healing frameworks (sparks,
disincentives) can be used to enable a cloud-based structure for whole deal offering to cut
down assurance concerns and security overheads than are accessible in standard cloud
circumstances. In view of the stand-out kind of the Social Cloud, a social business focus is
proposed as a strategies for coordinating sharing. The social market is novel, as it uses both
social and financial conventions to support trading. This paper portrays Social Cloud
enrolling, laying out various parts of Social Clouds, and demonstrates the approach using a
social stockpiling cloud use in Facebook.

2.3) Privacy preserving public auditing for secure cloud storage


AUTHORS: C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou,

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 9


Using conveyed capacity, customers can remotely store their data and welcome the on-ask for
choice applications and organizations from a common pool of configurable preparing
resources, without the heaviness of neighborhood data stockpiling and upkeep. Regardless,
the way that customers never again have physical responsibility for outsourced data makes
the data reliability protection in dispersed figuring a great errand, especially for customers
with obliged enlisting resources. Additionally, customers should have the ability to just use
the disseminated stockpiling as if it is close-by, without worrying over the need to affirm its
genuineness. Hence, engaging open auditability for circulated capacity is of essential
centrality with the objective that customers can rely upon a pariah evaluator (TPA) to check
the genuineness of outsourced data and be easy. To securely display a convincing TPA, the
investigating strategy should get no new vulnerabilities toward customer data assurance, and
familiarize no additional online weight with customer. In this paper, we propose a safe
appropriated stockpiling system supporting security sparing open investigating. We also
extend our result to enable the TPA to perform surveys for various customers at the same
time and viably. Wide security and execution examination show the proposed plans are
provably secure and exceedingly beneficial. Our preliminary examination coordinated on
Amazon EC2 case moreover demonstrates the speedy execution of the arrangement.

2.4) An efficient and secure dynamic auditing protocol for data storage in cloud
computing
AUTHORS: K. Yang and X. Jia

In distributed computing, data proprietors have their data on cloud servers and customers
(data purchasers) can get to the data from cloud servers. As a result of the data outsourcing,
in any case, this new perspective of data encouraging organization in like manner exhibits
new security challenges, which requires a free examining organization to check the data
uprightness in the cloud. Some present remote trustworthiness checking methods can serve
for static record data and, along these lines, can't be associated with the examining
organization since the data in the cloud can be powerfully revived. Thusly, a profitable and
secure dynamic assessing convention is needed to convince data proprietors that the data are
precisely put away in the cloud. In this paper, we at first arrangement an exploring structure
for distributed storage systems and propose a profitable and insurance sparing reviewing
convention. By then, we extend our examining convention to help the data dynamic
operations, which is capable and provably secure in the sporadic prophet appear. We

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 10


furthermore extend our assessing convention to help cluster inspecting for both different
proprietors and distinctive mists, without using any place stock in facilitator. The
examination and amusement happens show that our proposed reviewing conventions are
secure and capable, especially it diminish the figuring expense of the evaluator.

2.5) Public auditing for shared data with efficient user revocation in the cloud
AUTHORS: B. Wang, B. Li, and H. Li

With data stockpiling and sharing associations in the cloud, clients can without a considerable
amount of a broaden change and offer data as a get-together. To guarantee shared data
uprightness can be checked straightforwardly, clients in the social event need to figure
imperfections on every single one of the pieces in shared data. Specific pieces in shared data
are by and large separate by various clients in light of data modifications performed by
various clients. For security reasons, once a client is disavowed from the get-together, the
squares which were by then set apart by this denied client must be re-separate by a present
client. The quick technique, which engages a present client to download the relating some
fragment of shared data and re-sign it amidst client refusal, is wasteful because of the broad
size of shared data in the cloud. In this paper, we propose a novel open keeping an eye on
structure for the steadfastness of allowed data to convincing client denial as a guideline
require. By using the probability of go between re-marks, we engage the cloud to re-sign
squares for the benefit of existing clients amidst client revocation, with the target that present
clients don't have to download and re-sign pieces independent from some other individual.
What's more, an open verifier is constantly arranged to review the validity of shared data
without recovering the whole data from the cloud, paying little regard to the probability that
some piece of shared data has been re-separate by the cloud. Additionally, our structure can
bolster bunch taking a gander at by checking diverse investigating assignments in the
meantime. Trial happens as intended demonstrate that our instrument can basically enhance
the practicality of client renouncement.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 11


CHAPTER-3
SYSTEM ANALYSIS

3.1 EXISTING SYSTEM


Boneh and Franklin at first proposed a trademark disavowal way for IBE. They attached the
present day and age to the ciphertext, and non-repudiated customers infrequently got private
keys for every day and age from the key expert.

Boldyreva, Goyal and Kumar familiar a novel approach with achieve capable denial.

They used a matched tree to administer identity to such a degree, to the point that their RIBE
plot decreases the diserse nature of key renouncement to logarithmic (as opposed to straight)
in the best number of system customers.

Subsequently, by using the beforehand said repudiation methodology, Libert and Vergnaud
proposed an adaptively secure RIBE contrive in light of a variety ofWater's IBE plot.

Chen et al. built up a RIBE contrive from networks.

3.2 DISADVANTAGES OF EXISTING SYSTEM


Unfortunately, existing course of action isn't versatile, since it requires the key pro to perform
coordinate work in the amount of non-denied customers. Besides, an ensured channel is
fundamental for the key authority and non-renounced customers to transmit new keys.

However, existing arrangement just achieves specific security.

This kind of revocation procedure can't stay away from the trick of repudiated customers and
poisonous non-denied customers as harmful non-revoked customers can share the invigorate
key with those disavowed customers.

Furthermore, to revive the ciphertext, the key master in their arrangement needs to keep up a
table for each customer to convey the re-encryption key for every time, which by and large
forms the key expert's workload.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 12


3.3 PROPOSED SYSTEM
It creates the impression that the possibility of revocable character based encryption (RIBE)
might be a promising system that fulfills the beforehand specified security requirements for
data sharing.

RIBE features an instrument that enables a sender to include the present day and age to the
ciphertext with the ultimate objective that the authority can unravel the ciphertext simply
under the condition that he/she isn't revoked at that day and age.

A RIBE-based data sharing structure fills in as takes after:

Step 1: The data provider (e.g., David) first picks the customers (e.g., Alice and Bob) who
can share the data. By then, David scrambles the data under the identities Alice and Bob, and
exchanges the ciphertext of the normal data to the cloud server.

Step 2: When either Alice or Bob needs to get the normal data, she or he can download and
unscramble the looking at ciphertext. Nevertheless, for an unapproved customer and the
cloud server, the plaintext of the common data isn't available.

Step 3: sometimes, e.g., Alice's endorsement gets ended, David can download the ciphertext
of the shared data, and a while later decipher then-re-encode the basic data with the true
objective that Alice is kept from getting to the plaintext of the common data, and after that
exchange the re-mixed data to the cloud server again.

ADVANTAGES OF PROPOSED SYSTEM:


We give formal definitions to RS-IBE and its relating security show;

We present a strong improvement of RS-IBE.

The proposed plan can give security and in switch/forward2 riddle at the same time

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 13


We exhibit the security of the proposed plot in the standard model, under the decisional ℓ-
Bilinear Diffie-Hellman Exponent (ℓ-BDHE) assumption. Additionally, the proposed plan
can withstand translating key introduction

The strategy of ciphertext invigorate simply needs open data. Note that no past character
based encryption contrives in the written work can give this component;

The additional computation and capacity multifaceted nature, which are introduced in by the
secret, is all upper restricted by O(log(T )2), where T is the aggregate number of times.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 14


CHAPTER-4
SYSTEM DESIGN
SYSTEM ARCHITECTURE:

DATA FLOW DIAGRAM:

The DFD is besides called as air take diagram. It is a direct graphical formalism that can be
utilized to deliver a framework to the degree data to the structure, various dealing with
completed on this data, and the yield data is made by this structure.

2. The data stream chart (DFD) is a champion among the most essential demonstrating
mechanical congregations. It is utilized to display the structure parts. These parts are the
structure framework, the data utilized by the strategy, an outside substance that works
together with the structure and the data streams in the framework.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 15


3. DFD shows how the data experiences the structure and how it is changed by a development
of changes. It is a graphical strategy that delineates data stream and the movements that are
related as data moves from sense of duty regarding yield.

4. DFD is for the most part called bubble chart. A DFD might be utilized to address a
structure at any level of meeting. DFD might be distributed into levels that address
developing data stream and suitable detail.

Revocation and Ciphertext


update the file

Encrypt File
Upload to Cloud
Encrypt File

Download the

key Format
to User

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 16


UML DIAGRAMS

UML stays for Unified Modeling Language. UML is a systematized all around valuable
exhibiting vernacular in the field of question arranged programming outlining. The standard
is supervised, and was made by, the Object Management Group.

The goal is for UML to twist up doubtlessly a run of the mill vernacular for making models
of dissent arranged PC programming. In its present shape UML is contained two significant
parts: a Meta-appear and a documentation. Later on, some kind of procedure or process may
in like manner be added to; or associated with, UML.

The Unified Modeling Language is a standard tongue for deciding, Visualization,


Constructing and recording the ancient pieces of programming structure, and what's more for
business showing and other non-programming systems.

The UML addresses a get-together of best building practices that have shown successful in
the showing of colossal and complex structures.

The UML is a basic bit of making objects arranged programming and the item change
process. The UML uses generally graphical documentations to express the arrangement of
programming wanders.

Objectives:
The Primary goals in the arrangement of the UML are according to the accompanying:
1.Provide customers an arranged to-use, expressive visual exhibiting Language with the
objective that they can make and exchange critical models.
2.Provide extendibility and specialization instruments to grow the middle thoughts.
3.Be self-governing of particular programming vernaculars and headway process.
4.Provide a formal explanation behind understanding the showing lingo.
5. Encourage the advancement of OO gadgets feature.
6. Support bigger sum progression thoughts, for instance, facilitated endeavors, frameworks,
cases and parts.
7. Integrate acknowledged systems.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 17


UTILIZE CASE DIAGRAM:
A usage case chart in the Unified Modeling Language (UML) is a kind of behavioral diagram
portrayed by and produced using a Use-case examination. Its inspiration is to present a
graphical outline of the convenience gave by a system in regards to performing specialists,
their destinations (addressed as use cases), and any conditions between those usage cases.
The central explanation behind a usage case plot is to exhibit what structure limits are
performed for which entertainer. Parts of the performing specialists in the system can be
depicted.

Registration

Login

Encrypt file upload to cloud

File View

Data Provider Ciphertext update

Send Request key Authority


User

View request

Secret Key Send to User

Verification

Key Authority File Download

CLASS DIAGRAM:

In programming building, a class diagram in the Unified Modeling Language (UML) is a


kind of static structure plot that depicts the structure of a system by exhibiting the structure's

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 18


classes, their properties, operations (or techniques), and the associations among the classes. It
elucidates which class contains data.

SEQUENCE DIAGRAM:
A progression plot in Unified Modeling Language (UML) is a kind of association chart that
shows how frames function with each other and in what organizes. It is a create of a Message
Sequence Chart. Plan diagrams are occasionally called event plots, event circumstances, and
timing charts.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 19


Data Base

Update the File

DATA BASE

ACTIVITY DIAGRAM:
Development diagrams are graphical depictions of work procedures of stepwise activities and
exercises with help for choice, accentuation and concurrence. In the Unified Modeling
Language, development diagrams can be used to depict the business and operational all
around requested work procedures of portions in a structure. An activity graph exhibits the
general stream of control.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 20


LOGIN

Encrypt file View Request View File

Sent Request
Revocation and
Ciphertext update Key
Verification

Download file

INPUT DESIGN AND OUTPUT DESIGN


The information course of action is the relationship between the data structure and the client.
It fuses the influencing particular and frameworks for data to strategy and those strategies are
fundamental to put exchange data in to a usable edge for dealing with can be capable by
studying the PC to inspect data from a made or printed report or it can happen by having
individuals entering the data especially into the structure. The plan of information
concentrates on controlling the measure of data required, controlling the mistakes,
maintaining a strategic distance from delay, keeping up a key division from additional
methods and keeping the framework coordinate. The data is masterminded in such a course

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 21


thusly, to the point that it gives security and solace with holding the affirmation. Data Design
thought about the running with things:

What data should be given as information?

How the data should be coordinated or coded?

The trade to deal with the working staff in giving data.

Methods for prepare information endorsements and dares to take after when botch happen.

Destinations

1. Data Design is the route toward changing over a customer orchestrated portrayal of the
commitment to a PC based system. This blueprint is basic to avoid botches in the data input
process and show the correct bearing to the organization for getting right data from the
modernized system.

2. It is refined by making simple to utilize screens for the data segment to manage far
reaching volume of data. The goal of illustrating input is to influence data to area less
requesting and to be free from goofs. The data entry screen is laid out to such an extent that
each one of the data controls can be performed. It moreover gives record seeing workplaces.

3. Right when the data is entered it will check for its authenticity. Data can be entered with
the help of screens. Legitimate messages are given as when required with the objective that
the customer won't be in maize of minute. Thus the objective of data design is to influence a
data to organize that is definitely not hard to take after

YIELD DESIGN
A quality yield is one, which meets the basics of the end client and presents the data
unmistakably. In any structure aftereffects of preparing are conceded to the clients and to
other framework through yields. In yield outline it is settled how the data is to be cleared for
smart need what's more the printed adjustment yield. It is the most fundamental and direct

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 22


source data to the client. Skilled and sharp yield setup redesigns the framework's relationship
to help client central specialist.

1. Masterminding PC yield ought to continue in a managed, well inside and out thought about
way; the correct yield must be conveyed while guaranteeing that each yield section is made
so individuals will discover the structure can utilize effortlessly and sensibly. Right when
examination outline PC yield, they should Identify the particular yield that is required to meet
the basics.

2. Select strategies for showing data.

3. Impact document, to report, or different blueprints that contain data made by the structure.

The yield sort of a data structure should accomplish no less than one of the going with
targets.
Convey data about past activities, current status or projections of the Future.
Signal basic events, openings, issues, or takes note.
Trigger an action.
Confirm an action.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 23


CHAPTER-5
IMPLEMENTATION

MODULES:
 System Construction Module
 Data Provider
 Cloud User
 Key Authority (Auditor)

MODULES DESCSRIPTION:

System Construction Module


In the primary module, we develop the proposed system with the required components for the
appraisal of the proposed show. The data provider (e.g., David) first picks the customers
(e.g., Alice and Bob) who can share the data. By then, David encodes the data under the
identities Alice and Bob, and exchanges the ciphertext of the basic data to the cloud server.

Exactly when either Alice or Bob needs to get the common data, she or he can download and
translate the contrasting ciphertext. Nevertheless, for an unapproved customer and the cloud
server, the plaintext of the common data isn't open.

Data Provider
In this module, we develop the Data Provider module. The data provider module is made
with the true objective that the new customers will Signup at first and a short time later Login
for affirmation. The data provider module gives the option of exchanging the record to the
Cloud Server. The methodology of File Uploading to the cloud Server is knowledgeable
about Identity-based encryption arrange. Data Provider will check the propel status of the
archive exchange by him/her. Data Provider gave the parts of Revocation and Ciphertext
invigorate the archive. Once subsequent to completing of the system, the Data Provider
logouts the session.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 24


Cloud User
In this module, we develop the Cloud User module. The Cloud customer module is delivered
with the ultimate objective that the new customers will Signup at first and after that Login for
approval. The Cloud customer is outfitted with the option of record look. By then cloud
customer incorporate is incorporated for send the Request to Auditor for the File get to.
Ensuing to getting unscramble key from the Auditor, he/she can access to the File. The cloud
customer is also enabled to download the File. After fulfillment of the strategy, the customer
logout the session.

Key Authority (Auditor)


Evaluator Will Login on the Auditor's page. He/she will check the pending requesting of any
of the above person. Resulting to enduring the request from the above individual, he/she will
make expert key for encode and Secret key for disentangle. After the aggregate strategy, the
Auditor logout the session.

Source code

package algorithm;

import java.util.Properties;
import javax.mail.Message;
import javax.mail.MessagingException;
import javax.mail.PasswordAuthentication;
import javax.mail.Session;
import javax.mail.Transport;
import javax.mail.internet.InternetAddress;
import javax.mail.internet.MimeMessage;

public class Mail {

public static boolean secretMail(String msg, String name, String email) {


Properties props = new Properties();
props.put("mail.smtp.host", "smtp.gmail.com");

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 25


props.put("mail.smtp.socketFactory.port", "465");
props.put("mail.smtp.socketFactory.class",
"javax.net.ssl.SSLSocketFactory");
props.put("mail.smtp.auth", "true");
props.put("mail.smtp.port", "465");
// Assuming you are sending email from localhost
Session session = Session.getDefaultInstance(props,
new javax.mail.Authenticator() {
protected PasswordAuthentication getPasswordAuthentication() {
returnnewPasswordAuthentication("cloudcomputing96@gmail.com",
"clouddata123456");
}
}

System.out.println("Message " + msg);


try {
Message message = new MimeMessage(session);
message.setFrom(new InternetAddress(name));
message.setRecipients(Message.RecipientType.TO,
InternetAddress.parse(email));
message.setSubject("Secret key");
message.setText(msg);

Transport.send(message);

System.out.println("Done");
return true;

} catch (MessagingException e) {
System.out.println(e);
e.printStackTrace();
return false;
// throw new RuntimeException(e);
}

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 26


}

RS_IBE Algorithm

package algorithm;

import java.io.InputStream;

import java.security.spec.KeySpec;

import javax.crypto.Cipher;

import javax.crypto.SecretKey;

import javax.crypto.SecretKeyFactory;

import javax.crypto.spec.DESedeKeySpec;

import org.apache.tomcat.util.codec.binary.Base64;

public class RS_IBE {

private static final String UNICODE_FORMAT = "UTF8";

public static final String DESEDE_ENCRYPTION_SCHEME = "DESede";

private KeySpec ks;

private SecretKeyFactory skf;

private Cipher cipher;

byte[] arrayBytes;

private String myEncryptionKey;

private String myEncryptionScheme;

SecretKey key;

public RS_IBE() throws Exception {

myEncryptionKey = "ThisIsSpartaThisIsSparta";

myEncryptionScheme = DESEDE_ENCRYPTION_SCHEME;

arrayBytes = myEncryptionKey.getBytes(UNICODE_FORMAT);

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 27


ks = new DESedeKeySpec(arrayBytes);

skf = SecretKeyFactory.getInstance(myEncryptionScheme);

cipher = Cipher.getInstance(myEncryptionScheme);

key = skf.generateSecret(ks);

public String encrypt(String unencryptedString) {

String encryptedString = null;

try {

cipher.init(Cipher.ENCRYPT_MODE, key);

byte[] plainText = unencryptedString.getBytes(UNICODE_FORMAT);

byte[] encryptedText = cipher.doFinal(plainText);

encryptedString = new String(Base64.encodeBase64(encryptedText));

} catch (Exception e) {

e.printStackTrace();

return encryptedString;

public String decrypt(String encryptedString) {

String decryptedText=null;

try {

cipher.init(Cipher.DECRYPT_MODE, key);

byte[] encryptedText1 = encryptedString.getBytes(UNICODE_FORMAT);

byte[] encryptedText = Base64.decodeBase64(encryptedText1);

byte[] plainText = cipher.doFinal(encryptedText);

decryptedText= new String(plainText);

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 28


} catch (Exception e) {

e.printStackTrace();

return decryptedText;

Data base connetion:

package Dbcon;
import java.sql.Connection;
import java.sql.DriverManager;
public class DbConnection {
public static Connection getConnection()
{
Connection con = null;
try{
Class.forName("com.mysql.jdbc.Driver");
con = DriverManager.getConnection("jdbc:mysql://localhost:3306/data_sharing", "root",
"root");
}
catch(Exception e)
{
e.printStackTrace();
}
return con;
}
}

Data Provider:

package network;

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 29


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.sql.Connection;
import java.sql.ResultSet;
import java.sql.Statement;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.Calendar;
import javax.servlet.ServletException;
import javax.servlet.http.HttpServlet;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;
import javax.servlet.http.HttpSession;
import Dbcon.DbConnection;
import algorithm.RS_IBE
public class Download extends HttpServlet
{
protected void processRequest(HttpServletRequest request, HttpServletResponse response)
throws ServletException, IOException
{
response.setContentType("text/html;charset=UTF-8");
PrintWriter out = response.getWriter();
try
{
String fileid=request.getQueryString();
String fname=null;
InputStream is=null;
Connection con= DbConnection.getConnection();
Statement st=con.createStatement();
Statement st1=con.createStatement();

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 30


HttpSession user=request.getSession();
HttpSession session = request.getSession(true);
String uname=(String)session.getAttribute("ssname");
ResultSet rt=st.executeQuery("select * from upload where id='"+fileid+"'");
if(rt.next())
{
fname=rt.getString("filename");
is=(InputStream)rt.getAsciiStream("content");
}
Else
{
out.println("error while retreiving data");
}
BufferedReader br=new BufferedReader(new InputStreamReader(is));
String temp=null;
StringBuffer sb=new StringBuffer();
while((temp=br.readLine())!=null){
sb.append(temp);
}
String content=new RS_IBE().decrypt(sb.toString());
response.setHeader("Content-Disposition","attachment;filename=\""+fname+"\"");
out.write(content);
Calendar cal=Calendar.getInstance();
DateFormat dateformat=new SimpleDateFormat("yyyy/MM/dd HH:mm:ss");
String time=dateformat.format(cal.getTime());
System.out.println("download time:"+time);
st1.executeUpdate("insertintodownloads
(filename,username,time)values('"+fname+"','"+uname+"','"+time+"')")
}
catch(Exception e){
out.println(e);
}
finally

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 31


{
out.close();
}
}
protected void doPost(HttpServletRequest request, HttpServletResponse response)
throws ServletException, IOException
{
processRequest(request, response);
}
public String getServletInfo()
{
return "Short description";
}
}

Cloud user:

package network;
import java.util.Properties;
import javax.mail.Message;
import javax.mail.MessagingException;
import javax.mail.PasswordAuthentication;
import javax.mail.Session;
import javax.mail.Transport;
import javax.mail.internet.InternetAddress;
import javax.mail.internet.MimeMessage;
public class Mail
{
public static boolean secretMail(String msg, String name, String email)
{
Properties props = new Properties();
props.put("mail.smtp.host", "smtp.gmail.com");
props.put("mail.smtp.socketFactory.port", "465");
props.put("mail.smtp.socketFactory.class", "javax.net.ssl.SSLSocketFactory");

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 32


props.put("mail.smtp.auth", "true");
props.put("mail.smtp.port", "465")
Session session = Session.getDefaultInstance(props,
new javax.mail.Authenticator() {
protected PasswordAuthentication getPasswordAuthentication() {
returnnewPasswordAuthentication("cloudcomputing96@gmail.com", "clouddata123456");
}
});
System.out.println("Message" + msg);
try {
Message message = new MimeMessage(session);
message.setFrom(new InternetAddress(name));
message.setRecipients(Message.RecipientType.TO,
InternetAddress.parse(email));
message.setSubject("Secret key");
message.setText(msg);
Transport.send(message);
System.out.println("Done");
return true;
}
catch (MessagingException e) {
System.out.println(e);
e.printStackTrace();
return false;
// throw new RuntimeException(e);
}
}

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 33


CHAPTER-6
RESULTS

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 34


KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 35
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 36
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 37
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 38
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 39
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 40
KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 41
CHAPTER-7
TESTING

SYSTEM TESTING
The reason behind testing is to find blunders. Testing is the course toward trying to find each
possible blame or shortcoming in a work thing. It gives an approach to manage check the
accommodation of parts, sub gatherings, social events or conceivably a completed the process
of thing It is the way toward taking a shot at programming with the purpose of guaranteeing
that the

Programming framework fulfills its necessities and client needs and does not bomb in an
unsuitable way. There are particular sorts of test. Each test sort watches out for a particular
testing need.

SORTS OF TESTS

Unit testing
Unit testing joins the game plan of examinations that confirm that within program reason is
working truly, and that program inputs pass on liberal yields. All choice branches and interior
code stream ought to be asserted. It is the endeavoring of individual programming units of the
application .it is done after the complete of an individual unit before mix. This is a colleague
testing, that tons of its progression and is conspicuous. Unit tests perform fundamental tests at
part level and test a particular business process, application, or conceivably framework
design. Unit tests guarantee that each fascinating strategy for a business framework performs
precisely to the declared purposes of intrigue and contains unmistakably depicted information
sources and expected outcomes.

Compromise testing
Joining tests are relied upon to test combined programming parts to pick whether they
genuinely keep running as one program. Testing is occasion driven and is more worried over
the vital result of screens or fields. Mix tests demonstrate that despite how the parts were
freely fulfillment, as appeared by effectively unit testing, the mix of segments is right and

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 42


trustworthy. Mix testing is particularly away to reveal the issues that ascent up out of the
blend of segments.

Valuable test
Utilitarian tests give consider exhibits that points of confinement endeavored are accessible
as controlled by the business and particular prerequisites, framework documentation, and
client manuals.

Supportive testing is centered around the running with things:

Huge Input : perceived classes of true blue information must be perceived.

Invalid Input : saw classes of invalid information must be rejected.

Points of confinement : perceived cutoff points must be worked out.

Yield : perceived classes of use yields must be worked out.

Structures/Procedures interfacing frameworks or systems must be summoned.


Connection and accessibility of helpful tests depends on necessities, key breaking points, or
noteworthy investigations. In like way, correct augmentation relating to see Business process
streams; information fields, predefined structures, and dynamic frameworks must be
considered for testing. Before supportive testing is done, extra tests are perceived and the
successful estimation of current tests is settled.

Framework Test

Framework testing guarantees that the whole joined programming structure meets necessities.
It tests a setup to guarantee known and clear outcomes. An occasion of framework testing is
the arrangement organized structure mix test. Structure testing depends upon process outlines
and streams, underlining pre-driven process affiliations and mix focuses.

White Box Testing

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 43


White Box Testing is an endeavoring in which in which the thing analyzer ponders the inside
workings, structure and vernacular of the thing, or if nothing else its motivation. It is reason.
It is utilized to test zones that can't be come to from a revelation level.

Disclosure Testing
Divulgence Testing will attempt the thing with no learning of within workings, structure or
tongue of the module being tried. Exposure tests, as most extraordinary sorts of tests, must be
delivered utilizing a certain source report, for instance, affirmation or basics record, for
instance, detail or necessities archive. It is a trying in which the thing under test is supervised,
as a disclosure .you can't "see" into it. The test gives wellsprings of information and responds
to yields without considering how as far as possible.

1.1 Unit Testing:


Unit testing is commonly determined as a critical piece of a joined code and unit trial of the
thing lifecycle, disregarding how it is run of the mill for coding and unit testing to be
facilitated as two particular stages.

Test strategy and approach


Field testing will be performed physically and significant tests will be made in detail.

Test goals

•All field sections must work genuinely.

•Pages must be approved from the perceived affiliation.

•The portion screen, messages and reactions must not be surrendered.

Fragments to be endeavored

•Verify that the areas are of the right affiliation

•No copy areas ought to be permitted

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 44


• All affiliations should take the client to the right page.

1.2 Integration Testing


Programming coordination testing is the incremental mix testing of no under two united
programming parts on a solitary stage to pass on dissatisfactions caused by interface gives up.

The errand of the blend test is to watch that parts or programming applications, e.g. parts in a
thing framework or – one stage up – programming applications at the affiliation level – pass
on without mess up.
Test outcomes: All the trials said above passed sufficiently. No imperfections experienced.

1.3 Acceptance Testing


Client Acceptance Testing is a basic time of any meander and requires huge wander by the
end client. It additionally guarantees that the structure meets the utilitarian necessities.
Test outcomes: All the trials said above passed sufficiently. No imperfections experienced.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 45


CHAPTER-8
CONCLUSION

Appropriated processing brings superb comfort for individuals. Especially, it flawlessly


orchestrates the expanded need of sharing information over the Internet. In this paper, to
accumulate a sensible and secure information sharing framework in conveyed figuring, we
proposed an idea called RS-IBE, which bolsters character repudiation and ciphertext restore
in the meantime with a definitive target that a revoked client is kept from getting to formally
shared information, and besides as necessities be shared information. What's more, a solid
progression of RS-IBE is exhibited. The proposed RS-IBE plot is indicated adaptable secure
in the standard model, under the decisional ℓ-DBHE suspicion. The relationship happens as
expected demonstrate that our game plan has positive conditions like effectiveness and
handiness, and thusly is more attainable for sensible applications.

REFERENCES
[1] L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, “A break in the clouds:
towards a cloud definition,” ACM SIGCOMM Computer Communication Review, vol. 39, no.
1, pp. 50–55, 2008.
[2] iCloud. (2014) Apple storage service. [Online]. Available: https://www.icloud.com/
[3] Azure. (2014) Azure storage service. [Online]. Available: http://www.windowsazure.com/
[4] Amazon. (2014) Amazon simple storage service (amazon s3).[Online]. Available:
http://aws.amazon.com/s3/
[5] K. Chard, K. Bubendorfer, S. Caton, and O. F. Rana, “Social cloud computing: A vision
for socially motivated resource sharing,” Services Computing, IEEE Transactions on, vol. 5,
no. 4, pp. 551–563, 2012.

[6] C. Wang, S. S. Chow, Q. Wang, K. Ren, and W. Lou, “Privacy preserving public auditing
for secure cloud storage,” Computers, IEEE Transactions on, vol. 62, no. 2, pp. 362–375,
2013.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 46


[7] G. Anthes, “Security in the cloud,” Communications of the ACM, vol. 53, no. 11, pp. 16–
18, 2010.
[8] K. Yang and X. Jia, “An efficient and secure dynamic auditing protocol for data storage
in cloud computing,” Parallel and Distributed Systems, IEEE Transactions on, vol. 24, no. 9,
pp. 1717–1726, 2013.
[9] B. Wang, B. Li, and H. Li, “Public auditing for shared data with efficient user revocation
in the cloud,” in INFOCOM, 2013 Proceedings IEEE. IEEE, 2013, pp. 2904–2912.
[10] S. Ruj, M. Stojmenovic, and A. Nayak, “Decentralized access control with anonymous
authentication of data stored in clouds,” Parallel and Distributed Systems, IEEE Transactions
on, vol. 25, no. 2, pp. 384–394, 2014.
[11] X. Huang, J. Liu, S. Tang, Y. Xiang, K. Liang, L. Xu, and J. Zhou, “Cost-effective
authentic and anonymous data sharing with forward security,” Computers, IEEE
Transactions on, 2014, doi: 10.1109/TC.2014.2315619.
[12] C.-K. Chu, S. S. Chow, W.-G. Tzeng, J. Zhou, and R. H. Deng, “Key-aggregate
cryptosystem for scalable data sharing in cloud storage,” Parallel and Distributed Systems,
IEEE Transactions on, vol. 25, no. 2, pp. 468–477, 2014.
[13] A. Shamir, “Identity-based cryptosystems and signature schemes,” in Advances in
cryptology. Springer, 1985, pp. 47–53.
[14] D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” SIAM
Journal on Computing, vol. 32, no. 3, pp. 586– 615, 2003.
[15] S. Micali, “Efficient certificate revocation,” Tech. Rep., 1996.
[16] W. Aiello, S. Lodha, and R. Ostrovsky, “Fast digital identity revocation,” in Advances in
Cryptology–CRYPTO 1998. Springer, 1998, pp. 137–152.
[17] D. Naor, M. Naor, and J. Lotspiech, “Revocation and tracing schemes for stateless
receivers,” in Advances in Cryptology– CRYPTO 2001. Springer, 2001, pp. 41–62.
[18] C. Gentry, “Certificate-based encryption and the certificate revocation problem,” in
Advances in Cryptology–EUROCRYPT 2003. Springer, 2003, pp. 272–293.

[19] V. Goyal, “Certificate revocation using fine grained certificate space partitioning,” in
Financial Cryptography and Data Security. Springer, 2007, pp. 247–259.
[20] A. Boldyreva, V. Goyal, and V. Kumar, “Identity-based encryption with efficient
revocation,” in Proceedings of the 15th ACM conference on Computer and communications
security. ACM, 2008, pp. 417–426.

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 47


[21] B. Libert and D. Vergnaud, “Adaptive-id secure revocable identity based encryption,” in
Topics in Cryptology–CT-RSA 2009. Springer, 2009, pp. 1–15.
[22] ——, “Towards black-box accountable authority ibe with short ciphertexts and private
keys,” in Public Key Cryptography–PKC 2009. Springer, 2009, pp. 235–255.
[23] J. Chen, H. W. Lim, S. Ling, H. Wang, and K. Nguyen, “Revocable identity-based
encryption from lattices,” in Information Security and Privacy. Springer, 2012, pp. 390–403.
[24] J. H. Seo and K. Emura, “Revocable identity-based encryption revisited: Security model
and construction,” in Public-Key Cryptography–PKC 2013. Springer, 2013, pp. 216–234.
[25] ——, “Efficient delegation of key generation and revocation functionalities in identity-
based encryption,” in Topics in Cryptology– CT-RSA 2013. Springer, 2013, pp. 343–358.
[26] K. Liang, J. K. Liu, D. S. Wong, and W. Susilo, “An efficient cloud based revocable
identity-based proxy re-encryption scheme for public clouds data sharing,” in Computer
Security-ESORICS 2014. Springer, 2014, pp. 257–272.
[27] D.-H. Phan, D. Pointcheval, S. F. Shahandashti, and M. Strefler, “Adaptive cca
broadcast encryption with constant-size secret keys and ciphertexts,” International journal of
information security, vol. 12, no. 4, pp. 251–265, 2013.
[28] R. Anderson, “Two remarks on public-key cryptology (invited lecture),” 1997.
[29] M. Bellare and S. K. Miner, “A forward-secure digital signature scheme,” in Advances
in Cryptology–CRYPTO 1999. Springer, 1999, pp. 431–448.
[30] M. Abdalla and L. Reyzin, “A new forward-secure digital signature scheme,” in
Advances in Cryptology–ASIACRYPT 2000. Springer, 2000, pp. 116–129.
[31] A. Kozlov and L. Reyzin, “Forward-secure signatures with fast key update,” in Security
in communication Networks. Springer, 2003, pp. 241–256.

[32] X. Boyen, H. Shacham, E. Shen, and B. Waters, “Forward-secure signatures with


untrusted update,” in Proceedings of the 13th ACM conference on Computer and
communications security. ACM, 2006, pp. 191–200.
[33] J. Yu, R. Hao, F. Kong, X. Cheng, J. Fan, and Y. Chen, “Forward secure identity-based
signature: security notions and construction,” Information Sciences, vol. 181, no. 3, pp. 648–
660, 2011.
[34] R. Canetti, S. Halevi, and J. Katz, “A forward-secure public-key encryption scheme,” in
Advances in Cryptology–Eurocrypt 2003. Springer, 2003, pp. 255–271.
[35] D. Yao, N. Fazio, Y. Dodis, and A. Lysyanskaya, “Id-based encryption for complex
hierarchies with applications to forward security and broadcast encryption,” in Proceedings

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 48


of the 11th ACM conference on Computer and communications security. ACM, 2004, pp.
354–363.
[36] J. M. G. Nieto, M. Manulis, and D. Sun, “Forward-secure hierarchical predicate
encryption,” in Pairing-Based Cryptography–Pairing 2012. Springer, 2013, pp. 83–101.
[37] A. Sahai, H. Seyalioglu, and B. Waters, “Dynamic credentials and ciphertext delegation
for attribute-based encryption,” in Advances in Cryptology–CRYPTO 2012. Springer, 2012,
pp. 199–217.
[38] B. Waters, “Efficient identity-based encryption without random oracles,” in Advances in
Cryptology–EUROCRYPT 2005. Springer, 2005, pp. 114–127.
[39] B. Lynn. (2014) Pbc library: The pairing-based cryptography library. [Online].
Available: http://crypto.stanford.edu/pbc/

KONERU LAKSHMAIAH EDUCATION FOUNDATION Page 49

Das könnte Ihnen auch gefallen