Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

SCAR - Scatter, Conceal and Recover

Mills, Bryan N. (2007) SCAR - Scatter, Conceal and Recover. Master's Thesis, University of Pittsburgh. (Unpublished)

[img]
Preview
PDF
Primary Text

Download (887kB) | Preview

Abstract

This thesis describes a secure and reliable method for storing data in a distributed hash table (DHT) that leverages the inherent properties of the DHT to provide a secure storage substrate. The framework presented is referred to as "Scatter, Conceal, and Recover" (SCAR). The standard method of securing data in a DHT is to encrypt the data using symmetrical encryption before storing it in the network. SCAR provides this level of security, but also prevents any known cryptoanalysis from being performed. It does this by breaking the data into smaller blocks and scattering these blocks throughout the DHT. Hence, SCAR prevents any unauthorized user from obtaining the entire encrypted data block. SCAR uses hash chains to determine the storage locations for the data blocks within the DHT. To ensure storage availability, SCAR uses an erasure coding scheme to provide full data recovery given only partial block recovery. This thesis presents the details of SCAR. First, the framework, related protocols, and mechanisms are described. Second, a prototype implementation is presented showing the feasibility of SCAR. Third, analytical models are discussed that characterize SCAR's behavior, the models are then validated using experimental results. Lastly, the models are analyzed to further understand the tradeoff between data security and data availability. The exploration of this tradeoff leads to the conclusion that SCAR can effectively balance this tradeoff when the nodes of the network are "sufficiently" available.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: University of Pittsburgh ETD
Status: Unpublished
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Mills, Bryan N.bmills@cs.pitt.eduBNM15
ETD Committee:
TitleMemberEmail AddressPitt UsernameORCID
Committee ChairZnati, Taiebznati@cs.pitt.eduZNATI
Committee MemberAmer, Ahmedamer@cs.pitt.edu
Committee MemberMosse, Danielmosse@cs.pitt.eduMOSSE
Date: 14 June 2007
Date Type: Completion
Defense Date: 12 February 2007
Approval Date: 14 June 2007
Submission Date: 20 April 2007
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Institution: University of Pittsburgh
Schools and Programs: Dietrich School of Arts and Sciences > Computer Science
Degree: MS - Master of Science
Thesis Type: Master's Thesis
Refereed: Yes
Uncontrolled Keywords: dht; distributed hash table; distributed storage; encryption; hash chains; opendht; p2p; peer-to-peer
Other ID: http://etd.library.pitt.edu/ETD/available/etd-04202007-115410/, etd-04202007-115410
Date Deposited: 10 Nov 2011 19:39
Last Modified: 15 Nov 2016 13:41
URI: http://d-scholarship.pitt.edu/id/eprint/7358

Metrics

Monthly Views for the past 3 years

Plum Analytics


Actions (login required)

View Item View Item