Ensuring data storage security against frequency-based attacks in wireless networks

As wireless networks become more pervasive, the amount of the wireless data is rapidly increasing. One of the biggest challenges is how to store these data. To address this challenge, distributed data storage in wireless networks has attracted much attention recently, as it has major advantages over...

Full description

Saved in:
Bibliographic Details
Published inDistributed Computing in Sensor Systems Vol. 6131; pp. 201 - 215
Main Authors Liu, Hongbo, Wang, Hui, Chen, Yingying
Format Conference Proceeding Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer-Verlag 01.01.2010
Springer Berlin / Heidelberg
Springer Berlin Heidelberg
SeriesACM Other Conferences
Subjects
Online AccessGet full text
ISBN3642136508
9783642136504
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-13651-1_15

Cover

More Information
Summary:As wireless networks become more pervasive, the amount of the wireless data is rapidly increasing. One of the biggest challenges is how to store these data. To address this challenge, distributed data storage in wireless networks has attracted much attention recently, as it has major advantages over centralized approaches. To support the widespread adoption of distributed data storage, secure data storage must be achieved. In this work, we study the frequency-based attack, a type of attack that is different from previously well-studied ones, that exploits additional adversary knowledge to crack the encrypted data. To cope with frequency-based attacks, the straightforward 1-to-1 substitution encryption functions are not sufficient. We propose a data encryption strategy based on 1-to-n substitution via dividing and emulating techniques such that an attacker cannot derive the mapping relationship between the encrypted data and the original data based on their knowledge of domain values and their occurrence frequency. Our simulation results show that our data encryption strategy can achieve high security guarantee with low overhead.
ISBN:3642136508
9783642136504
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-13651-1_15