A

Minor-Project report
On
PRIVACY PRISERVING MULTI -KEYWORD RANKED
SEARCH OVER ENCRYPTED CLOUD DATA
Major-Project report submitted in partial fulfilment of the Requirement for the
award of the degree of

Bachelor of Technology
IN
Computer Science & Engineering
BY

Pallavi Priya (HT NO:18D01A0573)

Under the guidance of

Mr.K Veerendranath

(Asst. Professor Dept. of CSE)

DEPARTMENT COMPUTER SCIENCE AND ENGINEERING

St. Mary’s Group of Institutions

(Affiliated to JNTU, Hyderabad)
Deshmukhi (V), Hayathnagar (M), R.R. District-508284

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY

HYDERABAD – 72
(2018-2022)
 Date:

CERTIFICATE

This is to certify that Pallavi Priya (HTNO:18D01A0573) have satisfactorily completed the
project work entitled “Decentralized Access Control With Anonymous Authentication” in
partial fulfilment of the requirement for the award of the Bachelor of Technology in
Computer Science & Engineering to the Jawaharlal Nehru Technological University,
Hyderabad for the academic year 2018-2022.

INTERNAL GUIDE

Mr. K.Veerendranath
(Asst Professor Dept. of CSE)

HEAD OF DEPT. CSE

Mr.A.Narender
(Asst. Professor Dept. of CSE)

EXAMINERS:
 DECLARATION

I hereby declare that the results embodied in this dissertation entitled “Decentralized Access
Control with Anonymous Authentication” is carried out by me during the year 2021-2022 in
partial fulfilment of the award of Degree of Bachelor of
Technology in Computer Science & Engineering from St. Mary’s Group of Institution
Hyderabad. I have not submitted the same to any other university or organisation for the
award of any other degree.

Place: Hyderabad Students Name with Signature

Date:

Pallavi Priya (HT NO: 18D01A0573)

 ACKNOWLEDGEMENT

This is an acknowledgement of the intensive drive and technical competence of

many individuals who have contributed to the success of my project.

I am immensely thankful to my internal guide Mr.K. Veerendranath, Asst.

Professor Dept. of C.S.E, for his valuable guidance and suggestions in each and
every stage of this work, which helped me in completing this project work
successfully.

I am obliged and grateful to my Hod Mr. A.Narender for her sagacious

guidance in all respects and for his valuable guidance in each and every stage of this
work, which helped me in completing this project work successfully.

My sincere thanks to our Principal Dr.V.Goutham St. Mary’s Institute of Engineering

& Technology, Hyderabad and to all my faculty members.

I am grateful to Chairman, St. Mary’s Group of Institutions DR. Rev.

K.V.K.RAO for granting me the permission for undergoing the practical training
through development of this project in Techveerendras Technologies, Hyderabad.

I am thankful to one and all who co-operated me to complete my project successfully.

 ABSTRACT
Due to the increasing popularity of cloud computing, more and more data owners are motivated
to outsource their data to cloud servers for great convenience and reduced cost in data
management. However, sensitive data should be encrypted before outsourcing for privacy
requirements, which obsoletes data utilization like keyword-based document retrieval. In this
paper, we present a secure multi-keyword ranked search scheme over encrypted cloud data,
which simultaneously supports dynamic update operations like deletion and insertion of
documents. Specifically, the vector space model and the widely-used TF_IDF model are
combined in the index construction and query generation. We construct a special tree-based
index structure and propose a ―Greedy Depth-first Search‖ algorithm to provide efficient
multi-keyword ranked search. The secure kNN algorithm is utilized to encrypt the index and
query vectors, and meanwhile ensure accurate relevance score calculation between encrypted
index and query vectors. In order to resist statistical attacks, phantom terms are added to the
index vector for blinding search results. Due to the use of our special tree-based index
structure, the proposed scheme can achieve sub-linear search time and deal with the deletion
and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the
efficiency of the proposed scheme.With the advent of cloud computing, data owners are
motivated to outsource their complex data management systems for local sites to the
commercial public cloud for great flexibility and economic savings. But for protecting the data
privacy, sensitive data have to be encrypted before outsourcing which obsoletes traditional data
utilization based on plaintext keyboard search. Considering the large number of data users and
documents in the order of their relevance to those keywords. Related works on searchable
encryption focus on single keyword search or boolean keyword search, and rarely sort the
search results. In this paper for the first time, we define and solve the challenging problem for
privacy-preserving multi-keyword ranked search over encrypted data in cloud computing
(MRSE)
 INDEX
S.NO CHAPTER PAGE.NO
.
 LIST OF FIGURES
S.No Fig.No Figure Name PageNo
 1.INTRODUCTION

1.1 What is cloud computing

Cloud computing is the use of computing resources (hardware and software) that are delivered as a
service over a network (typically the Internet). The name comes from the common use of a cloud-
shaped symbol as an abstraction for the complex infrastructure it contains in system diagrams. Cloud
computing entrusts remote services with a user's data, software and computation. Cloud computing
consists of hardware and software resources made available on the Internet as managed third-party
services. These services typically provide access to advanced software applications and high-end
networks of server computers.

Fig 1.1 : Structure of cloud computing

1.2 How Cloud Computing Works

The goal of cloud computing is to apply traditional supercomputing, or high-performance computing

power, normally used by military and research facilities, to perform tens of trillions of computations
per second, in consumer-oriented applications such as financial portfolios, to deliver personalized
information, to provide data storage or to power large, immersive computer games.

1
The cloud computing uses networks of large groups of servers typically running low-cost consumer PC
technology with specialized connections to spread data-processing chores across them. This shared IT
infrastructure contains large pools of systems that are linked together. Often, virtualization techniques
are used to maximize the power of cloud computing.

1.3 Characteristics and Services Models:

The salient characteristics of cloud computing based on the definitions provided by the National
Institute of Standards and Terminology (NIST) are outlined below:

• On-demand self-service: A consumer can unilaterally provision computing capabilities, such

as server time and network storage, as needed automatically without requiring human

interaction with each service’s provider.

• Broad network access: Capabilities are available over the network and accessed through
standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g.,
mobile phones, laptops, and PDAs).

• Resource pooling: The provider’s computing resources are pooled to serve multiple consumers
using a multi-tenant model, with different physical and virtual resources dynamically assigned
and reassigned according to consumer demand. There is a sense of location-independence in
that the customer generally has no control or knowledge over the exact location of the provided
resources but may be able to specify location at a higher level of abstraction (e.g., country,
state, or data center). Examples of resources include storage, processing, memory, network
bandwidth, and virtual machines.
• Rapid elasticity: Capabilities can be rapidly and elastically provisioned, in some cases
automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer,
the capabilities available for provisioning often appear to be unlimited and can be purchased in
any quantity at any time.
• Measured service: Cloud systems automatically control and optimize resource use by
leveraging a metering capability at some level of abstraction appropriate to the type of service
(e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be
managed, controlled, and reported providing transparency for both the provider and consumer
of the utilized service.

2
 Fig 1.3 : Characteristics of cloud computing

1.4Services Models:

Cloud Computing comprises three different service models, namely Infrastructure-as-a-Service (IaaS),
Platform-as-a-Service (PaaS), and Software-as-a-Service (SaaS). The three service models or layer are
completed by an end user layer that encapsulates the end user perspective on cloud services. The
model is shown in figure below.
If a cloud user accesses services on the infrastructure layer, for instance, she can run her own
applications on the resources of a cloud infrastructure and remain responsible for the support,
maintenance, and security of these applications herself.
If she accesses a service on the application layer, these tasks are normally taken care of by the cloud
service provider.

3
 Fig 1.4: Structure of service models

Benefits of cloud computing:

1. Achieve economies of scale – increase volume output or productivity with fewer people. Your
cost per unit, project or product plummets.
2. Reduce spending on technology infrastructure. Maintain easy access to your information
with minimal upfront spending. Pay as you go (weekly, quarterly or yearly), based on demand.
3. Globalize your workforce on the cheap. People worldwide can access the cloud, provided
they have an Internet connection.
4. Streamline processes. Get more work done in less time with less people.
5. Reduce capital costs. There’s no need to spend big money on hardware, software or licensing
fees.
6. Improve accessibility. You have access anytime, anywhere, making your life so much easier!
7. Monitor projects more effectively. Stay within budget and ahead of completion cycle times.
8. Less personnel training is needed. It takes fewer people to do more work on a cloud, with a
minimal learning curve on hardware and software issues.
9. Minimize licensing new software. Stretch and grow without the need to buy expensive
software licenses or programs.
10. Improve flexibility. You can change direction without serious ―people‖ or ―financial‖ issues
at stake.
4
 Advantages:

1. Price: Pay for only the resources used.

2. Security: Cloud instances are isolated in the network from other instances for improved
security.
3. Performance: Instances can be added instantly for improved performance. Clients have access
to the total resources of the Cloud’s core hardware.
4. Scalability: Auto-deploy cloud instances when needed.
5. Uptime: Uses multiple servers for maximum redundancies. In case of server failure, instances
can be automatically created on another server.
6. Control: Able to login from any location. Server snapshot and a software library lets you
deploy custom instances.
7. Traffic: Deals with spike in traffic with quick deployment of additional instances to handle the
load.

2. LITERATURE SURVEY

2.1.Security challenges for the public cloud

5
AUTHORS: K. Ren, C.Wang, Q.Wang et al.,

Cloud computing represents today's most exciting computing paradigm shift in information
technology. However, security and privacy are perceived as primary obstacles to its wide adoption.
Here, the authors outline several critical security challenges and motivate further investigation of
security solutions for a trustworthy public cloud environment.

2.2.A fully homomorphic encryption scheme

AUTHORS: C. Gentry

We propose the first fully homomorphic encryption scheme, solving an old open problem. Such a
scheme allows one to compute arbitrary functions over encrypted data without the decryption key—
i.e., given encryptions E(m1), ..., E( mt) of m1, ..., m t, one can efficiently compute a compact
ciphertext that encrypts f(m1, ..., m t) for any efficiently computable function f.

Fully homomorphic encryption has numerous applications. For example, it enables encrypted search
engine queries—i.e., a search engine can give you a succinct encrypted answer to your (boolean) query
without even knowing what your query was. It also enables searching on encrypted data; you can store
your encrypted data on a remote server, and later have the server retrieve only files that (when
decrypted) satisfy some boolean constraint, even though the server cannot decrypt the files on its own.
More broadly, it improves the efficiency of secure multiparty computation.

In our solution, we begin by designing a somewhat homomorphic "boostrappable" encryption scheme

that works when the function f is the scheme's own decryption function. We then show how, through
recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.

2.3.Public key encryption with keyword search

AUTHORS: D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano

We study the problem of searching on data that is encrypted using a public key system. Consider user
Bob who sends email to user Alice encrypted under Alice's public key. An email gateway wants to test
whether the email contains the keyword "urgent" so that it could route the email accordingly. Alice, on
the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and
construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to
test whether the word "urgent" is a keyword in the email without learning anything else about the
email. We refer to this mechanism as Public Key Encryption with keyword Search. As another

6
example, consider a mail server that stores various messages publicly encrypted for Alice by others.
Using our mechanism Alice can send the mail server a key that will enable the server to identify all
messages containing some specific keyword, but learn nothing else. We define the concept of public

key encryption with keyword search and give several constructions.

2.4.Practical techniques for searches on encrypted data

AUTHORS: D. X. Song, D. Wagner, and A. Perrig,

It is desirable to store data on data storage servers such as mail servers and file servers in encrypted
form to reduce security and privacy risks. But this usually implies that one has to sacrifice
functionality for security. For example, if a client wishes to retrieve only documents containing certain
words, it was not previously known how to let the data storage server perform the search and answer
the query, without loss of data confidentiality. We describe our cryptographic schemes for the problem
of searching on encrypted data and provide proofs of security for the resulting crypto systems. Our
techniques have a number of crucial advantages. They are provably secure: they provide provable
secrecy for encryption, in the sense that the untrusted server cannot learn anything about the plaintext
when only given the ciphertext; they provide query isolation for searches, meaning that the untrusted
server cannot learn anything more about the plaintext than the search result; they provide controlled
searching, so that the untrusted server cannot search for an arbitrary word without the user's
authorization; they also support hidden queries, so that the user may ask the untrusted server to search
for a secret word without revealing the word to the server. The algorithms presented are simple, fast
(for a document of length n, the encryption and search algorithms only need O(n) stream cipher and
block cipher operations), and introduce almost no space and communication overhead, and hence are
practical to use today .

2.5.Privacy preserving keyword searches on remote encrypted data

AUTHORS: Y.-C. Chang and M. Mitzenmacher

We consider the following problem: a user U wants to store his files in an encrypted form on a remote
file server S. Later the user U wants to efficiently retrieve some of the encrypted files containing (or
indexed by) specific keywords, keeping the keywords themselves secret and not jeopardizing the
security of the remotely stored files. For example, a user may want to store old e-mail messages
encrypted on a server managed by Yahoo or another large vendor, and later retrieve certain messages
while travelling with a mobile device.

7
In this paper, we offer solutions for this problem under well-defined security requirements. Our
schemes are efficient in the sense that no public-key cryptosystem is involved. Indeed, our approach is
independent of the encryption method chosen for the remote files. They are also incremental, in that U
can submit new files which are secure against previous queries but still searchable against future
queries.

3. SYSTEM ANALYSIS

3.1 EXISTING SYSTEM:

8
  A general approach to protect the data confidentiality is to encrypt the data before outsourcing.
 Searchable encryption schemes enable the client to store the encrypted data to the cloud and
execute keyword search over cipher text domain. So far, abundant works have been proposed
under different threat models to achieve various search functionality, such as single keyword
search, similarity search, multi-keyword boolean search, ranked search, multi-keyword ranked
search, etc. Among them, multi-keyword ranked search achieves more and more attention for
its practical applicability. Recently, some dynamic schemes have been proposed to support
inserting and deleting operations on document collection. These are significant works as it is
highly possible that the data owners need to update their data on the cloud server.

3.2 DISADVANTAGES OF EXISTING SYSTEM:

 Huge cost in terms of data usability. For example, the existing techniques on keyword-based
information retrieval, which are widely used on the plaintext data, cannot be directly applied on
the encrypted data. Downloading all the data from the cloud and decrypt locally is obviously
impractical.
 Existing System methods not practical due to their high computational overhead for both the
cloud sever and user.

3.3 PROPOSED SYSTEM:

 This paper proposes a secure tree-based search scheme over the encrypted cloud data, which
supports multi-keyword ranked search and dynamic operation on the document collection.
Specifically, the vector space model and the widely-used ―term frequency (TF) × inverse
document frequency (IDF)‖ model are combined in the index construction and query generation
to provide multi-keyword ranked search. In order to obtain high search efficiency, we construct
a tree-based index structure and propose a ―Greedy Depth-first Search‖ algorithm based on
this index tree.
 The secure kNN algorithm is utilized to encrypt the index and query vectors, and meanwhile
ensure accurate relevance score calculation between encrypted index and query vectors.
 To resist different attacks in different threat models, we construct two secure search schemes:
the basic dynamic multi-keyword ranked search (BDMRS) scheme in the known ciphertext
model, and the enhanced dynamic multi-keyword ranked search (EDMRS) scheme in the
known background model.

9
3.4 ADVANTAGES OF PROPOSED SYSTEM:

 Due to the special structure of our tree-based index, the proposed search scheme can flexibly
achieve sub-linear search time and deal with the deletion and insertion of documents.
 We design a searchable encryption scheme that supports both the accurate multi-keyword
ranked search and flexible dynamic operation on document collection.
 Due to the special structure of our tree-based index, the search complexity of the proposed
scheme is fundamentally kept to logarithmic. And in practice, the proposed scheme can achieve
higher search efficiency by executing our ―Greedy Depth-first Search‖ algorithm. Moreover,

parallel search can be flexibly performed to further reduce the time cost of search process.

4. SYSTEM SPECIFICATIONS:

10
4.1 HARDWARE REQUIREMENTS:

• System : Pentium IV 2.4 GHz.

• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

4.2 SOFTWARE REQUIREMENTS:

• Operating system : - Windows XP.

• Coding Language : J2EE
• Data Base :

11
 6.SOFTWARE DESIGN

INPUT DESIGN

The input design is the link between the information system and the user. It comprises the
developing specification and procedures for data preparation and those steps are necessary to put
transaction data in to a usable form for processing can be achieved by inspecting the computer to
read data from a written or printed document or it can occur by having people keying the data
directly into the system. The design of input focuses on controlling the amount of input required,
controlling the errors, avoiding delay, avoiding extra steps and keeping the process simple. The
input is designed in such a way so that it provides security and ease of use with retaining the
privacy. Input Design considered the following things:
 What data should be given as input?
 How the data should be arranged or coded?
 The dialog to guide the operating personnel in providing input.
 Methods for preparing input validations and steps to follow when error occur.

OBJECTIVES

1.Input Design is the process of converting a user-oriented description of the input into a
computer-based system. This design is important to avoid errors in the data input process and
show the correct direction to the management for getting correct information from the
computerized system.

2. It is achieved by creating user-friendly screens for the data entry to handle large volume of data.
The goal of designing input is to make data entry easier and to be free from errors. The data entry
screen is designed in such a way that all the data manipulates can be performed. It also provides
record viewing facilities.
3.When the data is entered it will check for its validity. Data can be entered with the help of
screens. Appropriate messages are provided as when needed so that the user
will not be in maize of instant. Thus the objective of input design is to create an input layout that
is easy to follow
12
OUTPUT DESIGN

A quality output is one, which meets the requirements of the end user and presents the information
clearly. In any system results of processing are communicated to the users and to other system
through outputs. In output design it is determined how the information is to be displaced for
immediate need and also the hard copy output. It is the most important and direct source
information to the user. Efficient and intelligent output design improves the system’s relationship
to help user decision-making.
1. Designing computer output should proceed in an organized, well thought out manner; the right
output must be developed while ensuring that each output element is designed so that people will
find the system can use easily and effectively. When analysis design computer output, they should
Identify the specific output that is needed to meet the requirements.
2.Select methods for presenting information.
3.Create document, report, or other formats that contain information produced by the system.
The output form of an information system should accomplish one or more of the following
objectives.
 Convey information about past activities, current status or projections of the
 Future.
 Signal important events, opportunities, problems, or warnings.
 Trigger an action.
 Confirm an action.

13
SYSTEM ARCHITECTURE

14
6.1 DATA FLOW DIAGRAM:

1. The DFD is also called as bubble chart. It is a simple graphical formalism that can be used to
represent a system in terms of input data to the system, various processing carried out on this data,
and the output data is generated by this system.
2. The data flow diagram (DFD) is one of the most important modeling tools. It is used to model the
system components. These components are the system process, the data used by the process, an
external entity that interacts with the system and the information flows in the system.
3. DFD shows how the information moves through the system and how it is modified by a series of
transformations. It is a graphical technique that depicts information flow and the transformations
that are applied as data moves from input to output.
4. DFD is also known as bubble chart. A DFD may be used to represent a system at any level of
abstraction.
DFD may be partitioned into levels that represent increasing information flow and functional detail.

15
16
6.2 UML DIAGRAMS

UML stands for Unified Modeling Language. UML is a standardized general-purpose modeling
language in the field of object-oriented software engineering. The standard is managed, and was
created by, the Object Management Group.
The goal is for UML to become a common language for creating models of object oriented computer
software. In its current form UML is comprised of two major components: a Meta-model and a
notation. In the future, some form of method or process may also be added to; or associated with,
UML.
The Unified Modeling Language is a standard language for specifying, Visualization, Constructing
and documenting the artifacts of software system, as well as for business modeling and other non-
software systems.
The UML represents a collection of best engineering practices that have proven successful in the
modeling of large and complex systems.
The UML is a very important part of developing object oriented software and the software
development process. The UML uses mostly graphical notations to express the design of software
projects.

GOALS:
The Primary goals in the design of the UML are as follows:
1. Provide users a ready-to-use, expressive visual modeling Language so that they can develop and
exchange meaningful models.
2. Provide extendibility and specialization mechanisms to extend the core concepts.
3. Be independent of particular programming languages and development process.
4. Provide a formal basis for understanding the modeling language.
5. Encourage the growth of OO tools market.
6. Support higher level development concepts such as collaborations, frameworks, patterns and
components.
7. Integrate best practices.

17
6.3 USE CASE DIAGRAM

A use case diagram in the Unified Modeling Language (UML) is a type of behavioral diagram defined
by and created from a Use-case analysis. Its purpose is to present a graphical overview of the
functionality provided by a system in terms of actors, their goals (represented as use cases), and any
dependencies between those use cases. The main purpose of a use case diagram is to show what
system functions are performed for which actor. Roles of the actors in the system can be depicted.

18
6.4 CLASS DIAGRAM

In software engineering, a class diagram in the Unified Modeling Language (UML) is a type of static
structure diagram that describes the structure of a system by showing the system's classes, their
attributes, operations (or methods), and the relationships among the classes. It explains which class
contains information.

19
6.5 SEQUENCE DIAGRAM

A sequence diagram in Unified Modelling Language (UML) is a kind of interaction diagram that
shows how processes operate with one another and in what order. It is a construct of a Message
Sequence Chart.
Sequence diagrams are sometimes called event diagrams, event scenarios, and timing diagrams.

Admin Storage User

Adding File
20
6.6 ACTIVITY DIAGRAM

Activity diagrams are graphical representations of workflows of stepwise activities and actions with
support for choice, iteration and concurrency. In the Unified Modeling Language, activity diagrams
can be used to describe the business and operational step-by-step workflows of components in a

system. An activity diagram shows the overall flow of control.

21
 7.IMPLEMENTATION

MODULES

 Data Owner Module

 Data User Module

22
  Cloud server and Encryption Module
  Rank Search Module

MODULES DESCRIPTION

7.1 Data Owner Module

This module helps the owner to register those details and also include login details. This module helps
the owner to upload his file with encryption using RSA algorithm. This ensures the files to be
protected from unauthorized user. Data owner has a collection of documents F ={f1; f2; :::; fn} that he
wants to outsource to the cloud server in encrypted form while still keeping the capability to search on
them for effective utilization. In our scheme, the data owner firstly builds a secure searchable tree
index I from document collection F, and then generates an encrypted document collection C for F.
Afterwards, the data owner outsources the encrypted collection C and the secure index I to the cloud
server, and securely distributes the key information of trapdoor generation and document decryption to
the authorized data users. Besides, the data owner is responsible for the update operation of his
documents stored in the cloud server. While updating, the data owner generates the update information
locally and sends it to the server.

7.2 Data User Module

This module includes the user registration login details. This module is used to help the client to search
the file using the multiple key words concept and get the accurate result list based on the user query.
The user is going to select the required file and register the user details and get activation code in mail
email before enter the activation code. After user can download the Zip file and extract that file. Data
users are authorized ones to access the documents of data owner. With t query keywords, the
authorized user can generate a trapdoor TD according to search control mechanisms to fetch k
encrypted documents from cloud server.
Then, the data user can decrypt the documents with the shared secret key.

7.3 Cloud Server and Encryption Module

This module is used to help the server to encrypt the document using RSA Algorithm and to convert
the encrypted document to the Zip file with activation code and then activation code send to the user
for download. Cloud server stores the encrypted document collection C and the encrypted searchable
tree index I for data owner. Upon receiving the trapdoor TD from the data user, the cloud server

23
executes search over the index tree I, and finally returns the corresponding collection of top- k ranked
encrypted documents. Besides, upon receiving the update information from the data owner, the server
needs to update the index I and document collection C according to the received information. The
cloud server in the proposed scheme is considered as “honest-but-curious”, which is employed by lots
of works on secure cloud data search

7.4 Rank Search Module

These modules ensure the user to search the files that are searched frequently using rank search. This
module allows the user to download the file using his secret key to decrypt the downloaded data. This
module allows the Owner to view the uploaded files and downloaded files. The proposed scheme is
designed to provide not only multi-keyword query and accurate result ranking, but also dynamic
update on document collections. The scheme is designed to prevent the cloud server from learning
additional information about the document collection, the index tree, and the query.

.SAMPLE CODE

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"

"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

<html xmlns="http://www.w3.org/1999/xhtml">
24
<head>

<title>Privacy-Preserving Multi-Keyword Ranked

Search over Encrypted Cloud Data</title>

<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />

<link href="style.css" rel="stylesheet" type="text/css" />

<script type="text/javascript" src="js/jquery-1.3.2.min.js"></script>

<script type="text/javascript" src="js/script.js"></script>

<script type="text/javascript" src="js/cufon-yui.js"></script>

<script type="text/javascript" src="js/arial.js"></script>

<script type="text/javascript" src="js/cuf_run.js"></script>

<script>

function check(){

var a = document.ff.user.value;

var b = document.ff.pass.value;

if(a==0){

alert('Please Enter UserId');

return false;

document.getElementById("name").focus();

} if(b==0){

alert('Please Enter Password');

return false;

document.getElementById("pass").focus();

}
25
</script>

</head>

<body>

<div class="main">

<div class="search">

<div class="clr"></div>

</div>

<div class="clr"></div>

<div class="header">

<div class="logo">

<h1><a href="index.html"><span>Privacy-Preserving Multi-Keyword Ranked

Search over Encrypted Cloud Data</span></a></h1>

</div>

<div class="clr"></div>

</div>

<div class="hbg"><img src="images/header_images.jpg" width="970" height="294" alt="" /></div>

<div class="content">

<div class="mainbar">

<div class="article">

<h2><span>Data Owner Login Here..!</span></h2>

<div class="clr"></div>

<img src="images/log.jpg" width="613" height="193" alt="" />

<form action="adminaction.jsp" name="ff" method="get" onsubmit="return check()">

26
UserId: <br><input type="text" name="user" id="user" style="background: #00ccff; height: 28px;
width:250px;"><br><br>

Password: <br><input type="password" name="pass" id="pass" style="background: #00ccff; height:

28px; width:250px;"><br><br>

<div style="margin-left: 3px;">

<input type="submit" value="Login" style="background-color: green; width: 80px; height: 30px;

border: 4px; font-weight: bold;">&nbsp;&nbsp;&nbsp;

</form>

<input type="reset" value="Clear" style="background-color: red; height: 30px; width: 80px; border:
4px; font-weight: bold;"></div>

<%

if(request.getParameter("msgg")!=null) {

out.println("<script>alert('Error Found..!!')</script>");

%>

</div>

</div>

<div class="sidebar">

<div class="gadget">

<h2><span>Sidebar</span> Menu</h2>

<div class="clr"></div>

<ul class="sb_menu">

<li class="active"><a href="index.jsp">Home</a></li>

<li><a href="adminlog.jsp">Data Owner</a></li>

<li><a href="userlog.jsp">User Login</a></li>

27
</ul>

</div>

<div class="clr"></div>

</div>

<div class="clr"></div>

<div class="fbg">

<div class="clr"></div>

</div>

<div class="footer">

<p class="lf">&copy; Copyright <a href="">JP Info Tech</a>.</p>

<div class="clr"></div>

</div>

</div>

</body>

</html>

28
<%@page import="sun.rmi.log.LogInputStream"%>
<%@page import="java.sql.ResultSet"%>
<%@page import="java.sql.Statement"%>
<%@page import="pack.DbConnector"%>
<%@page import="java.sql.Connection"%>
<%
String usr = request.getParameter("user");
String pas = request.getParameter("pass");

Connection con = DbConnector.getConnection();

Statement st = con.createStatement();
ResultSet rs = st.executeQuery(" select * from regpage where userid='"+usr+"'");
if(rs.next()){
if(rs.getString("userid").equals(usr)&&(rs.getString("pass").equals(pas)))
{
session.setAttribute("me", usr);
response.sendRedirect("userpage.jsp?msg=sucess");
}
else{
response.sendRedirect("userlog.jsp?msgg=fails");
}
}
else{
response.sendRedirect("userlog.jsp?msgg=fails");
}

%>

29
 8.SOFTWARE ENVIRONMENT

8.1 JAVA TECHNOLOGY

Java technology is both a programming language and a platform.

The Java Programming Language

The Java programming language is a high-level language that can be characterized by all of the
following buzzwords:
▪ Simple
▪ Architecture neutral
▪ Object oriented
▪ Portable
▪ Distributed
▪ High performance
▪ Interpreted
▪ Multithreaded
▪ Robust
▪ Dynamic
▪ Secure

With most programming languages, you either compile or interpret a program so that you can run it on
your computer. The Java programming language is unusual in that a program is both compiled and
interpreted. With the compiler, first you translate a program into an intermediate language called Java
byte codes —the platform-independent codes interpreted by the interpreter on the Java platform. The
interpreter parses and runs each Java byte code instruction on the computer. Compilation happens just
once; interpretation occurs each time the program is executed. The following figure illustrates how this
works.

30
You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java
VM). Every Java interpreter, whether it’s a development tool or a Web browser that can run applets, is
an implementation of the Java VM. Java byte codes help make “write once, run anywhere” possible.
You can compile your program into byte codes on any platform that has a Java compiler. The byte
codes can then be run on any implementation of the Java VM. That means that as long as a computer
has a Java VM, the same program written in the Java programming language can run on Windows
2000, a Solaris workstation, or on an iMac.

8.2 THE JAVA PLATFORM

A platform is the hardware or software environment in which a program runs. We’ve already
mentioned some of the most popular platforms like Windows 2000, Linux, Solaris, and MacOS. Most
platforms can be described as a combination of the operating system and hardware. The Java platform
differs from most other platforms in that it’s a software-only platform that runs on top of other
hardware-based platforms.

The Java platform has two components:

• The Java Virtual Machine (Java VM)
• The Java Application Programming Interface (Java API)
You’ve already been introduced to the Java VM. It’s the base for the Java platform and is ported onto
various hardware-based platforms.

The Java API is a large collection of ready-made software components that provide many useful
capabilities, such as graphical user interface (GUI) widgets. The Java API is grouped into libraries of

31
related classes and interfaces; these libraries are known as packages. The next section, What Can Java
Technology Do?

Highlights what functionality some of the packages in the Java API provide.

The following figure depicts a program that’s running on the Java platform. As the figure shows, the
Java API and the virtual machine insulate the program from the hardware.

Native code is code that after you compile it, the compiled code runs on a specific hardware platform.
As a platform-independent environment, the Java platform can be a bit slower than native code.
However, smart compilers, well-tuned interpreters, and just-in-time byte code compilers can bring
performance close to that of native code without threatening portability.

8.3 JAVA TECHNOLOGY

The most common types of programs written in the Java programming language are applets and
applications. If you’ve surfed the Web, you’re probably already familiar with applets. An applet is a
program that adheres to certain conventions that allow it to run within a Java-enabled browser.

However, the Java programming language is not just for writing cute, entertaining applets for the Web.
The general-purpose, high-level Java programming language is also a powerful software platform.
Using the generous API, you can write many types of programs.
An application is a standalone program that runs directly on the Java platform. A special kind of
application known as a server serves and supports clients on a network. Examples of servers are Web
servers, proxy servers, mail servers, and print servers. Another specialized program is a servlet. A
servlet can almost be thought of as an applet that runs on the server side. Java Servlets are a popular
choice for building interactive web applications, replacing the use of CGI scripts. Servlets are similar
to applets in that they are runtime extensions of applications. Instead of working in browsers, though,
servlets run within Java Web servers, configuring or tailoring the server.

32
How does the API support all these kinds of programs? It does so with packages of software
components that provides a wide range of functionality. Every full implementation of the Java
platform gives you the following features:
• The essentials: Objects, strings, threads, numbers, input and output, data structures, system
properties, date and time, and so on.
• Applets: The set of conventions used by applets.
• Networking: URLs, TCP (Transmission Control Protocol), UDP (User Data gram Protocol)
sockets, and IP (Internet Protocol) addresses.
• Internationalization: Help for writing programs that can be localized for users worldwide.
Programs can automatically adapt to specific locales and be displayed in the appropriate language.
• Security: Both low level and high level, including electronic signatures, public and private key
management, access control, and certificates.
• Software components: Known as JavaBeansTM, can plug into existing component architectures.
• Object serialization: Allows lightweight persistence and communication via Remote Method
Invocation (RMI).
• Java Database Connectivity (JDBCTM): Provides uniform access to a wide range of relational
databases.

The Java platform also has APIs for 2D and 3D graphics, accessibility, servers, collaboration,
telephony, speech, animation, and more. The following figure depicts what is included in the Java 2
SDK.

……

33
HOW WILL JAVA TECHNOLOGY CHANGE MY LIFE?

We can’t promise you fame, fortune, or even a job if you learn the Java programming language. Still,
it is likely to make your programs better and requires less effort than other languages. We believe that
Java technology will help you do the following:
• Get started quickly: Although the Java programming language is a powerful object-oriented
language, it’s easy to learn, especially for programmers already familiar with C or C++.
• Write less code: Comparisons of program metrics (class counts, method counts, and so on)
suggest that a program written in the Java programming language can be four times smaller than
the same program in C++.
• Write better code: The Java programming language encourages good coding practices, and its
garbage collection helps you avoid memory leaks. Its object orientation, its JavaBeans component
architecture, and its wide-ranging, easily extendible API let you reuse other people’s tested code
and introduce fewer bugs.
• Develop programs more quickly: Your development time may be as much as twice as fast versus
writing the same program in C++. Why? You write fewer lines of code and it is a simpler
programming language than C++.
• Avoid platform dependencies with 100% Pure Java: You can keep your program portable by
avoiding the use of libraries written in other languages. The 100% Pure Java TM Product
Certification Program has a repository of historical process manuals, white papers, brochures, and
similar materials online.
• Write once, run anywhere: Because 100% Pure Java programs are compiled into machine-
independent byte codes, they run consistently on any Java platform.
• Distribute software more easily: You can upgrade applets easily from a central server. Applets
take advantage of the feature of allowing new classes to be loaded “on the fly,” without
recompiling the entire program.

8.4 MICROSOFT OPEN DATABASE CONNECTIVITY (ODBC)

Microsoft Open Database Connectivity (ODBC) is a standard programming interface for application
developers and database systems providers. Before ODBC became a de facto standard for Windows
programs to interface with database systems, programmers had to use proprietary languages for each
database they wanted to connect to. Now, ODBC has made the choice of the database system almost
irrelevant from a coding perspective, which is as it should be. Application developers have much more
34
important things to worry about than the syntax that is needed to port their program from one database
to another when business needs suddenly change.
Through the ODBC Administrator in Control Panel, you can specify the particular database that is
associated with a data source that an ODBC application program is written to use. Think of an ODBC
data source as a door with a name on it. Each door will lead you to a particular database. For example,
the data source named Sales Figures might be a SQL Server database, whereas the Accounts Payable
data source could refer to an Access database. The physical database referred to by a data source can
reside anywhere on the LAN.

The ODBC system files are not installed on your system by Windows 95. Rather, they are installed
when you setup a separate database application, such as SQL Server Client or Visual Basic 4.0. When
the ODBC icon is installed in Control Panel, it uses a file called ODBCINST.DLL. It is also possible
to administer your ODBC data sources through a stand-alone program called ODBCADM.EXE. There
is a 16-bit and a 32-bit version of this program and each maintains a separate list of ODBC data
sources.

From a programming perspective, the beauty of ODBC is that the application can be written to use the
same set of function calls to interface with any data source, regardless of the database vendor. The
source code of the application doesn’t change whether it talks to Oracle or SQL Server. We only
mention these two as an example. There are ODBC drivers available for several dozen popular
database systems. Even Excel spreadsheets and plain text files can be turned into data sources. The
operating system uses the Registry information written by ODBC Administrator to determine which
low-level ODBC drivers are needed to talk to the data source (such as the interface to Oracle or SQL
Server). The loading of the ODBC drivers is transparent to the ODBC application program. In a
client/server environment, the ODBC API even handles many of the network issues for the application
programmer.

The advantages of this scheme are so numerous that you are probably thinking there must be some
catch.
The only disadvantage of ODBC is that it isn’t as efficient as talking directly to the native database
interface. ODBC has had many detractors make the charge that it is too slow. Microsoft has always
claimed that the critical factor in performance is the quality of the driver software that is used. In our
humble opinion, this is true. The availability of good ODBC drivers has improved a great deal

35
recently. And anyway, the criticism about performance is somewhat analogous to those who said that
compilers would never match the speed of pure assembly language. Maybe not, but the compiler (or
ODBC) gives you the opportunity to write cleaner programs, which means you finish sooner.
Meanwhile, computers get faster every year.

8.5 JAVA DATABASE CONNECTIVITY (JDBC)

In an effort to set an independent database standard API for Java; Sun Microsystems developed Java
Database Connectivity, or JDBC. JDBC offers a generic SQL database access mechanism that
provides a consistent interface to a variety of RDBMSs. This consistent interface is achieved through
the use of “plugin” database connectivity modules, or drivers. If a database vendor wishes to have
JDBC support, he or she must provide the driver for each platform that the database and Java run on.
To gain a wider acceptance of JDBC, Sun based JDBC’s framework on ODBC. As you discovered
earlier in this chapter, ODBC has widespread support on a variety of platforms. Basing JDBC on
ODBC will allow vendors to bring JDBC drivers to market much faster than developing a completely
new connectivity solution.
JDBC was announced in March of 1996. It was released for a 90 day public review that ended June 8,
1996. Because of user input, the final JDBC v1.0 specification was released soon after.
The remainder of this section will cover enough information about JDBC for you to know what it is
about and how to use it effectively. This is by no means a complete overview of JDBC. That would fill
an entire book.

8.6 JDBC GOALS

Few software packages are designed without goals in mind. JDBC is one that, because of its many
goals, drove the development of the API. These goals, in conjunction with early reviewer feedback,
have finalized the JDBC class library into a solid framework for building database applications in
Java.
The goals that were set for JDBC are important. They will give you some insight as to why certain
classes and functionalities behave the way they do. The eight design goals for JDBC are as follows:

8.6.1 SQL Level API

The designers felt that their main goal was to define a SQL interface for Java. Although not the
lowest database interface level possible, it is at a low enough level for higher-level tools and APIs

36
 to be created. Conversely, it is at a high enough level for application programmers to use it
confidently.
Attaining this goal allows for future tool vendors to “generate” JDBC code and to hide many of
JDBC’s complexities from the end user.

8.6.2. SQL Conformance

SQL syntax varies as you move from database vendor to database vendor. In an effort to support a
wide variety of vendors, JDBC will allow any query statement to be passed through it to the
underlying database driver. This allows the connectivity module to handle non-standard
functionality in a manner that is suitable for its users.

8.6.3. JDBC must be implemental on top of common database interfaces

The JDBC SQL API must “sit” on top of other common SQL level APIs. This goal allows JDBC
to use existing ODBC level drivers by the use of a software interface. This interface would
translate JDBC calls to ODBC and vice versa.

8.6.4. Provide a Java interface that is consistent with the rest of the Java system
Because of Java’s acceptance in the user community thus far, the designers feel that they should
not stray from the current design of the core Java system.

8.6.5. Keep it simple

This goal probably appears in all software design goal listings. JDBC is no exception. Sun felt that
the design of JDBC should be very simple, allowing for only one method of completing a task per
mechanism. Allowing duplicate functionality only serves to confuse the users of the API.

8.6.6. Use strong, static typing wherever possible

Strong typing allows for more error checking to be done at compile time; also, less error appear at
runtime.

8.6.7. Keep the common cases simple

Because more often than not, the usual SQL calls used by the programmer are simple SELECT’s,

INSERT’s, DELETE’s and UPDATE’s, these queries should be simple to perform with JDBC.

However, more complex SQL statements should also be possible.

Finally we decided to proceed the implementation using Java Networking.
And for dynamically updating the cache table we go for MS Access database.

37
Java has two things: a programming language and a platform.
Java is a high-level programming language that is all of the following

Simple Architecture-neutral
Object-oriented Portable
Distributed High-performance
Interpreted multithreaded
Robust Dynamic
Secure
Java is also unusual in that each Java program is both compiled and interpreted. With a
compile you translate a Java program into an intermediate language called Java byte codes the
platform-independent code instruction is passed and run on the computer.

Compilation happens just once; interpretation occurs each time the program is executed. The figure
illustrates how this works.

Java Program Interpreter

Compilers My Program

You can think of Java byte codes as the machine code instructions for the Java Virtual Machine (Java
VM). Every Java interpreter, whether it’s a Java development tool or a Web browser that can run
Java applets, is an implementation of the Java VM. The Java VM can also be implemented in
hardware.

Java byte codes help make “write once, run anywhere” possible. You can compile your Java
program into byte codes on my platform that has a Java compiler. The byte codes can then be

38
run any implementation of the Java VM. For example, the same Java program can run
Windows NT, Solaris, and Macintosh.
NETWORKING
TCP/IP STACK

The TCP/IP stack is shorter than the OSI one:

TCP is a connection-oriented protocol; UDP (User Datagram Protocol) is a connectionless protocol.

IP DATAGRAM’S

The IP layer provides a connectionless and unreliable delivery system. It considers each datagram
independently of the others. Any association between datagram must be supplied by the higher layers.
The IP layer supplies a checksum that includes its own header. The header includes the source and
destination addresses. The IP layer handles routing through an Internet. It is also responsible for
breaking up large datagram into smaller ones for transmission and reassembling them at the other end.

UDP

UDP is also connectionless and unreliable. What it adds to IP is a checksum for the contents of the
datagram and port numbers. These are used to give a client/server model - see later.

39
TCP

TCP supplies logic to give a reliable connection-oriented protocol above IP. It provides a virtual
circuit that two processes can use to communicate.
INTERNET ADDRESSES

In order to use a service, you must be able to find it. The Internet uses an address scheme for machines
so that they can be located. The address is a 32 bit integer which gives the IP address. This encodes a
network ID and more addressing. The network ID falls into various classes according to the size of the
network address.

NETWORK ADDRESS

Class A uses 8 bits for the network address with 24 bits left over for other addressing. Class B uses 16
bit network addressing. Class C uses 24 bit network addressing and class D uses all 32.

SUBNET ADDRESS

Internally, the UNIX network is divided into sub networks. Building 11 is currently on one sub
network and uses 10-bit addressing, allowing 1024 different hosts.

HOST ADDRESS

8 bits are finally used for host addresses within our subnet. This places a limit of 256 machines that
can be on the subnet.

TOTAL ADDRESS

The 32 bit address is usually written as 4 integers separated by dots.

40
PORT ADDRESSES

A service exists on a host, and is identified by its port. This is a 16 bit number. To send a message to a
server, you send it to the port for that service of the host that it is running on. This is not location
transparency! Certain of these ports are "well known".
SOCKETS

A socket is a data structure maintained by the system to handle network connections. A socket is

created using the call socket. It returns an integer that is like a file descriptor. In fact, under Windows,
this handle can be used with Read File and Write File functions.

#include <sys/types.h>
#include <sys/socket.h>
int socket(int family, int type, int protocol);

Here "family" will be AF_INET for IP communications, protocol will be zero, and type will depend on
whether TCP or UDP is used. Two processes wishing to communicate over a network create a socket
each.
These are similar to two ends of a pipe - but the actual pipe does not yet exist.

JFREE CHART

JFreeChart is a free 100% Java chart library that makes it easy for developers to display professional
quality charts in their applications. JFreeChart's extensive feature set includes:

A consistent and well-documented API, supporting a wide range of chart types;

A flexible design that is easy to extend, and targets both server-side and client-side applications;

Support for many output types, including Swing components, image files (including PNG and JPEG),
and vector graphics file formats (including PDF, EPS and SVG);

JFreeChart is "open source" or, more specifically, free software. It is distributed under the terms of the
GNU Lesser General Public Licence (LGPL), which permits use in proprietary applications.

41
1.MAP VISUALIZATIONS
Charts showing values that relate to geographical areas. Some examples include: (a) population
density in each state of the United States, (b) income per capita for each country in Europe, (c) life
expectancy in each country of the world. The tasks in this project include:

Sourcing freely redistributable vector outlines for the countries of the world, states/provinces in
particular countries (USA in particular, but also other areas).

Creating an appropriate dataset interface (plus default implementation), a rendered, and integrating this
with the existing XYPlot class in JFreeChart.
Testing, documenting, testing some more, documenting some more.

2. TIME SERIES CHART INTERACTIVITY

Implement a new (to JFreeChart) feature for interactive time series charts --- to display a separate
control that shows a small version of ALL the time series data, with a sliding "view" rectangle that
allows you to select the subset of the time series data to display in the main chart.

3. DASHBOARDS
There is currently a lot of interest in dashboard displays. Create a flexible dashboard mechanism that
supports a subset of JFreeChart chart types (dials, pies, thermometers, bars, and lines/time series) that
can be delivered easily via both Java Web Start and an applet.

4. PROPERTY EDITORS
The property editor mechanism in JFreeChart only handles a small subset of the properties that can be
set for charts. Extend (or reimplement) this mechanism to provide greater end-user control over the
appearance of the charts.

J2ME (JAVA 2 MICRO EDITION)

Sun Microsystems defines J2ME as "a highly optimized Java run-time environment targeting a wide
range of consumer products, including pagers, cellular phones, screen-phones, digital set-top boxes
and car navigation systems." Announced in June 1999 at the JavaOne Developer Conference, J2ME
brings the cross-platform functionality of the Java language to smaller devices, allowing mobile
wireless devices to share applications. With J2ME, Sun has adapted the Java platform for consumer
products that incorporate or are based on small computing devices.

42
1. GENERAL J2ME ARCHITECTURE

J2ME uses configurations and profiles to customize the Java Runtime Environment (JRE). As a
complete JRE, J2ME is comprised of a configuration, which determines the JVM used, and a profile,
which defines the application by adding domain-specific classes. The configuration defines the basic
run-time environment as a set of core classes and a specific JVM that run on specific types of devices.
We'll discuss configurations in detail in the The profile defines the application; specifically, it adds
domain-specific classes to the J2ME configuration to define certain uses for devices. We'll cover
profiles in depth in the The following graphic depicts the relationship between the different virtual
machines, configurations, and profiles. It also draws a parallel with the J2SE API and its Java virtual
machine. While the J2SE virtual machine is generally referred to as a JVM, the J2ME virtual
machines, KVM and CVM, are subsets of JVM. Both KVM and CVM can be thought of as a kind of
Java virtual machine -- it's just that they are shrunken versions of the J2SE JVM and are specific to
J2ME.

2.DEVELOPING J2ME APPLICATIONS

Introduction In this section, we will go over some considerations you need to keep in mind when
developing applications for smaller devices. We'll take a look at the way the compiler is invoked when
using J2SE to compile J2ME applications. Finally, we'll explore packaging and deployment and the
role preverification plays in this process.

3.DESIGN CONSIDERATIONS FOR SMALL DEVICES

Developing applications for small devices requires you to keep certain strategies in mind during the
design phase. It is best to strategically design an application for a small device before you begin
coding. Correcting the code because you failed to consider all of the "gotchas" before developing the
application can be a painful process. Here are some design strategies to consider:

43
* Keep it simple. Remove unnecessary features, possibly making those features a separate,
secondary application.

* Smaller is better. This consideration should be a "no brainer" for all developers. Smaller
applications use less memory on the device and require shorter installation times. Consider packaging
your Java applications as compressed Java Archive (jar) files.

* Minimize run-time memory use. To minimize the amount of memory used at run time, use
scalar types in place of object types. Also, do not depend on the garbage collector. You should manage
the memory efficiently yourself by setting object references to null when you are finished with them.
Another way to reduce run-time memory is to use lazy instantiation, only allocating objects on an as-
needed basis. Other ways of reducing overall and peak memory use on small devices are to release
resources quickly, reuse objects, and avoid exceptions.

4.CONFIGURATIONS OVERVIEW

The configuration defines the basic run-time environment as a set of core classes and a specific JVM
that run on specific types of devices. Currently, two configurations exist for J2ME, though others may
be defined in the future:

Connected Limited Device Configuration (CLDC) is used specifically with the KVM for 16-bit or
32-bit devices with limited amounts of memory. This is the configuration (and the virtual machine)
used for developing small J2ME applications. Its size limitations make CLDC more interesting and
challenging (from a development point of view) than CDC. CLDC is also the configuration that we
will use for developing our drawing tool application. An example of a small wireless device running
small applications is a Palm hand-held computer.

* Connected Device Configuration (CDC) is used with the C virtual machine (CVM) and is
used for 32bit architectures requiring more than 2 MB of memory. An example of such a device is a
Net TV box.

5.J2ME PROFILES

As we mentioned earlier in this tutorial, a profile defines the type of device supported. The Mobile
Information Device Profile (MIDP), for example, defines classes for cellular phones. It adds
domainspecific classes to the J2ME configuration to define uses for similar devices. Two profiles have
been defined for J2ME and are built upon CLDC: KJava and MIDP. Both KJava and MIDP are
associated with CLDC and smaller devices. Profiles are built on top of configurations. Because
44
profiles are specific to the size of the device (amount of memory) on which an application runs, certain
profiles are associated with certain configurations.

A skeleton profile upon which you can create your own profile, the Foundation Profile, is available for
CDC.

Profile 1: KJava

KJava is Sun's proprietary profile and contains the KJava API. The KJava profile is built on top of the
CLDC configuration. The KJava virtual machine, KVM, accepts the same byte codes and class file
format as the classic J2SE virtual machine. KJava contains a Sun-specific API that runs on the Palm
OS. The KJava API has a great deal in common with the J2SE Abstract Windowing Toolkit (AWT).
However, because it is not a standard J2ME package, its main package is com.sun.kjava. We'll learn
more about the KJava API later in this tutorial when we develop some sample applications.

Profile 2: MIDP

MIDP is geared toward mobile devices such as cellular phones and pagers. The MIDP, like KJava, is
built upon CLDC and provides a standard run-time environment that allows new applications and
services to be deployed dynamically on end user devices. MIDP is a common, industry-standard
profile for mobile devices that is not dependent on a specific vendor. It is a complete and supported
foundation for mobile application

development. MIDP contains the following packages, the first three of which are core CLDC
packages, plus three MIDP-specific packages.

* java.lang

* java.io

* java.util

* javax.microedition.io

* javax.microedition.lcdui

* javax.microedition.midlet

* javax.microedition.rms

45
 9.SYSTEM TESTING
The purpose of testing is to discover errors. Testing is the process of trying to discover every
conceivable fault or weakness in a work product. It provides a way to check the functionality of
components, sub assemblies, assemblies and/or a finished product It is the process of exercising
software with the intent of ensuring that the

Software system meets its requirements and user expectations and does not fail in an unacceptable
manner.
There are various types of test. Each test type addresses a specific testing requirement.

TYPES OF TESTS

9.1 UNIT TESTING

Unit testing involves the design of test cases that validate that the internal program logic is functioning
properly, and that program inputs produce valid outputs. All decision branches and internal code flow
should be validated. It is the testing of individual software units of the application .it is done after the
completion of an individual unit before integration. This is a structural testing, that relies on
knowledge of its construction and is invasive. Unit tests perform basic tests at component level and
test a specific business process, application, and/or system configuration. Unit tests ensure that each
unique path of a business process performs accurately to the documented specifications and contains
clearly defined inputs and expected results.

9.2 INTEGRATION TESTING

Integration tests are designed to test integrated software components to determine if they actually run
as one program. Testing is event driven and is more concerned with the basic outcome of screens or

46
fields. Integration tests demonstrate that although the components were individually satisfaction, as
shown by successfully unit testing, the combination of components is correct and consistent.
Integration testing is specifically aimed at exposing the problems that arise from the combination of
components.

9.3 FUNCTIONAL TEST

Functional tests provide systematic demonstrations that functions tested are available as specified by
the business and technical requirements, system documentation, and user manuals.

Functional testing is centered on the following items:

Valid Input : identified classes of valid input must be accepted.

Invalid Input : identified classes of invalid input must be rejected.

Functions : identified functions must be exercised.

Output : identified classes of application outputs must be exercised.

Systems/Procedures: interfacing systems or procedures must be invoked.

Organization and preparation of functional tests is focused on requirements, key functions, or special
test cases. In addition, systematic coverage pertaining to identify Business process flows; data fields,
predefined processes, and successive processes must be considered for testing. Before functional
testing is complete, additional tests are identified and the effective value of current tests is determined.

9.4 SYSTEM TEST

System testing ensures that the entire integrated software system meets requirements. It tests a
configuration to ensure known and predictable results. An example of system testing is the
configuration oriented system integration test. System testing is based on process descriptions and
flows, emphasizing pre-driven process links and integration points.

9.5 WHITE BOX TESTING

White Box Testing is a testing in which in which the software tester has knowledge of the inner
workings, structure and language of the software, or at least its purpose. It is purpose. It is used to test
areas that cannot be reached from a black box level.

9.6 BLACK BOX TESTING

47
Black Box Testing is testing the software without any knowledge of the inner workings, structure or
language of the module being tested. Black box tests, as most other kinds of tests, must be written
from a definitive source document, such as specification or requirements document, such as
specification or requirements document. It is a testing in which the software under test is treated, as a
black box you cannot
“see” into it. The test provides inputs and responds to outputs without considering how the software
works.

UNIT TESTING

Unit testing is usually conducted as part of a combined code and unit test phase of the software
lifecycle, although it is not uncommon for coding and unit testing to be conducted as two distinct
phases.

Test strategy and approach

Field testing will be performed manually and functional tests will be written in detail.

Test objectives

• All field entries must work properly.

• Pages must be activated from the identified link.
• The entry screen, messages and responses must not be delayed.

Features to be tested
• Verify that the entries are of the correct format
• No duplicate entries should be allowed
• All links should take the user to the correct page.

INTEGRATION TESTING

Software integration testing is the incremental integration testing of two or more integrated software
components on a single platform to produce failures caused by interface defects.

The task of the integration test is to check that components or software applications, e.g. components
in a software system or – one step up – software applications at the company level – interact without
error.

Test Results: All the test cases mentioned above passed successfully. No defects encountered.
48
ACCEPTANCE TESTING
User Acceptance Testing is a critical phase of any project and requires significant participation by the
end user. It also ensures that the system meets the functional requirements.

Test Results: All the test cases mentioned above passed successfully. No defects encountered.

10.SYSTEM STUDY

10.1 FEASIBILITY STUDY

The feasibility of the project is analyzed in this phase and business proposal is put forth
with a very general plan for the project and some cost estimates. During system analysis the feasibility
study of the proposed system is to be carried out. This is to ensure that the proposed system is not a
burden to the company. For feasibility analysis, some understanding of the major requirements for the
system is essential.

Three key considerations involved in the feasibility analysis are

 ECONOMICAL FEASIBILITY
 TECHNICAL FEASIBILITY
 SOCIAL FEASIBILITY

10.2 ECONOMICAL FEASIBILITY

This study is carried out to check the economic impact that the system will have on the
organization. The amount of fund that the company can pour into the research and development of
the system is limited. The expenditures must be justified. Thus the developed system as well

49
 within the budget and this was achieved because most of the technologies used are freely
available. Only the customized products had to be purchased.

10.3TECHNICAL FEASIBILITY

This study is carried out to check the technical feasibility, that is, the technical
requirements of the system. Any system developed must not have a high demand on the available
technical resources. This will lead to high demands on the available technical resources. This will
lead to high demands being placed on the client. The developed system must have a modest
requirement, as only minimal or null changes are required for implementing this system.

10.4 SOCIAL FEASIBILITY

The aspect of study is to check the level of acceptance of the system by the user. This
includes the process of training the user to use the system efficiently. The user must not feel
threatened by the system, instead must accept it as a necessity. The level of acceptance by the
users solely depends on the methods that are employed to educate the user about the system and to
make him familiar with it. His level of confidence must be raised so that he is also able to make
some constructive criticism, which is welcomed, as he is the final user of the system.

50
 11.CONCLUSION

In this paper, a secure, efficient and dynamic search scheme is proposed, which supports not only
the accurate multi-keyword ranked search but also the dynamic deletion and insertion of
documents. We construct a special keyword balanced binary tree as the index, and propose a
“Greedy Depth-first Search” algorithm to obtain better efficiency than linear search. In addition,
the parallel search process can be carried out to further reduce the time cost. The security of the
scheme is protected against two threat models by using the secure kNN algorithm. Experimental
results demonstrate the efficiency of our proposed scheme. There are still many challenge
problems in symmetric SE schemes. In the proposed scheme, the data owner is responsible for
generating updating information and sending them to the cloud server. Thus, the data owner needs
to store the unencrypted index tree and the information that are necessary to recalculate the IDF
values. Such an active data owner may not be very suitable for the cloud computing model. It
could be a meaningful but difficult future work to design a dynamic searchable encryption scheme
whose updating operation can be completed by cloud server only, meanwhile reserving the ability
to support multi-keyword ranked search. In addition, as the most of works about searchable
encryption, our scheme mainly considers the challenge from the cloud server. Actually, there are
many secure challenges in a multi-user scheme. Firstly, all the users usually keep the same secure
key for trapdoor generation in a symmetric SE scheme. In this case, the revocation of the user is
big challenge. If it is needed to revoke a user in this scheme, we need to rebuild the index and
distribute the new secure keys to all the authorized users. Secondly, symmetric SE schemes
usually assume that all the data users are trustworthy. It is not practical and a dishonest data user
will lead to many secure problems. For example, a dishonest data user may search the documents
and distribute the decrypted documents to the unauthorized ones. Even more, a dishonest data user

51
may distribute his/her secure keys to the unauthorized ones. In the future works, we will try to
improve the SE scheme to handle these challenge problems.

12.REFERENCES

[1] K. Ren, C.Wang, Q.Wang et al., “Security challenges for the public cloud,” IEEE Internet
Computing, vol. 16, no. 1, pp. 69–73, 2012.

[2] S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Financial Cryptography and Data
Security. Springer, 2010, pp. 136–149.

[3] C. Gentry, “A fully homomorphic encryption scheme,” Ph.D. dissertation, Stanford University,
2009.

[4] O. Goldreich and R. Ostrovsky, “Software protection and simulation on oblivious rams,”
Journal of the ACM (JACM), vol. 43, no. 3, pp. 431–473, 1996.

[5] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with
keyword search,” in Advances in Cryptology-Eurocrypt 2004. Springer, 2004, pp. 506–522.

[6] D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that
allows pir queries,” in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.

[7] D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,”
in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000,
pp. 44–55.

52
[8] E.-J. Goh et al., “Secure indexes.” IACR Cryptology ePrint Archive, vol. 2003, p. 216, 2003.
[9] Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote
encrypted data,” in Proceedings of the Third international conference on Applied Cryptography
and Network Security. Springer-Verlag, 2005, pp. 442–455.

[10] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption:

improved definitions and efficient constructions,” in Proceedings of the 13th ACM conference on
Computer and communications security. ACM, 2006, pp. 79–88.

[11] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over
encrypted data in cloud computing,” in INFOCOM, 2010 Proceedings IEEE. IEEE, 2010, pp. 1–5.

[12] M. Kuzu, M. S. Islam, and M. Kantarcioglu, “Efficient similarity search over encrypted data,”
in Data Engineering (ICDE), 2012 IEEE 28th International Conference on. IEEE, 2012, pp.
1156–1167.

[13] C. Wang, K. Ren, S. Yu, and K. M. R. Urs, “Achieving usable and privacy-assured similarity
search over outsourced cloud data,” in INFOCOM, 2012 Proceedings IEEE. IEEE, 2012, pp. 451–
459.

[14] B. Wang, S. Yu, W. Lou, and Y. T. Hou, “Privacy-preserving multikeyword fuzzy search
over encrypted data in the cloud,” in IEEE INFOCOM, 2014.

[15] P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted
data,” in Applied Cryptography and Network Security. Springer, 2004, pp. 31–45.

[16] Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its
extension to a multi-user system,” in Proceedings of the First international conference on
Pairing-Based Cryptography. Springer-Verlag, 2007, pp. 2–22.

[17] L. Ballard, S. Kamara, and F. Monrose, “Achieving efficient conjunctive keyword searches
over encrypted data,” in Proceedings of the 7th international conference on Information and
Communications Security. Springer-Verlag, 2005, pp. 414–426.

53
[18] D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in
Proceedings of the 4th conference on Theory of cryptography. Springer-Verlag, 2007, pp. 535–
554.

[19] B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset
keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267,
2011.

[20] J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial
equations, and inner products,” in Advances in Cryptology–EUROCRYPT 2008. Springer, 2008,
pp. 146–162.

[21] E. Shen, E. Shi, and B. Waters, “Predicate privacy in encryption systems,” in Proceedings of
the 6th Theory of Cryptography Conference on Theory of Cryptography. Springer-Verlag, 2009,
pp. 457–473.

[22] A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, “Fully secure functional
encryption: attribute-based encryption and (hierarchical) inner product encryption,” in
Proceedings of the 29th Annual international conference on Theory and Applications of
Cryptographic Techniques. Springer-Verlag, 2010, pp. 62–91.

[23] A. Swaminathan, Y. Mao, G.-M. Su, H. Gou, A. L. Varna, S. He, M.Wu, and D.W. Oard,
“Confidentiality-preserving rank-ordered search,” in Proceedings of the 2007 ACM workshop on
Storage security and survivability. ACM, 2007, pp. 7–12.

[24] S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski, “Zerber+ r: Topk retrieval from a
confidential index,” in Proceedings of the 12th International Conference on Extending Database
Technology: Advances in Database Technology. ACM, 2009, pp. 439–449.

[25] C. Wang, N. Cao, K. Ren, and W. Lou, “Enabling secure and efficient ranked keyword search
over outsourced cloud data,” Parallel and Distributed Systems, IEEE Transactions on, vol. 23, no.
8, pp. 1467–1479, 2012.

54
[26] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked
search over encrypted cloud data,” in IEEE INFOCOM, April 2011, pp. 829–837.

[27] W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li, “Privacy-preserving multi-
keyword text search in the cloud supporting similarity-based ranking,” in Proceedings of the 8th
ACM SIGSAC symposium on Information, computer and communications security. ACM, 2013,
pp. 71–82.

[28] C. Orencik, M. Kantarcioglu, and E. Savas, “A practical and secure multi-keyword search
method over encrypted cloud data,” in Cloud Computing (CLOUD), 2013 IEEE Sixth
International Conference on. IEEE, 2013, pp. 390–397.

[29] W. Zhang, S. Xiao, Y. Lin, T. Zhou, and S. Zhou, “Secure ranked multi-keyword search for
multiple data owners in cloud computing,” in Dependable Systems and Networks (DSN), 2014
44th Annual IEEE/IFIP International Conference on. IEEE, 2014, pp. 276–286.

[30] S. Kamara, C. Papamanthou, and T. Roeder, “Dynamic searchable symmetric encryption,” in

Proceedings of the 2012 ACM conference on Computer and communications security. ACM,
2012, pp. 965–976.

[31] S. Kamara and C. Papamanthou, “Parallel and dynamic searchable symmetric encryption,” in
Financial Cryptography and Data Security. Springer, 2013, pp. 258–274.

[32] D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Ros¸u, and M. Steiner, “Highly-scalable
searchable symmetric encryption with support for boolean queries,” in Advances in Cryptology–
CRYPTO 2013. Springer, 2013, pp. 353–373.

[33] D. Cash, J. Jaeger, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, “Dynamic
searchable encryption in very large databases: Data structures and implementation,” in Proc. of
NDSS, vol. 14, 2014.

[34] C. D. Manning, P. Raghavan, and H. Sch ¨ utze, Introduction to information retrieval.

Cambridge university press Cambridge, 2008, vol. 1.

55
[35] B. Gu and V. S. Sheng, “Feasibility and finite convergence analysis for accurate on-line -
support vector learning,” IEEE Transactions on Neural Networks and Learning Systems, vol. 24,
no. 8, pp. 1304–1315, 2013.

[36] X. Wen, L. Shao, W. Fang, and Y. Xue, “Efficient feature selection and classification for
vehicle detection.”

[37] H. Delfs and H. Knebl, Introduction to cryptography: principles and applications. Springer,
2007.

[38] W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on
encrypted databases,” in Proceedings of the 2009 ACM SIGMOD International Conference on
Management of data. ACM, 2009, pp. 139–152.

[39] “Request for comments,” http://www.rfc-editor.org/index.html.

56
13.SCREEN SHOTS

57