Publication Date

2009-01-01

Availability

Open access

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science (Arts and Sciences)

Date of Defense

2009-04-13

First Committee Member

Burton Rosenberg - Committee Chair

Second Committee Member

Akmal Younis - Committee Member

Third Committee Member

Huseyin Kocak - Committee Member

Abstract

With growing trend in "cloud computing" and increase in the data moving into the Internet, the need to store large amounts of data by service providers such as Google, Yahoo and Microsoft has increased over time. Now, more than ever, there is a need to efficiently and securely store large amounts of data. This thesis presents an implementation of a Ramp Scheme that confidentially splits a data file into a configurable number of parts or shares of equal size such that a subset of those shares can recover the data entirely. Furthermore, the implementation supports a threshold for data compromise and data verification to verify that the data parts have not been tampered with. This thesis addresses two key problems faced in large-scale data storage, namely, data availability and confidentiality.

Keywords

Security; ; Unix Library; C Programming Language; Threshold Scheme; Secret Sharing; Lagrange Interpolation; Sha; Ramp Scheme

Share

COinS