Compositional closure for bayes risk in probabilistic noninterference

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 223-235

  McIver, Annabelle ^a   Meinicke, Larissa ^a   Morgan, Carroll ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BAYES RISK; COMPOSITIONALITY; PROBABILISTIC NONINTERFERENCE; SEQUENTIAL MODEL;

LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 77955318658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_19     Document Type: Conference Paper

References (20)

1. Braun, C., Chatzikokolakis, K., Palamidessi, C.: Compositional methods for information-hiding. In: Amadio, R. M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 443-457. Springer, Heidelberg (2008)
2. Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proc. MFPS. ENTCS, vol. 249, Elsevier, Amsterdam (2009)
3. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Probability of error in information-hiding protocols. In: Proc. CSF, pp. 341-354. IEEE, Los Alamitos (2007)
4. Chaum, D.: The Dining Cryptographers problem: Unconditional sender and recipient untraceability. Jnl. Cryptol. 1 (1), 65-75 (1988)
5. Goguen, J. A., Meseguer, J.: Unwinding and inference control. In: Proc. IEEE Symp on Security and Privacy, pp. 75-86. IEEE, Los Alamitos (1984)
6. Probabilistic Systems Group, http://www.cse.unsw.edu.au/~carrollm/probs
7. Köpf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: Proc. 14th ACM Conf. Comp. Comm. Security (2007)
8. Kozen, D.: A probabilistic PDL. Jnl. Comp. Sys. Sci. 30 (2), 162-178 (1985)
9. Massey, J. L.: Guessing and entropy. In: Proc. IEEE International Symposium on Information Theory, p. 204 (1994)
10. McIver, A. K., Meinicke, L. A., Morgan, C. C.: Draft of this paper including its appendices [6, McIver:10]
11. McIver, A. K., Meinicke, L. A., Morgan, C. C.: Draft full version of this paper, http://www.comp.mq.edu.au/~lmeinick/icalp.pdf
12. McIver, A. K., Morgan, C. C.: Abstraction, Refinement and Proof for Probabilistic Systems. Tech. Mono. Computer Science. Springer, Heidelberg (2005)
13. McIver, A. K., Morgan, C. C.: Sums and lovers: Case studies in security, compositionality and refinement. In: Cavalcanti, A., Dams, D. (eds.) Proc. FM 2009. LNCS, vol. 5850, Springer, Heidelberg (2009), Treats Two-Party Secure Computation
14. Morgan, C. C.: The Shadow Knows: Refinement of ignorance in sequential programs. Science of Computer Programming 74 (8) (2009), Treats Oblivious Transfer
15. Pliam, J. O.: On the incomparability of entropy and marginal guesswork in bruteforce attacks. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 67-79. Springer, Heidelberg (2000)
16. Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initialiser. Technical report, M. I. T. (1999), http://theory.lcs.mit.edu/~rivest/Rivest-commitment.pdf
17. Shannon, C. E.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656 (1948)
18. Smith, G.: Adversaries and information leaks. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol. 4912, pp. 383-400. Springer, Heidelberg (2008)
19. Trustrum, K.: Linear Programming. Library of Mathematics. Routledge and Kegan Paul, London (1971)
20. Yao, A. C.: Protocols for secure computations (extended abstract). In: Proc. FOCS 1982, pp. 160-164. IEEE, Los Alamitos (1982)