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.
Original language | English (US) |
---|---|
Pages (from-to) | 3323-3331 |
Number of pages | 9 |
Journal | Information Sciences |
Volume | 179 |
Issue number | 19 |
DOIs | |
State | Published - Sep 9 2009 |
Externally published | Yes |
Keywords
- Data partitioning
- Implicit security architecture
- Online data storage
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence