security aspects of picewise hashing (1) (1)

8/2/2019 Security Aspects of Picewise Hashing (1) (1)

1/19


2/19

ABSTRACT

3/7/2012 Project 2

Traditional techniques such as cryptographic hashing cannotbe used to identify identical files with tiny modifications.

This introduces a new technique in hashing that can be usedto identify identical files with tiny modifications.


3/19

ExistingSystem

3/7/2012 Project 3

Traditional techniques such as cryptographic hashing such asMD5SHA-1cannot be used to identify Homologous files .


4/19

ProposedSystem

3/7/2012 Project 4

This introduces a new technique in hashing by combining a number oftraditional hashes. These can be used to identify modified versions

files even if data has been inserted, modified, or deleted in the newfiles.


5/19

Techniques

3/7/2012 Project 5

Cryptographic Hashes

Rolling Hashes

CTP Hashes


6/19

Cryptographic Hashes

3/7/2012 Project 6

Traditional hashing is used to validate exact

duplicate files. Altering a single bit of data will alter

the hash.The MD5 hash of hello is

4eb20288afaed97e82bde371260db8d8The MD5 hash of Hello is

dcc9f5ac2af04cedb008c04d5f9636b5


7/19

Rolling Hashes

3/7/2012 Project 7

A rolling hash is used to identify the segment boundaries it uses a

trigger value where these segments will be created. Once located, the data

before and after each of the reset points will be processed to create sequences

of traditional hash strings


8/19

CTP Hashes

3/7/2012 Project 8

The Context Triggered Piecewise Hash is based upon segments of

traditional hashes. Comparisons can be drawn between documents with

similar strings of data that are not exact duplicates.

Here 3 hash values are equal so those files are homologous files


9/19

ALGORITHMS USED

RSA Algorithm

SHA-1 Algorithm

3/7/2012 Project 9


10/19

RSA Algorithm

3/7/2012 Project 10

RSA is an Internet encryption and authentication system that uses analgorithm developed in 1977 by Ron Rivest, Adi Shamir, and LeonardAdleman.The RSA algorithm is the most commonly used encryption andauthentication algorithm


11/19

SHA-1 Algorithm

3/7/2012 Project 11

SHA-1 is the most widely used of the existing SHA hash functions,and is employed in several widely used security applications andprotocols


12/19

Modules

3/7/2012 Project 12

1. Local file comparing

2. Between two Systems Avoiding Active Attack

3. Between two Systems Avoiding Passive Attack


13/19

Local file comparing

3/7/2012 Project 13

In this we are identifying almost identical files with in same

System by using above techniques


14/19

Avoiding Active Attack

3/7/2012 Project 14

In this we are avoiding Active Attack by sending both content as Well as

hash code to the other system and on the other system Again made hash on

the content and compare them

Here we using MD5 to make Hashing


15/19

Avoiding Passive Attack

3/7/2012 Project 15

In this we are avoiding Passive Attack by sending the content

between two systems by encrypting

Here we using RSA(Ron Rivest, Adi Shamir and Len Adleman)


16/19

3/7/2012 Project 16

1ST MODULE :


17/19

3/7/2012 Project 17

Module2:

SERVER SIDE PAGE:


18/19

3/7/2012 Project 18

Module2:

CLIENT SIDE PAGE:


19/19

References

Base Paper

S. Chen and K. Nahrstedt, An Overview of Quality-of-ServiceRouting for the Next Generation High-Speed Networks: Problems

and Solutions, IEEE Network, Special Issue on Transmission andDistribution of Digital Video, December 1998.

R. Guerin and A. Orda, QoS-based Routing in Networks withInaccurate Information: Theory and Algorithms, IEEE INFOCOM97,

Japan, April 1997.

3/7/2012 Project 19

security aspects of picewise hashing (1) (1)

Documents