Quantitative Notions of Leakage for One-try Attacks

Electronic Notes in Theoretical Computer Science

Volumn 249, Issue , 2009, Pages 75-91

  Braun, Christelle ^a   Chatzikokolakis, Konstantinos ^b   Palamidessi, Catuscia ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

hypothesis testing; Information hiding; probability of error; R nyi min entropy

Indexed keywords

COMPUTER SCIENCE;

HYPOTHESIS TESTING; INFORMATION HIDING; INFORMATION LEAKAGE; MIN-ENTROPY; MUTUAL INFORMATIONS; PROBABILITY OF ERRORS; QUANTITATIVE THEORY; SECURE INFORMATION FLOW;

INFORMATION THEORY;

EID: 68549126859     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.07.085     Document Type: Article

References (15)

1. Cachin, C., "Entropy Measures and Unconditional Security in Cryptography," Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, Switzerland (1997). URL ftp://ftp.inf.ethz.ch/pub/publications/dissertations/th12187.ps.gz
2. Chatzikokolakis K., Palamidessi C., and Panangaden P. Anonymity protocols as noisy channels. Information and Computation 206 (2008) 378-401. http://hal.inria.fr/inria-00349225/en/ URL
3. Chatzikokolakis K., Palamidessi C., and Panangaden P. On the bayes risk in information-hiding protocols. Journal of Computer Security 16 (2008) 531-571. http://hal.inria.fr/inria-00349224/en/ URL
4. Clark D., Hunt S., and Malacaria P. Quantitative information flow, relations and polymorphic types. Journal of Logic and Computation, Special Issue on Lambda-calculus, type theory and natural language 18 (2005) 181-199
5. Cover T.M., and Thomas J.A. Elements of Information Theory (1991), John Wiley & Sons, Inc.
6. Dodis Y., Ostrovsky R., Reyzin L., and Smith A. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput 38 (2008) 97-139. http://dx.doi.org/10.1137/060651380 URL
7. Malacaria P. Assessing security threats of looping constructs. In: Hofmann M., and Felleisen M. (Eds). Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2007, Nice, France, January 17-19, 2007 (2007) 225-235. http://doi.acm.org/10.1145/1190216.1190251 URL
8. Malacaria, P. and H. Chen, Lagrange multipliers and maximum information leakage in different observational models, in: Úlfar Erlingsson and Marco Pistoia, editor, Proceedings of the 2008 Workshop on Programming Languages and Analysis for Security (PLAS 2008) (2008), pp. 135-146
9. Moskowitz, I.S., R.E. Newman, D.P. Crepeau and A.R. Miller, Covert channels and anonymizing networks., in: S. Jajodia, P. Samarati and P.F. Syverson, editors, WPES (2003), pp. 79-88
10. Moskowitz, I.S., R.E. Newman and P.F. Syverson, Quasi-anonymous channels, in: IASTED CNIS, 2003, pp. 126-131
11. Rény, A., On measures of entropy and information, in: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics, and Probability, 1960, pp. 547-561
12. Smith G. Adversaries and information leaks (tutorial). In: Barthe G., and Fournet C. (Eds). Proceedings of the Third Symposium on Trustworthy Global Computing. Lecture Notes in Computer Science 4912 (2007) 383-400
13. URL. http://dx.doi.org/10.1007/978-3-540-78663-4_25
14. Smith G. On the foundations of quantitative information flow. In: De Alfaro L. (Ed). Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures. (FOSSACS 2009). Lecture Notes in Computer Science 5504 (2009) 288-302
15. Zhu, Y. and R. Bettati, Anonymity vs. information leakage in anonymity systems, in: Proc. of ICDCS (2005), pp. 514-524