Online data storage using implicit security

被引：52

作者：

Parakh, Abhishek ^{[1
]}

Kak, Subhash ^{[1
]}

机构：

[1] Oklahoma State Univ, Dept Comp Sci, Stillwater, OK 74075 USA

来源：

INFORMATION SCIENCES | 2009年 / 179卷 / 19期

关键词：

Online data storage; Data partitioning; Implicit security architecture;

D O I：

10.1016/j.ins.2009.05.013

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2009 Elsevier Inc. All rights reserved.

引用

页码：3323 / 3331

页数：9

共 31 条

[1]

Aho A. V., 1974, The design and analysis of computer algorithms

[2]

[Anonymous], 1969, Seminumerical Algorithms, DOI 10.2307/2283757

[3]

[Anonymous], P IEEE PIMRC SEP

[4]

Bharucha-Reid AT., 1986, Random polynomials

[5] A NEW GROUP KEY GENERATING MODEL FOR GROUP SHARING [J].

CHIU, KH ;

CHEN, WT .

INFORMATION SCIENCES, 1992, 64 (1-2) :83-94

[6] Securing wireless sensor networks against aggregator compromises [J].

Claveirole, Thomas ;

de Amorim, Marcelo Dias ;

Abdalla, Michel ;

Viniotis, Yannis .

IEEE COMMUNICATIONS MAGAZINE, 2008, 46 (04) :134-141

[7]

Dehkordi MH, 2008, INFORM SCIENCES, V178, P2262, DOI 10.1016/j.ins.2007.11.031

[8]

Denning D.E.R., 1982, CRYPTOGRAPHY DATA SE, V112, DOI [10.5555/539308, DOI 10.5555/539308]

[9]

*DEP DEF, 2007, EXP US EL VOT TECHN

[10]

Dickson Leonard Eugene, 1958, Linear Groups: With an Exposition of the Galois Field Theory

← 1 2 3 4 →