Online data storage using implicit security

Abhishek Parakh, Subhash Kak

Research output: Contribution to journalArticle

55 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)3323-3331
Number of pages9
JournalInformation Sciences
Volume179
Issue number19
DOIs
StatePublished - Sep 9 2009

Fingerprint

Data Storage
Servers
Server
Data storage equipment
Partition
Root of a polynomial
Data Partitioning
Data Security
Password
Security of data
Cloud computing
Voting
Cloud Computing
Sensor networks
Sensor Networks
Galois field
Polynomials
Internet
Network protocols
Data security

Keywords

  • Data partitioning
  • Implicit security architecture
  • Online data storage

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Software
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Online data storage using implicit security. / Parakh, Abhishek; Kak, Subhash.

In: Information Sciences, Vol. 179, No. 19, 09.09.2009, p. 3323-3331.

Research output: Contribution to journalArticle

Parakh, Abhishek ; Kak, Subhash. / Online data storage using implicit security. In: Information Sciences. 2009 ; Vol. 179, No. 19. pp. 3323-3331.
@article{429dc37f16d940cf9be6e1f2ce50f7f4,
title = "Online data storage using implicit security",
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.",
keywords = "Data partitioning, Implicit security architecture, Online data storage",
author = "Abhishek Parakh and Subhash Kak",
year = "2009",
month = "9",
day = "9",
doi = "10.1016/j.ins.2009.05.013",
language = "English (US)",
volume = "179",
pages = "3323--3331",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "19",

}

TY - JOUR

T1 - Online data storage using implicit security

AU - Parakh, Abhishek

AU - Kak, Subhash

PY - 2009/9/9

Y1 - 2009/9/9

N2 - 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.

AB - 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.

KW - Data partitioning

KW - Implicit security architecture

KW - Online data storage

UR - http://www.scopus.com/inward/record.url?scp=67650951127&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650951127&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2009.05.013

DO - 10.1016/j.ins.2009.05.013

M3 - Article

VL - 179

SP - 3323

EP - 3331

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 19

ER -