A compression perspective on secrecy measures
暂无分享,去创建一个
H. Vincent Poor | Yanina Shkel | Yanina Y. Shkel | H. Poor | Ieee H. Vincent Poor Life Fellow | Ieee Yanina Y. Shkel Member
[1] Martin J. Wainwright,et al. Local privacy and statistical minimax rates , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[2] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[3] 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).
[4] Neri Merhav,et al. Zero-Delay and Causal Secure Source Coding , 2015, IEEE Transactions on Information Theory.
[5] Jorma Rissanen,et al. Minimum Description Length Principle , 2010, Encyclopedia of Machine Learning.
[6] Hirosuke Yamamoto. A rate-distortion problem for a communication system with a secondary decoder to be hindered , 1988, IEEE Trans. Inf. Theory.
[7] Terence Chan,et al. Design of error-free perfect secrecy system by prefix codes and partition codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[8] Tsachy Weissman,et al. Multiterminal Source Coding Under Logarithmic Loss , 2011, IEEE Transactions on Information Theory.
[9] Rick S. Blum,et al. Variable-length compression and secrecy by design , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[10] Paul Cuff,et al. Information Theoretic Security and Privacy of Information Systems , 2016 .
[11] Sudeep Kamath,et al. An Operational Approach to Information Leakage , 2018, IEEE Transactions on Information Theory.
[12] Sergio Verdú,et al. Universal Compression, List Decoding, and Logarithmic Loss , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[13] Sudeep Kamath,et al. An operational measure of information leakage , 2016, 2016 Annual Conference on Information Science and Systems (CISS).
[14] Paul W. Cuff,et al. Rate-distortion theory for secrecy systems , 2013, 2013 IEEE International Symposium on Information Theory.
[15] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[16] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[17] John Kelsey,et al. Compression and Information Leakage of Plaintext , 2002, FSE.
[18] Charles V. Wright,et al. Spot Me if You Can: Uncovering Spoken Phrases in Encrypted VoIP Conversations , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[19] Sudeep Kamath,et al. Maximal leakage minimization for the Shannon cipher system , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[20] Paul W. Cuff,et al. The Henchman Problem: Measuring Secrecy by the Minimum Distortion in a List , 2014, IEEE Transactions on Information Theory.
[21] Neri Merhav,et al. Universal Prediction , 1998, IEEE Trans. Inf. Theory.
[22] Hirosuke Yamamoto. Coding theorems for Shannon's cipher system with correlated source outputs, and common information , 1994, IEEE Trans. Inf. Theory.
[23] Sergio Verdú,et al. A single-shot approach to lossy source coding under logarithmic loss , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[24] Alexandre V. Evfimievski,et al. Limiting privacy breaches in privacy preserving data mining , 2003, PODS.
[25] H. Vincent Poor,et al. Secrecy by Design With Applications to Privacy and Compression , 2021, IEEE Transactions on Information Theory.
[26] Sergio Verdú,et al. Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.
[27] Sergio Verdú,et al. Universal lossy compression under logarithmic loss , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).