TY - GEN
T1 - Joint distributed compression and encryption of correlated data in sensor networks
AU - Haleem, M. A.
AU - Mathur, Chetan N.
AU - Subbalakshmi, K. P.
PY - 2006
Y1 - 2006
N2 - In this paper, we propose, formulate, and study a joint distributed data compression and encryption scheme suitable for wireless sensor networks where we adopt the structured encryption system of Advanced Encryption Standard (AES) [9]. The distributed compression is achieved as per the Slepian-Wolf coding theorem, using channel codes. Core to achieving optimal compression in the joint compression and encryption is the preservation of correlation among different blocks of data despite applying cryptographic primitives. We establish that the correlation between sources remains unchanged when cryptographic primitives, namely key addition and substitution are applied. However, as a requirement of security in the encryption, any correlation between two inputs to a encryption system is removed with diffusion techniques. Compliance to the requirements of diffusion layer of AES cipher is achieved by designing the compression function so as to maintain branch number property. We establish the necessary and sufficient condition for achieving a compression function with branch number property and show that distributed compression using non-systematic Reed Solomon (RS) code can satisfy this condition.
AB - In this paper, we propose, formulate, and study a joint distributed data compression and encryption scheme suitable for wireless sensor networks where we adopt the structured encryption system of Advanced Encryption Standard (AES) [9]. The distributed compression is achieved as per the Slepian-Wolf coding theorem, using channel codes. Core to achieving optimal compression in the joint compression and encryption is the preservation of correlation among different blocks of data despite applying cryptographic primitives. We establish that the correlation between sources remains unchanged when cryptographic primitives, namely key addition and substitution are applied. However, as a requirement of security in the encryption, any correlation between two inputs to a encryption system is removed with diffusion techniques. Compliance to the requirements of diffusion layer of AES cipher is achieved by designing the compression function so as to maintain branch number property. We establish the necessary and sufficient condition for achieving a compression function with branch number property and show that distributed compression using non-systematic Reed Solomon (RS) code can satisfy this condition.
UR - http://www.scopus.com/inward/record.url?scp=35148883768&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35148883768&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2006.302094
DO - 10.1109/MILCOM.2006.302094
M3 - Conference contribution
AN - SCOPUS:35148883768
SN - 1424406188
SN - 9781424406180
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - Military Communications Conference 2006, MILCOM 2006
T2 - Military Communications Conference 2006, MILCOM 2006
Y2 - 23 October 2006 through 25 October 2006
ER -