TY - GEN
T1 - Ensuring data storage security against frequency-based attacks in wireless networks
AU - Liu, Hongbo
AU - Wang, Hui
AU - Chen, Yingying
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77955348593&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955348593&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13651-1_15
DO - 10.1007/978-3-642-13651-1_15
M3 - Conference contribution
AN - SCOPUS:77955348593
SN - 3642136508
SN - 9783642136504
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 201
EP - 215
BT - Distributed Computing in Sensor Systems - 6th IEEE International Conference, DCOSS 2010, Proceedings
T2 - 6th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2010
Y2 - 21 June 2010 through 23 June 2010
ER -