Sums and lovers: Case studies in security, compositionality and refinement

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

Volumn 5850 LNCS, Issue , 2009, Pages 289-304

  McIver, Annabelle K ^a   Morgan, Carroll C ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Compositional semantics; Formalised secrecy; Hierarchical security reasoning; Refinement of security

Indexed keywords

COMPOSITIONAL SEMANTICS; COMPOSITIONALITY; FORMAL DEVELOPMENT; FORMAL TECHNIQUES; GENERALISATION; MODEL CHECKER; PROGRAM ALGEBRA; SECURE PROTOCOLS; SECURITY REQUIREMENTS; SECURITY-AWARE;

CAST IRON; FORMAL METHODS; IRON; MODEL CHECKING; NETWORK PROTOCOLS; RESEARCH; SEMANTICS;

NETWORK SECURITY;

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

References (23)

1. Appendices are available at, www.cse.unsw.edu.au/~carrollm/probs/ bibliographyBody.html#McIver:09
2. Černý, P.: Private communication (February 2009)
3. Alur, R., Černý, P., Zdancewic, S.: Preserving secrecy under refinement. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 107-118. Springer, Heidelberg (2006)
4. Bogetoft, P., Christensen, D.L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live, http://eprint.iacr.org/2008/068
5. Coble, A.: Formalized information-theoretic proofs of privacy using the HOL-4 theorem-prover. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 77-98. Springer, Heidelberg (2008)
6. Engelhardt, K., van der Meyden, R., Moses, Y.: A refinement theory that supports reasoning about knowledge and time. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 125-141. Springer, Heidelberg (2001)
7. Goguen, J.A., Meseguer, J.: Unwinding and inference control. In: Proc. IEEE Symp. on Security and Privacy, pp. 75-86 (1984)
8. Hoare, C.A.R.: A couple of novelties in the propositional calculus. Zeitschr für Math. Logik und Grundlagen der Math. 31(2), 173-178 (1985)
9. Leino, K.R.M., Joshi, R.: A semantic approach to secure information flow. Science of Computer Programming 37(1-3), 113-138 (2000)
10. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - A secure two-party computation system. In: Proc. 13th Conf. on USENIX Security Symposium. USENIX Association (2004)
11. Mantel, H.: Preserving information flow properties under refinement. In: Proc. IEEE Symp. Security and Privacy, pp. 78-91 (2001)
12. McIver, A.K., Cohen, E., Morgan, C., Gonzalia, C.: Using probabilistic Kleene algebra pKA for protocol verification. Journal of Logic and Algebraic Programming 76(1), 90-111 (2008)
13. Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice-Hall, Engle-wood Cliffs (1994), web.comlab.ox.ac.uk/oucl/publications/books/PfS/
14. Morgan, C.C.: The Shadow Knows: Refinement of ignorance in sequential programs. In: Uustalu, T. (ed.) Math. Prog. Construction. LNCS, vol. 4014, pp. 359-378. Springer, Heidelberg (2006) Treats Dining Cryptographers
15. Morgan, C.C.: The Shadow Knows: Refinement of ignorance in sequential programs. Science of Computer Programming 74(8) (2009) Treats Oblivious Transfer
16. Paulson, L.: Proving properties of security protocols by induction, http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-409.pdf
17. Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard University (1981), http://eprint.iacr.org/2005/187
18. 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
19. Ryan, P., Schneider, S., Goldsmith, M., Lowe, G., Roscoe, B.: Modelling and Analysis of Security Protocols. Addison-Wesley, Reading (2000)
20. Sabelfeld, A., Sands, D.: A PER model of secure information flow. Higher-Order and Symbolic Computation 14(1), 59-91 (2001)
21. Schoenmakers, B.: Cryptography lecture notes, http://www.win.tue.nl/ ~berry/2WC13/LectureNotes.pdf
22. http://www.deploy-project.eu
23. Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 160-164 (1982)