Quantifying information leakage in process calculi

Information and Computation

Volumn 207, Issue 6, 2009, Pages 699-725

  Boreale, Michele ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Information leakage; Information theory; Process calculi; Secrecy

Indexed keywords

AMOUNT OF INFORMATIONS; COMPOSITIONALITY; COMPUTATIONAL POWER; EXTRACTION COSTS; IN PROCESS; INFORMATION LEAKAGE; LEAKAGE RATES; PI CALCULUS; PROCESS CALCULI; QUANTITATIVE MODELS; SECRECY; SIMPLE INFORMATIONS; TESTING EQUIVALENCES;

BIOMINERALIZATION; INFORMATION THEORY; PATHOLOGY;

EXPERIMENTS;

EID: 67349145950     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.12.007     Document Type: Article

References (35)

1. Abadi M., and Gordon A. A calculus for cryptographic protocols: the Spi-calculus. Information and Computation 148 1 (1999) 1-70
2. Aldini A., Bravetti M., and Gorrieri R. A process-algebraic approach for the analysis of probabilistic non-interference. Journal of Computer Security 12 2 (2004) 191-245 IOS Press, March
3. E. Bach, et al., What's a key-guessing attack? What's entropy? in: Cryptography Frequently Asked Questions, Section 4.9. Avaliable from: .
4. M. Boreale, Quantifying information leakage in process calculi, in: ICALP 2006, LNCS, vol. 4052, Springer, 2006.
5. Boreale M., and De Nicola R. Testing equivalence for mobile processes. Information and Computation 120 2 (1995) 279-303
6. Boreale M., and De Nicola R. A symbolic semantics for the pi-calculus. Information and Computation 126 1 (1996) 34-52
7. C. Braun, K. Chatzikokolakis, C. Palamidessi, Compositional methods for information-hiding, in: Proceedings of FOSSACS'08, LNCS, vol. 4962, Springer, 2008.
8. K. Chatzikokolakis, C. Palamidessi, P. Panangaden, Anonymity protocols as noisy channels, in: Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC 06), Springer, LNCS, 2006, Full version in Information and Computation, 206 (2008), 378-401.
9. K. Chatzikokolakis, C. Palamidessi, P. Panangaden, Probability of error in information-hiding protocols, in: Proceedings of the 20th IEEE CSF, IEEE Computer Society, 2007.
10. Clark D., Hunt S., and Malacaria P. Quantitative analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science 59 3 (2001)
11. Clark D., Hunt S., and Malacaria P. Quantitative information flow, relations and polymorphic types. Journal of Logic and Computation 15 2 (2005) 181-199
12. Clark D., Hunt S., and Malacaria P. A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security 15 3 (2007) 321-371
13. Cover T.M., and Thomas J.A. Elements of Information Theory (1991), Wiley, New York
14. De Nicola R., and Hennessy M.C.B. Testing equivalences for processes. Theoretical Computer Science 34 (1984) 83-133
15. A. Di Pierro, C. Hankin, H. Wiklicky, Approximate non-interference, in: Computer Security Foundations Workshop, 2002, Full version in Journal of Computer Security 12 (1) (2004) 37-82.
16. Focardi R., and Gorrieri R. A classification of security properties. Journal of Computer Security 3 1 (1995) 5-34
17. Goguen J.A., and Meseguer J. Security policies and security models. IEEE Symposium on Security and Privacy (1982)
18. J.W. Gray III, Towards a mathematical foundation for information flow security, in: Proceedings of 1991 IEEE Symposium on Research in Computer Security and Privacy, 1991.
19. Hennessy M.C.B., and Lin H. Symbolic bisimulations. Theoretical Computer Science 138 2 (1995) 353-389
20. P. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems, in: CRYPTO 1996, 1996, pp. 104-113.
21. P. Kocher, J. Jaffe, B. Jun, Differential power analysis, in: CRYPTO 1999, 1999, pp. 388-397.
22. Köpf B., and Basin D.A. An information-theoretic model for adaptive side-channel attacks. ACM Conference on Computer and Communications Security (2007) 286-296
23. Lowe G. Defining information flow quantity. Journal of Computer Security 12 3-4 (2004) 619-653
24. P. Malacaria, Assessing security threats of looping constructs, in: POPL 2007.
25. J.L. Massey. Guessing and entropy, in: Proceedings of IEEE International Symposium on Information Theory, 1994, p. 204.
26. J. Millen, Covert channel capacity, in: Proceedings of 1987 IEEE Symposium on Research in Computer Security and Privacy, 1987.
27. J.O. Pliam, On the incomparability of entropy and marginal guesswork in Brute-force attacks, in: Proceedings of Progress in Cryptology - INDOCRYPT 2000, First International Conference in Cryptology in India, Calcutta, India, December 2000, LNCS, vol. 1977, Springer-Verlag.
28. Reiter M., and Rubin A. Crowds: anonymity for web transactions. ACM Transactions on Information and System Security 1 1 (1998)
29. Sangiorgi D., and Walker D. The Pi-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
30. Shannon C.E. Communication theory of secrecy systems. Bell System Technical Journal 27 (1948) 379-423 623-656
31. F.-X. Standaert, E. Peeters, C. Archambeau, J.-J. Quisquater, Towards security limits in side-channel attacks, in: Proceedings of CHES 2006, Lecture Notes in Computer Science, vol. 4249, Yokohama, Japan, October 2006, Springer-Verlag, pp. 30-45.
32. F.-X. Standaert, T.G. Malkin, M. Yung, A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks, Cryptology ePrint Archive, Report 2006/139, February 2008.
33. F. Topsøe, Basic concepts, identities and inequalities - the Toolkit of information theory, Entropy 3 (2001) 162-190. Available from: .
34. D. Volpano, G. Smith, Verifying secrets and relative secrecy, in: POPL 2000, 2000, pp. 268-276.
35. J.T. Wittbold, D. Johnson, Information flow in nondeterministic systems, in: Proceedings of 1990 IEEE Symposium on Research in Computer Security and Privacy, 1990.