A Distributed Data Storage Scheme for Sensor Networks

被引：0

作者：

Parakh, Abhishek ^{[1
]}

Kak, Subhash ^{[1
]}

机构：

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

来源：

SECURITY AND PRIVACY IN MOBILE INFORMATION AND COMMUNICATION SYSTEMS | 2009年 / 17卷

关键词：

Distributed data storage; sensor networks;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

We present a data storage scheme for sensor networks that achieves the targets of encryption and distributed storage simultaneously. We partition the data to be stored into numerous pieces such that at least a specific number of them have to be brought together to recreate the data. The procedure for creation of partitions does not use any encryption key and the pieces are implicitly secure. These pieces are then distributed over random sensors for storage. Capture or malfunction of one or more (less than a threshold number of sensors) does not compromise the data. The scheme provides protection against compromise of data in specific sensors due to physical capture or malfunction.

引用

页码：14 / 22

页数：9

共 22 条

[1]

[Anonymous], P IEEE PIMRC SEP

[2]

Benson Z., 2005, IASTED PDCS, P779

[3]

Bharucha-Reid AT., 1986, Random polynomials

[4] Wireless sensor networks for intrusion detection:: Packet traffic modeling [J].

Demirkol, I ;

Alagöz, F ;

Deliç, H ;

Ersoy, C .

IEEE COMMUNICATIONS LETTERS, 2006, 10 (01) :22-24

[5]

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

[6]

Donggang Liu, 2005, ACM Transactions on Information and Systems Security, V8, P41, DOI 10.1145/1053283.1053287

[7]

Eschenauer L., 2002, ACM CCS2002, DOI DOI 10.1145/586110.586117

[8]

Greenstein B., 2003, Ad Hoc Networks, V1, P333, DOI DOI 10.1016/S1570-8705(03)00010-6

[9] EXPONENTIATION MODULO A POLYNOMIAL FOR DATA-SECURITY [J].

KAK, SC .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (05) :337-346

[10] ON THE METHOD OF PUZZLES FOR KEY DISTRIBUTION [J].

KAK, SC .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (02) :103-109

← 1 2 3 →