A large deviations approach to secure lossy compression
暂无分享,去创建一个
[1] Paul W. Cuff,et al. The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List , 2014, IEEE Transactions on Information Theory.
[2] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[3] Paul W. Cuff,et al. Secrecy is cheap if the adversary must reconstruct , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[4] Neri Merhav,et al. Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian–Wolf Coding , 2015, IEEE Transactions on Information Theory.
[5] Thomas M. Cover,et al. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .
[6] Neri Merhav,et al. Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.
[7] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[8] Aaron B. Wagner,et al. Measuring secrecy by the probability of a successful guess , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[9] Shyue-Ching Lu. Random ciphering bounds on a class of secrecy systems and discrete message sources , 1979, IEEE Trans. Inf. Theory.
[10] John G. van Bosse,et al. Wiley Series in Telecommunications and Signal Processing , 2006 .
[11] Michel Loève,et al. Probability Theory I , 1977 .
[12] Neri Merhav,et al. The Shannon cipher system with a guessing wiretapper , 1999, IEEE Trans. Inf. Theory.
[13] Evgueni A. Haroutunian. On the Shannon cipher system with a wiretapper guessing subject to distortion and reliability requirements , 2002, Proceedings IEEE International Symposium on Information Theory,.
[14] Neri Merhav,et al. A Large Deviations Approach to Secure Lossy Compression , 2017, IEEE Trans. Inf. Theory.
[15] Neri Merhav,et al. Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.
[16] Tetsunao Matsuta,et al. 国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .
[17] H. Vincent Poor,et al. Secure lossless compression with side information , 2008, 2008 IEEE Information Theory Workshop.
[18] Rudolf Ahlswede,et al. Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.
[19] Rudolf Ahlswede,et al. Bad codes are good ciphers , 1982 .
[20] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[21] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[22] W. Rudin. Principles of mathematical analysis , 1964 .
[23] Paul W. Cuff. Using a secret key to foil an eavesdropper , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[24] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[25] Rudolf Ahlswede,et al. Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .
[26] Neri Merhav. Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels , 2008, IEEE Transactions on Information Theory.
[27] Lizhong Zheng,et al. Errors-and-Erasures Decoding for Block Codes With Feedback , 2008, IEEE Transactions on Information Theory.
[28] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[29] Hirosuke Yamamoto. Rate-distortion theory for the Shannon cipher system , 1997, IEEE Trans. Inf. Theory.
[30] H. Vincent Poor,et al. Lossless compression with security constraints , 2008, 2008 IEEE International Symposium on Information Theory.
[31] Paul W. Cuff,et al. Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.
[32] Neri Merhav. A large-deviations notion of perfect secrecy , 2003, IEEE Trans. Inf. Theory.
[33] Katalin Marton,et al. Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.
[34] Neri Merhav. On the shannon cipher system with a capacity-limited key-distribution channel , 2006, IEEE Transactions on Information Theory.
[35] K. Krippendorff. Mathematical Theory of Communication , 2009 .
[36] Martin E. Hellman,et al. An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.
[37] Paul W. Cuff,et al. The Henchman problem: Measuring secrecy by the minimum distortion in a list , 2014, ISIT.