A

Mini Project Report

On

A ANTI-COLLUSION DAT SHARING SCHEME

Submitted to Jawaharlal Nehru Technological University for the Partial fulfillment of the
requirement for the Award of Degree in

BACHELOR OF TECHNOLOGY
in

COMPUTER SCIENCE & ENGINEERING

Submitted by

NAME OF STUDENT (HALLTICKET NO.)

Under the Esteemed Guidance of

GUIDE NAME

Designation (CSE Dept.)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

JYOTHISHMATHI INSTITUTE OF TECHNOLOGY & SCIENCE
(Approved by AICTE, New Delhi, Affiliated to JNTU, HYDERABAD)

Nustulapur, Karimnagar - 505481. TELANGANA, INDIA

(2016-2017)
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
JYOTHISHMATHI INSTITUTE OF TECHNOLOGY & SCIENCE
(Approved by AICTE, New Delhi, Affiliated to JNTU, HYDERABAD)
NUSTULAPUR, KARIMNAGAR, TELANGANA – 505481

CERTIFICATE

This is to certify that the Mini Project Report entitled “PROJECT TITLE” is being
submitted by STUDENT NAME (HALL TICKET NUMBER) in partial fulfillment of the
requirements for the award of the Degree of Bachelor of Technology in Computer Science &
Engineering, to the Jyothishmathi Institute of Technology & Science, Karimnagar, during
academic year 2016-2017, is a bonafide work carried out by them under my guidance and
supervision.

The results presented in this Project Work have been verified and are found to be
satisfactory. The results embodied in this Project Work have not been submitted to any other
University for the award of any other degree or diploma.

Project Guide Head of the Department

GUIDE NAME, Dr. K. Srinivas,
Designation, Professor,
Dept. of CSE Dept. of CSE

iii
 ACKNOWLEDGEMENT

We would like to express our sincere gratitude to our advisor, GUIDE NAME,
Designation, CSE Dept., whose knowledge and guidance has motivated us to achieve
goals we never thought possible. The time we have spent working under his/her
supervision has truly been a pleasure.

The experience from this kind of work is great and will be useful to us in future.
We thank Dr K.SRINIVAS, Professor & HOD, CSE Department, for encouraging us to
do such research work and for providing all the facilities to carry out this project work.

It is a great pleasure to convey our thanks to our principal Prof. RamaKanta

Sahoo, Principal, Jyothishmathi Institute of Technology & Science and the College
Management for permitting us to undertake this project and providing excellent facilities
to carry out our project work.

We thank all the Faculty members of the Department of Computer Science &
Engineering for sharing their valuable knowledge with us. We extend our thanks to the
Technical Staff of the department for their valuable suggestion to technical problems.

iv
 DECLARATION

We hereby declare that the work which is being presented in this dissertation
entitled, “PROJECT TITLE”, submitted towards the partial fulfillment of the
requirements for the award of the degree of Bachelor of Technology in Computer
Science & Engineering, Jyothishmathi Institute of Technology & Science,
Karimnagar is an authentic record of our own work carried out under the supervision of
Mr. GUIDE NAME, Designation., Department of CSE, Jyothishmathi Institute of
Technology & Science, Karimnagar.

To the best of our knowledge and belief, this project bears no resemblance with
any report submitted to JNTUH or any other University for the award of any degree or
diploma.

STUDENT NAME (HALL TICKET No.)

Date:

Place:

v
 ABSTRACT

The Benefited from Cloud Computing, users (clients) can achieve an effective and
moderate approach (methodology) for information sharing among group members in
the cloud with the characters of low maintenance and little management cost.

Then, security certifications to the sharing data records will be given since they
are outsourced. Horribly, Due to the never-ending change of the enrolment, sharing
information while giving protection saving is still a testing issue, particularly for an
untrusted cloud because of the agreement attack.

In addition, for existing plans, the security of the key dispersion depends on the
safe communication channel, then again, to have such channel is a solid feeling and is
difficult for practice.

In this paper, we propose a safe information sharing plan for element individuals.
Firstly, we propose a safe route for key dispersion with no safe correspondence
channels, and the clients can safely acquire their private keys from gathering
administrator. Besides, the plan can accomplish fine-grained access control, any client
in the gathering can utilize the source in the scheme with the untrusted cloud. Finally,
our scheme can achieve fine efficiency, which means previous users need not to
update their private keys for the situation either a new user joins in the group or a user
is revoked from the group In this methodology, by utilizing polynomial capacity, we
can achieve a protected client denial plan. At long last, our plan can bring about fine
productivity, which implies past clients need not to overhaul their private keys for the
circumstance either another client joins in the gathering or a client is give up from the
gathering.

vi
 CONTENTS

PAGE No.

LIST OF FIGURES x

LIST OF TABLES xi

LIST OF ABBREVIATIONS xii

CHAPTER 1 INTRODUCTION 1

1.1 MOTIVATION 1
1.2 EXISTING SYSTEM 1
1.3 PROBLEM STATEMENT 2
1.4 PROPOSED SYSTEM 2
1.4.1 OBJECTIVE 2
CHAPTER 2 LITERATURE SURVEY 4

IEEE FORMAT ( Reference paers detailed description)

CHAPTER 3 REQUIREMENTS & DOMAIN INFORMATION 5

3.1 REQUIREMENT SPECIFICATIONS 5

3.1.1 Hardware Requirements 5
3.1.2 Software Requirements 5
3.2 DOMAIN INFORMATION 5
CHAPTER 4 EXPERIMENTATION ANALYSIS 7

4.1 ARCHITECTURE OF PROPOSED SYSTEM 7

4.2 ALGORITHMS 8
4.3 SYSTEM DESIGN 9
4.3.1 Dataflow Diagrams 10
4.3.2 UML Diagrams 11
4.3.3 Data Dictionary 13
4.4 TESTING 15
4.4.1 Types of Testing 15
4.4.2 Test Cases 16
CHAPTER 5 OUTPUT SCREENS 18

5.1 SCREEN SHOTS 19

vii
CHAPTER 6 CONCLUSION AND FUTURE SCOPE 20

6.1 Conclusion 20
6.2 Future Scope 20
REFERENCES 21

viii
 LIST OF FIGURES

FIGURE No. Description PAGE NO.

Figure 4.1 Architecture Diagram 10

Figure 4.2 DFD Level-0 12
Figure 4.3 DFD Level-1 12
Figure 4.4 Use case Diagram 13
Figure 4.5 Class Diagram 14
Figure 4.6 Sequence Diagram 14
Figure 4.7 Deployment Diagram 15
Figure 4.8 Component Diagram 15
Figure 4.9 E-R Diagram 17
Figure 5.1 Screen-1 21
Figure 5.2 Screen-2 22

ix
 LIST OF TABLES

TABLE No. Description PAGE NO.

Table 4.1 User Table 16

Table 4.2 User Table 2 16
Table 4.3 User Table 2 16
Table 4.4 Test Case for Login 20

x
LIST OF ABBREVIATIONS

xi
xii
 CHAPTER 1
INTRODUCTION

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.

Structure of cloud computing

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

1
portfolios, to deliver personalized information, to provide data storage or to power large,
immersive computer games.
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.

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.

2
  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.

Characteristics of cloud computing

Services 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
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!

4
 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.

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.

1.1 MOTIVATION

……… ………………… …………… …………. ………….. ……………….

……… …………… …………. ………….. ………………. ……… ……………
…………. ………….. ………………. …………………… …………. …………..
………………. …………………… ……… ………………… …………… ………….
………….. ………………. ……… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……………………
…………. ………….. ………………. …………………… …………. …………..
………………. ……… …………… [2]…………. ………….. ……………… ………….

5
………….. ………………. ……… …………… …………. ………….. ……………….
………

1.2 EXISTING SYSTEM

Kallahalla et al presented a cryptographic storage system that enables

secure data sharing on untrustworthy servers based on the techniques that
dividing files into file groups and encrypting each file group with a file-block key.

Yu et al exploited and combined techniques of key policy attribute-based

encryption, proxy re-encryption and lazy re-encryption to achieve fine-grained
data access control without disclosing data contents

1.3 PROBLEM STATEMENT

……… ………………… …………… …………. ………….. ……………….

……… …………… …………. ………….. ………………. [4]……… ……………
…………. ………….. ………………. …………………… …………. …………..
………………. …………………… …………. ………….. ……… …………………
…………… …………. ………….. ………………. ……… …………… ………….
………….. ………………. ……… …………… …………. ………….. ……………….
…………………… …………. ………….. ………………. ……………………
…………. ………….. ………………. ……… …………… …………. …………..
……………… ………………. ……… …………… …………. …………..
………………. ………

1.4 PROPOSED SYSTEM

1. In this paper, we propose a secure data sharing scheme, which can achieve secure
key distribution and data sharing for dynamic group.
2. We provide a secure way for key distribution without any secure communication
channels. The users can securely obtain their private keys from group manager
without any Certificate Authorities due to the verification for the public key of the
user.
3. Our scheme can achieve fine-grained access control, with the help of the group
user list, any user in the group can use the source in the cloud and revoked users
cannot access the cloud again after they are revoked.

6
 4. We propose a secure data sharing scheme which can be protected from collusion
attack. The revoked users can not be able to get the original data files once they
are revoked even if they conspire with the untrusted cloud. Our scheme can
achieve secure user revocation with the help of polynomial function.

Our scheme is able to support dynamic groups efficiently, when a new user joins
in the group or a user is revoked from the group, the private keys of the other
users do not need to be recomputed and updated. We provide security analysis to
prove the security of our scheme.

1.5 OBJECTIVE

……… ………………… …………… …………. ………….. ……………….

……… …………… …………. ………….. ………………. ……… ……………
…………. ………….. ………………. …………………… …………. …………..
………………. …………………… …………. ………….. ………………. ………
…………… …………. ………….. ……………………… ………………… ……………
…………. ………….. ………………. ……… …………… …………. …………..
………………. ……… …………… …………. ………….. ……………….
…………………… …………. ………….. ………………. ……………………
…………. ………….. ………………. ……… …………… …………. …………..
………………

7
 CHAPTER 2
LITERATURE SURVEY

“Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud,”

AUTHORS: B. Wang, B. Li, and H. Li,

With cloud data services, it is commonplace for data to be not only stored in the cloud,
but also shared across multiple users. Unfortunately, the integrity of cloud data is subject
to skepticism due to the existence of hardware/software failures and human errors.
Several mechanisms have been designed to allow both data owners and public verifiers to
efficiently audit cloud data integrity without retrieving the entire data from the cloud
server. However, public auditing on the integrity of shared data with these existing
mechanisms will inevitably reveal confidential information-identity privacy-to public
verifiers. In this paper, we propose a novel privacy-preserving mechanism that supports
public auditing on shared data stored in the cloud. In particular, we exploit ring signatures
to compute verification metadata needed to audit the correctness of shared data. With our
mechanism, the identity of the signer on each block in shared data is kept private from
public verifiers, who are able to efficiently verify shared data integrity without retrieving
the entire file. In addition, our mechanism is able to perform multiple auditing tasks
simultaneously instead of verifying them one by one. Our experimental results
demonstrate the effectiveness and efficiency of our mechanism when auditing shared data
integrity.

2. “Security Challenges for the Public Cloud,”

8
AUTHORS: K. Ren, C. Wang, and Q. Wang,

In this talk, I will first discuss a number of pressing security challenges in Cloud
Computing, including data service outsourcing security and secure computation
outsourcing. Then, I will focus on data storage security in Cloud Computing. As one of
the primitive services, cloud storage allows data owners to outsource their data to cloud
for its appealing benefits. However, the fact that owners no longer have physical
possession of the outsourced data raises big security concerns on the storage correctness.
Hence, enabling secure storage auditing in the cloud environment with new approaches
becomes imperative and challenging. In this talk, I will present our recent research
efforts towards storage outsourcing security in cloud computing and describe both our
technical approaches and security & performance evaluations.

3. “Privacy-Preserving Public Auditing for Data Storage Security in Cloud

Computing,”

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

Cloud computing is the long dreamed vision of computing as a utility, where users can
remotely store their data into the cloud so as to enjoy the on-demand high quality
applications and services from a shared pool of configurable computing resources. By

9
data outsourcing, users can be relieved from the burden of local data storage and
maintenance. However, the fact that users no longer have physical possession of the
possibly large size of outsourced data makes the data integrity protection in Cloud
Computing a very challenging and potentially formidable task, especially for users with
constrained computing resources and capabilities. Thus, enabling public audit ability for
cloud data storage security is of critical importance so that users can resort to an external
audit party to check the integrity of outsourced data when needed. To securely introduce
an effective third party auditor (TPA), the following two fundamental requirements have
to be met: 1) TPA should be able to efficiently audit the cloud data storage without
demanding the local copy of data, and introduce no additional on-line burden to the cloud
user; 2) The third party auditing process should bring in no new vulnerabilities towards
user data privacy. In this paper, we utilize and uniquely combine the public key based
homomorphic authenticator with random masking to achieve the privacy-preserving
public cloud data auditing system, which meets all above requirements. To support
efficient handling of multiple auditing tasks, we further explore the technique of bilinear
aggregate signature to extend our main result into a multi-user setting, where TPA can
perform multiple auditing tasks simultaneously. Extensive security and performance
analysis shows the proposed schemes are provably secure and highly efficient.

“Computing Encrypted Cloud Data Efficiently under Multiple Keys,”

AUTHORS: B. Wang, M. Li, S.S. Chow, and H. Li,

The emergence of cloud computing brings users abundant opportunities to utilize the
power of cloud to perform computation on data contributed by multiple users. These
cloud data should be encrypted under multiple keys due to privacy concerns. However,
existing secure computation techniques are either limited to single key or still far from
practical. In this paper, we design two efficient schemes for secure outsourced
computation over cloud data encrypted under multiple keys. Our schemes employ two

10
non-colluding cloud servers to jointly compute polynomial functions over multiple users'
encrypted cloud data without learning the inputs, intermediate or final results, and require
only minimal interactions between the two cloud servers but not the users. We
demonstrate our schemes' efficiency experimentally via applications in machine learning.
Our schemes are also applicable to privacy-preserving data aggregation such as in smart
metering.

“Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud

Computing,”

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

Cloud computing is an emerging computing paradigm in which resources of the

computing infrastructure are provided as services over the Internet. As promising as it is,
this paradigm also brings forth many new challenges for data security and access control
when users outsource sensitive data for sharing on cloud servers, which are not within the
same trusted domain as data owners. To keep sensitive user data confidential against
untrusted servers, existing solutions usually apply cryptographic methods by disclosing
data decryption keys only to authorized users. However, in doing so, these solutions
inevitably introduce a heavy computation overhead on the data owner for key distribution
and data management when fine-grained data access control is desired, and thus do not
scale well. The problem of simultaneously achieving fine-grainedness, scalability, and
data confidentiality of access control actually still remains unresolved. This paper
addresses this challenging open issue by, on one hand, defining and enforcing access
policies based on data attributes, and, on the other hand, allowing the data owner to
delegate most of the computation tasks involved in fine-grained data access control to

11
untrusted cloud servers without disclosing the underlying data contents. We achieve this
goal by exploiting and uniquely combining techniques of attribute-based encryption
(ABE), proxy re-encryption, and lazy re-encryption. Our proposed scheme also has
salient properties of user access privilege confidentiality and user secret key
accountability. Extensive analysis shows that our proposed scheme is highly efficient and
provably secures under existing security models.

12
 CHAPTER 3
REQUIREMENTS & DOMAIN INFORMATION

3.1 REQUIREMENT SPECIFICATIONS

3.1.1 Hardware Requirements

System : Pentium IV 2.4 GHz.

Hard Disk : 40 GB.

Ram : 512 Mb

3.1.2 Software Requirements

Operating system : Microsoft Windows

Coding Language : J2EE

Data Base : MYSQL

3.2 DOMAIN INFORMATION

13
 CHAPTER 4
EXPERIMENTATION ANALYSIS

4.1 ARCHITECTURE OF PROPOSED SYSTEM

The system model consists of three different entities: the cloud, a group manager and a
large number of group members.

The cloud, maintained by the cloud service providers, provides storage space for hosting
data files in a pay-as-you-go manner.

However, the cloud is untrusted since the cloud service providers are easily to become
untrusted.

Therefore, the cloud will try to learn the content of the stored data.

Group manager takes charge of system parameters generation, user registration and user
revocation. In the practical applications, the group manager usually is the leader of the
group. Therefore, we assume that the group manager is fully trusted by the other parties.

Group members (users) are a set of registered users that will store their own data into the
cloud and share them with others. In the scheme, the group membership is dynamically
changed, due to the new user registration and user revocation.

14
4.2 ALGORITHMS

…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………… …………… …………. ………….. ………………. ………
…………… …………. ………….. ………………. ……… …………… ………….
………….. ………………. …………………… …………. ………….. ……………….
…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… ……………
…………. ………….. ………………. …………………… …………. …………..
………………. …………………… …………. …………..…………. …………..
………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ………………… ……………
…………. ………….. ………………. ……… …………… …………. …………..
………………. ……… …………… …………. ………….. ……………….
…………………… …………. ………….. ………………. ……………………
…………. …………..…………. ………….. ………………. ……… ……………
…………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… ……………
…………. ………….. ………………. …………………… …………. …………..
………………. …………………… …………. …………..…………. …………..
………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ………………… ……………
…………. ………….. ………………. ……… …………… …………. …………..
………………. ……… …………… …………. ………….. ……………….
…………………… …………. ………….. ………………. ……………………
…………. …………..

15
4.3 SYSTEM DESIGN

…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………… …………… …………. ………….. ………………. ………
…………… …………. ………….. ………………. ……… …………… ………….
………….. ………………. …………………… …………. ………….. ……………….
…………………… …………. …………..

4.3.1 Dataflow Diagrams

…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………… …………… …………. ………….. ………………. ………
…………… …………. ………….. ………………. ……… …………… ………….
………….. ………………. …………………… …………. ………….. ……………….
…………………… …………. …………..

…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………… …………… …………. ………….. ………………. ………
…………… …………. ………….. ………………. ……… …………… ………….
………….. ………………. …………………… …………. ………….. ……………….
…………………… …………. …………..

Figure Experimentation analysis.1 DFD Level-0

16
 Figure Experimentation analysis.2 DFD Level-1

4.3.2 UML Diagrams

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… ……………

4.3.2.1 Use case Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… …………

17
 Figure Experimentation analysis.3 Use case Diagram

4.3.2.2 Class Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… ……………

Figure Experimentation analysis.4 Class Diagram

4.3.2.3 Sequence Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..

18
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… …………

Figure Experimentation analysis.5 Sequence Diagram

4.3.2.4 Deployment Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… …………

Figure Experimentation analysis.6 Deployment Diagram

4.3.2.5 Component Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..

19
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ………………. ……… …………

Figure Experimentation analysis.7 Component Diagram

4.3.3 Data Dictionary

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… ………………… …………… …………. ………….. ……………….
……… …………… …………. ………….. ……………….

Table Experimentation analysis.1 User Table

COLUMN NAME DATA TYPE REMARKS

USERNAME VARCHAR(250) PRIMARYKEY

Table Experimentation analysis.2 User Table 2

COLUMN NAME DATA TYPE REMARKS

USERNAME VARCHAR(250) PRIMARYKEY

20
 Table Experimentation analysis.3 User Table 2

COLUMN NAME DATA TYPE REMARKS

USERNAME VARCHAR(250) PRIMARYKEY

4.3.3.1 E-R Diagram

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..
………………… …………………

USERDETAI
UserNam Password
LS_PASS
e

UserNam
h
e UserNam
a
s e

USERDETA USERDET USERDETA

ILS_PHNO h h
AILS ILS_EMAIL
a a
s s

UserNam
e Email
Phno h
a
s

USERDETAI
UserNam Confirm_Pa
LS_CPASS
e ssword

Figure Experimentation analysis.8 E-R Diagram

4.4 TESTING

4.4.1 Types of Testing

………………. …………………… …………. ………….. ……………….

…………………… …………. …………..…………. ………….. ………………. ………
…………… …………. ………….. ………………… …………… …………. …………..

21
………………… ………………………………. …………………… ………….
………….. ………………. …………………… …………. …………..………….
………….. ………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ……………………………………
…………. …………..…………. ………….. ………………. ……… ……………
…………. ………….. ………………… …………… …………. …………..
………………… …………………………………… …………. …………..………….
………….. ………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ……………………………………
…………. …………..…………. ………….. ………………. ……… ……………
…………. ………….. ………………… …………… …………. …………..
………………… ……………… …………………… …………. …………..………….
………….. ………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ……………………………………
…………. …………..…………. ………….. ………………. ……… ……………
…………. ………….. ………………… …………… …………. …………..
………………… …………………………………… …………. …………..………….
………….. ………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… ………………

4.4.2 Test Cases

………………. …………………… …………. ………….. ……………….

…………………… ………….

Table Experimentation analysis.4 Test Case for Login

TEST CASE#1 Priority(H,L):High

Test Objective: check if user name and password is wrong

Test Description: Enter username and password.

Requirements verified: yes

Test Environment: Windows Application

22
Test setup or Pre-conditions: Test successful login

Actions Expected Results

Incorrect login Actual Data of Logged User

Incorrect password Actual results

Correct login
Valid user id
Correct password

Pass: yes Conditional pass: Fail:

Problems/Issues: Nil

4.5 SUMMARY
………………………….. …………………………… ……………… …….
…….. ……

23
 CHAPTER 5
OUTPUT SCREENS

5.1 SCREEN SHOTS

Figure output screens.9 Screen-1

This screen reads/write the input/output

24
 Figure output screens.10 Screen-2

This screen reads/write the input/output

25
 CHAPTER 6
CONCLUSION AND FUTURE SCOPE

6.1 CONCLUSION

…………..…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………………………. …………………… …………. …………..
………………. …………………… …………. …………..…………. …………..
………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… …………

…………..…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………………………. …………………… …………. …………..
………………. …………………… …………. …………..…………. …………..
………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… …………

6.2 FUTURE SCOPE

…………..…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………………………. …………………… …………. …………..
………………. …………………… …………. …………..…………. …………..
………………. ……… …………… …………. ………….. …………………
…………… …………. ………….. ………………… …………

…………..…………. ………….. ………………. ……… …………… ………….

………….. ………………… …………… …………. ………….. …………………
………………………………. …………………… …………. …………..
………………. …………………… …………. …………

26
 REFERENCES

[1] Han, J. and Kamber, M., Data Mining: Concepts and Techniques. Second Edition,
Morgan Kaufmann Publishers, San Francisco, (2006).

[2] Maity, Rajib, and D. Nagesh Kumar. "Bayesian dynamic modeling for monthly
Indian summer monsoon rainfall using El Nino–Southern Oscillation (ENSO) and
Equatorial Indian Ocean Oscillation (EQUINOO)." Journal of Geophysical
Research: Atmospheres (1984–2012) 111.D7 (2006), pp. 1-12.

[3] Kashid, Satishkumar S., and Rajib Maity. "Prediction of monthly rainfall on
homogeneous monsoon regions of India based on large scale circulation patterns
using Genetic Programming." Journal of Hydrology 454 (2012), pp. 26-41.

[4] M.J. Berry, and G. Linoff. Data Mining Techniques for Marketing, Sales, and
Customer Support. New York: John Wiley, (1997).

[5] A.C. Tessmer, "What to learn from near misses: an inductive learning approach to
credit risk assessment," Decision Sciences, Vol. 28, No. 1, (1997), pp. 105-120.

27