0% found this document useful (0 votes)

54 views11 pages

Hybrid Intrusion Detection System For Cloud Computing Environments

Contact us for project abstract, enquiry, explanation, code, execution, documentation. Phone/Whatsap : 9573388833 Email : [email protected] Website : https://dcs.datapro.in/contact-us-2 Tags: btech, mtech, final year project, datapro, machine learning, cyber security, cloud computing, blockchain,

Uploaded by

dataprodcs

We take content rights seriously. If you suspect this is your content, claim it here.

0% found this document useful (0 votes)

54 views11 pages

Hybrid Intrusion Detection System For Cloud Computing Environments

Uploaded by

dataprodcs

We take content rights seriously. If you suspect this is your content, claim it here.

You are on page 1/ 11

ABSTRACT

Today data sharing and maintaining its security is major challenge. User in the data
sharing system upload their file with the encryption using private key. This property is
especially important to any large scale data sharing system, as any user leak the key
information then it will become difficult for the data owner to maintain security of the
information. In this paper provide a concrete and efficient instantiation of scheme,
prove its security and provide an implementation to show its practicality. There are
lots of challenges for data owner to share their data on servers or cloud. There are
different solutions to solve these problems. These techniques are very much critical
to handle key shared by the data owner. This paper will introduce the trusted
authority to authenticate user those who have the access to the data on cloud. SHA
algorithm is used by the trusted authority to generate the key and that key will get
share to user as well as the owner. The trusted authority module receives encrypted
file using AES Algorithm from the data owner and computes hash value using MD-5
algorithm. It stores key in its database which will be used during the dynamic
operations and to determine the cheating party in the system (CSP or Owner).
Trusted authority send file to CSP module to store on cloud. The resulting key sets
are shown to have a number of desirable properties that ensure the confidentiality of
communication sessions against collusion attacks by other network nodes

V
TABLE OF CONTENTS

CHAPTER No. CHAPTER NAME PAGE No.

ABSTRACT v
LIST OF TABLES viii
LIST OF FIGURES ix
LIST OF ABBREVIATIONS x
1 INTRODUCTION 01
1.1 Establishment 01
1.2 Objective 02
1.3 Literature Survey 02
1.3.1 Efficient and verificable 02
outsourcing Scheme
1.3.2 Secure Outsourcing 03
1.3.3 Secure and private 03
sequence comparisions
1.4 Existing System 05
1.5 Disadvantages 05
1.6 Proposed System 05
1.7 Advantages of Proposed System 06

2 SYSTEM REQUIREMENTS 08
2.1 Hardware Requirements 08
2.2 Software Requirements 08
2.3 Introduction 08
2.4 Application of Java 08
2.5 Features of Java 09
2.6 Collection Framework 10
2.7 MySql 11
2.8 Feasibility Study 12
2.10 Technical Feasibility 12

VI
2.11 Social Feasibilty 13
2.12 Requirement Analysis 13
2.13 Functional Requirements 13
2.14 Non Functional Requirements 14
2.14.1 Portability 14
2.14.2 Performance 14
2.14.3 Accuracy 14

3 SYSTEM IMPLEMENTATION 15
3.1 Implementation 15
3.2 Login Module 15
3.3 Registration Module 15
3.4 Creation Storage and Instance 16
3.5 Find Collusion Module 16
3.6 Find Third Party Module 16
3.7 UML Diagram 16
3.8 Goals 17
3.9 Use Case Diagram 17
3.10 Class Diagram 18
3.11 Sequence Diagram 19

4 RESULTS AND DISCUSSION 20

4.1 System Design and Testing Plan 22
4.1.1 Input Design 22
4.1.2 Output Design 23
4.2 Testing Process 23
4.2.1 Unit Testing 23
4.2.2 Integration Testing 24
4.2.3 Functional Testing 24
4.3 Test Strategy and Approach 25
4.3.1 Test objectives 25

VII
4.4 Integration Testing 25
4.4.1 Acceptance Testing 26
4.4.2 Alpha Testing 26
4.4.3 Beta Testing 26

5 CONCLUSION AND FUTURE WORK 27

5.1 Conclusion 27
5.2 Future Work 27
REFERENCES 28
APPENDIX 29

VIII
LIST OF FIGURES

FIGURE No. FIGURE NAME PAGE No.

1.1 System Architecture 13
2.1 Compile Procedure 17
2.2 Collection Framework 18
3.1 User Case Diagram 19
3.2 Class Diagram 20
3.3 Sequence Diagram 26
4.1 Unit Testing
4.2 Login Page
4.3 Admin Login Page

IX
LIST OF ABBREVIATIONS

SHA Secure Hashing Algorithm

MD5 Message Digest Alogorithm
AES Advanced encryption Standard

X
CHAPTER-1

INTRODUCTION

1.1 ESTABLISHMENT

One possible solution is to migrate character sequences to public cloud

computing platforms and to request that Cloud Service Providers process sequence
comparisons. At present, primary sequence comparison algorithms are deployed as a
universal outsourcing service on public clouds. But at the same time, its security and
privacy issues are increasingly emerging. The outsourced data stored as plaintext
could easily be exposed to malicious external intruders and internal attackers in the
CSP, and the individual private information carried by character sequences (e.g.,
personal identiﬁcation, ﬁnancial transaction records, genetic markers for some
diseases, information that is used to identify paternity or maternity, etc.) could more or
less be disclosed or abused. Therefore, secure outsourcing is designed to protect the
privacy of character sequences, and to ensure that the scheduled computing requests
are normally performed on the cloud servers.

For this purpose, we present a scheme called Encrypted Sequence Comparison

based on a single-server model. Some novelsalted hash and encryption techniquesare
employed to allow public clouds to perform sequence comparisons directly on the
character sequences outsourced as ciphertext. Overall, E-SC achieves a user-
controlled reliable storage and a collusion-resistant outsourcing service, which plays
an important role in the trade-off between security and execution performance. Our
scheme is easy in deployment, efﬁcient in processing and controllable in
overhead.Based on the universal model of a public cloud outsourcing, we propose an
overall architecture for E-SC. This architecture is built on the end user and the
unmodiﬁed CSP. Its overall system model, whichhas been demonstrated to be secure
under the threat model, is user-friendly and implementation-friendly.

A salted hash algorithm is improved to hash the character sequences and the indexes
of cost matrices, so as to defend against statistical attacks. An additive order
preserving encryption algorithm is designed to encrypt the elements of cost matrices.
Also, this algorithm can achieve an indistinguishability under additive ordered chosen-
plaintext attack with linear time complexity.

1
A single cloud server works for the ﬁrst time to provide a privacy-preserving
computable outsourcing service to effectively resist collusion attacks from the cloud.
Withpre-processing modules of padding,partition,and expansion, there is no need to
decrypt any outsourced data in the non-interactive sequence comparison stage.

Simulation results show that the overall execution performance of our E-SC is
negatively correlated with its security.

1.2 OBJECTIVE

The main objective of this system is, SHA algorithm is used by the trusted
authority to generate the key and that key will get share to user as well as the owner.
The trusted authority module receives encrypted file using AES Algorithm from the
data owner and computes hash value using MD-5 algorithm.

1.3 LITERATURE SURVEY

Literature survey is the most important step in software development process.

Before developing the tool it is necessary to determine the time factor, economy and
company strength. Once these things are satisfied, then the next step is to determine
which operating system and language can be used for developing the tool. Once the
programmers start building the tool the programmers need lot of external support. This
support can be obtained from senior programmers, from book or from websites. Before
building the system the above consideration are taken into account for developing the
proposed system.

The major part of the project development sector considers and fully survey all
the required needs for developing the project. For every project Literature survey is
the most important sector in software development process. Before developing the
tools and the associated designing it is necessary to determine and survey the time
factor, resource requirement, man power, economy, and company strength. Once
these things are satisfied and fully surveyed, then the next step is to determine about
the software specifications in the respective system such as what type of operating
system the project would require, and what are all the necessary software are needed
to proceed with the next step such as developing the tools, and the associated
operations.

2
1.3.1 TITLE: Efﬁcient and veriﬁable outsourcing scheme of sequence
comparisons

AUTHOR:Y.Feng,H.Ma,andX.Chen

With the rapid development of cloud computing, the techniques for securely
outsourcing prohibitively expensive computations are getting widespread attentions in
the scientific community. In the outsourcing computation paradigm, the clients with
resource-constrained abilities can outsource the heavy computation workloads into
the cloud server and enjoy unlimited computing resources in a pay-per-use manner.
One of the most critical functionalities in outsourcing computation is the verifiability of
the result. That is, the client should efficiently verify the validity of the result returned
by the cloud servers. In this paper, we solve the problem of verifiable outsourcing
computation of sequence comparisons by integrating the technique of Yao‟s garbled
circuit with homomorphic encryption. Compared with the existing schemes, our
proposed solution enables clients to efficiently detect the misbehavior of dishonest
servers. Furthermore, our construction re-garbles the circuit only for malformed
responses and thus is very efficient for real-world applications. Besides, we also
present the formal analysis for our proposed construction.

1.3.2 TITLE:Secure outsourcing of sequence comparisons

AUTHOR: M. J. Atallah and J. Li

With the advent of cloud computing, secure outsourcing techniques of

sequence comparisons are becoming increasingly valuable, especially for clients with
limited resources. One of the most critical functionalities in data outsourcing is
verifiability. However, there is very few secure outsourcing scheme for sequence
comparisons that the clients can verify whether the servers honestly execute a
protocol or not. In this paper, we tackle the problem by integrating the technique of
garbled circuit with homomorphic encryption. As compared to existing schemes, our
proposed solution enables clients to efficiently detect the dishonesty of servers. In
particular, our construction re-garbles the circuit only for malformed responses and
hence is very efficient. Besides, we also present the formal analysis for our proposed
construction.

1.3.3 TITLE: Secure and private sequence comparisons

3
AUTHOR: M. J. Atallah, F. Kerschbaum, and W. Du

We give an efficient protocol for sequence comparisons of the edit-distance

kind, such that neither party reveals anything about their private sequence to the other
party (other than what can be inferred from the edit distance between their two
sequences – which is unavoidable because computing that distance is the purpose of
the protocol). The amount of communication done by our protocol is proportional to
the time complexity of the best-known algorithm for performing the sequence
comparison. The problem of determining the similarity between two sequences arises
in a large number of applications, in particular in bioinformatics. In these application
areas, the edit distance is one of the most widely used notions of sequence similarity:
It is the least-cost set of insertions, deletions, and substitutions required to transform
one string into the other. The generalizations of edit distance that are solved by the
same kind of dynamic programming recurrence relation as the one for edit distance,
cover an even wider domain of applications.

1.3.4 TITLE:Toward a practical data privacy scheme for a distributed

implementation of the Smith-Waterman genome sequence comparison
algorithm

AUTHOR: D. Szajda, M. Pohl, J. Owen, and B. Lawson

Volunteer distributed computations utilize spare processor cycles of personal

computers that are connected to the Internet. The resulting platforms provide
computational power previously available only through the use of expensive clusters
or supercomputers. However, distributed computations running in untrustworthy
environments raise a number of security concerns, including computation integrity and
data privacy. This paper introduces a strategy for enhancing data privacy in some
distributed volunteer computations, providing an important first step toward a general
data privacy solution for these computations. The strategy is used to provide enhanced
data privacy for the Smith-Waterman local nucleotide sequence comparison algorithm.
Our modified Smith-Waterman algorithm provides reasonable performance,
identifying most, and in many cases all, sequence pairs that exhibit statistically
significant similarity according to the unmodified algorithm, with reasonable levels of
false positives. Moreover the modified algorithm achieves a net decrease in execution
time, with no increase in memory requirements. Most importantly, our scheme

4
represents an important first step toward providing data privacy for a practical and
important real-world algorithm.

1.3.5 TITLE:New algorithms for secure outsourcing of modular exponentiations

AUTHOR: X. Chen, J. Li, J. Ma, Q. Tang, and W. Lou

Modular exponentiations have been considered the most expensive operation

in discrete-logarithm based cryptographic protocols. In this paper, we propose a new
secure outsourcing algorithm for exponentiation modular a prime in the one-malicious
model. Compared with the state-of-the-art algorithm [33], the proposed algorithm is
superior in both efficiency and checkability. We then utilize this algorithm as a
subroutine to achieve outsource-secure Cramer-Shoup encryptions and Schnorr
signatures. Besides, we propose the first outsource-secure and efficient algorithm for
simultaneous modular exponentiations. Moreover, we prove that both the algorithms
can achieve the desired security notions.

1.4 EXISTING SYSTEM

Large-scale problems in the physical and life sciences are being

revolutionized by Internet computing technologies, like grid computing, that make
possible the massive cooperative sharing of computational power, bandwidth,
storage, and data. A weak computational device, once connected to such a grid, is
no longer limited by its slow speed, small amounts of local storage, and limited
bandwidth: It can avail itself of the abundance of these resources that is available
elsewhere on the network. An impediment to the use of “computational outsourcing”
is that the data in question is often sensitive, e.g., of national security importance, or
proprietary and containing commercial secrets, or to be kept private for legal
requirements such as the HIPAA legislation, Gramm-Leach-Bliley, or similar laws.
This motivates the design of techniques for computational outsourcing in a privacy-
preserving manner, i.e., without revealing to the remote agents whose computational
power is being used, either one‟s data or the outcome of the computation on the
data.