Hamming Distortion Based Secrecy Systems: To Foil the Eavesdropper With Finite Shared Key

Rate-distortion based secrecy is introduced in communication systems recently, where security is measured by the distortion that an eavesdropper can be forced to attain when reconstructing secret source symbols from an encrypted message. To maximize the distortion, previous works show that at least an unbounded number of secret keys growing with the block length is required for general distortion measure. Instead, in this letter, we will show that if hamming distortion, i.e. symbol error probability, is considered in secrecy systems, maximal hamming distortion is achievable with only a finite and constant number of shared secret keys, no matter how long the block length grows.

[1]  H. Vincent Poor,et al.  A bit of secrecy for Gaussian source compression , 2013, 2013 IEEE International Symposium on Information Theory.

[2]  Paul W. Cuff,et al.  Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Paul W. Cuff A Framework for Partial Secrecy , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[5]  Hirosuke Yamamoto,et al.  Rate-distortion theory for the Shannon cipher system , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[6]  H. Vincent Poor,et al.  On Energy-Secrecy Trade-Offs for Gaussian Wiretap Channels , 2013, IEEE Transactions on Information Forensics and Security.

[7]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[8]  Paul W. Cuff,et al.  Secrecy is cheap if the adversary must reconstruct , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.