Online data storage using implicit security

  • Authors:
  • Abhishek Parakh;Subhash Kak

  • Affiliations:
  • Computer Science Department, Oklahoma State University, Stillwater, OK 74075, USA;Computer Science Department, Oklahoma State University, Stillwater, OK 74075, USA

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

It is advantageous to use implicit security for online data storage in a cloud computing environment. We describe the use of a data partitioning scheme for implementing such security involving the roots of a polynomial in finite field. The partitions are stored on randomly chosen servers on the network and they need to be retrieved to recreate the original data. Data reconstruction requires access to each server, login password and the knowledge of the servers on which the partitions are stored. This scheme may also be used for data security in sensor networks and internet voting protocols.