Secure lossless compression
暂无分享,去创建一个
[1] Yuhong Yang. Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas , 2008 .
[2] Paul W. Cuff,et al. Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.
[3] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[4] H. Vincent Poor,et al. Secure lossless compression with side information , 2008, 2008 IEEE Information Theory Workshop.
[5] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[6] Elza Erkip,et al. Source Coding under Secrecy Constraints , 2009 .
[7] Neri Merhav,et al. Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.
[8] Sudeep Kamath,et al. An operational measure of information leakage , 2016, 2016 Annual Conference on Information Science and Systems (CISS).
[9] Neri Merhav. Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels , 2007, ISIT.
[10] Sergio Verdú,et al. Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.
[11] E. Arıkan. An inequality on guessing and its application to sequential decoding , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[12] J. Massey. Guessing and entropy , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[13] Sudeep Kamath,et al. Maximal leakage minimization for the Shannon cipher system , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[14] Aaron B. Wagner,et al. Measuring secrecy by the probability of a successful guess , 2015, Allerton.
[15] Hirosuke Yamamoto. A rate-distortion problem for a communication system with a secondary decoder to be hindered , 1988, IEEE Trans. Inf. Theory.
[16] Paul W. Cuff,et al. The Henchman problem: Measuring secrecy by the minimum distortion in a list , 2014, ISIT.