Secrecy-preserving refinement

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

Volumn 2021 LNCS, Issue , 2001, Pages 135-152

  Jürjens, Jan ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS; SOFTWARE ENGINEERING;

ABSTRACT SPECIFICATIONS; CRYPTOGRAPHIC PRIMITIVES; REFINEMENT OPERATORS; SECRECY PROPERTIES; SECURITY PROPERTIES; SPECIFICATION FRAMEWORKS; SYSTEM DEVELOPMENT; SYSTEM PROPERTY; STEPWISE REFINEMENT;

FORMAL METHODS;

EID: 84881150179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45251-6_8     Document Type: Conference Paper

References (30)

1. M. Abadi. Security protocols and their properties. In F.L. Bauer and R. Steinbrueggen, editors, Foundations of Secure Computation, pages 39-60. IOS Press, 2000. 20th Int. Summer School, Marktoberdorf, Germany.
2. M. Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, January 1999.
3. M. Abadi and Jan Jurjens. Formal eavesdropping and its computational interpretation, 2000. submitted.
4. V. Apostolopoulos, V. Peris, and D. Saha. Transport layer security: How much does it really cost ? In Conference on Computer Communications (IEEE Infocom), New York, March 1999.
5. M. Abadi and P. Rogaway. Reconciling two views of cryptography (invited lecture). In TCS 2000 (IFIP conference), Japan, August 2000.
6. B.W. Boehm. Software Engineering Economics. Prentice-Hall, 1981.
7. M. Broy. A logical basis for component-based systems engineering. In M. Broy and R. Steinbruggen, editors, Calculational System Design. IOS Press, 1999.
8. M. Broy and K. Stølen. Specification and Development of Interactive Systems. Springer, 2000. (to be published).
9. L. Cardelli, G. Ghelli, and A. Gordon. Secrecy and group creation. In CONCUR 2000, pages 365-379, 2000.
10. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
11. S. Fitzgerald, T. M. Brookes, M. A. Green, and P. G. Larsen. Formal and informal specifications of a secure system component: first results in a comparative study. In M. Naftalin, B. T. Denvir, and M. Bertran, editors, FME'94: Industrial Benefit of Formal Methods, pages 35-44. Springer, 1994.
12. F. Huber, S. Molterer, A. Rausch, B. Schatz, M. Sihling, and O. Slotosch. Tool supported Specification and Simulation of Distributed Systems. In International Symposium on Software Engineering for Parallel and Distributed Systems, pages 155-164, 1998.
13. Jan Jürjens. Abstracting from failure probabilities, 2000. submitted.
14. Jan Jürjens. Composability of secrecy, 2000. submitted.
15. Jan Jürjens. Secure information flow for concurrent processes. In C. Palamidessi, editor, CONCUR 2000 (11th International Conference on Concurrency Theory), volume 1877 of LNCS, pages 395-409, Pennsylvania, 2000. Springer.
16. Jan Jürjens. Towards development of secure systems using UML. In H. Hußmann, editor, Fundamental Approaches to Software Engineering, LNCS. Springer, 2001. to be published.
17. P. G. Larsen, S. Fitzgerald, T. M. Brookes, and M. A. Green. Formal modelling and simulation in the development of a security-critical message processing system. In Formal Methods, Modelling and Simulation for Systems Engineering, 1995.
18. V. Lotz. Formally defining security properties with relations on streams. Electronical Notes in Theoretical Computer Science, 32, 2000.
19. H. Mantel. Possibilistic definitions of security - an assembly kit. In IEEE Computer Security Foundations Workshop, 2000.
20. J. McLean. Security models. In John Marciniak, editor, Encyclopedia of Software Engineering. Wiley & Sons, Inc., 1994.
21. J. McLean. A general theory of composition for a class of "possibilistic" properties. IEEE Transactions on Software Engineering, 22(1):53-67, 1996.
22. C. Meadows. Using traces based on procedure calls to reason about com-posability. In IEEE Symposium on Security and Privacy, pages 177 - 188, 1992.
23. C. Meadows. Formal verification of cryptographic protocols: A survey. In Asiacrypt 96, 1996.
24. B. Pfitzmann. Higher cryptographic protocols, 1998. Lecture Notes, Universität des Saarlandes.
25. P. Ryan and S. Schneider. An attack on a recursive authentication protocol. Inform. Proc. Letters, 65:7-10, 1998.
26. P. Ryan and S. Schneider. Process algebra and non-interference. In IEEE Computer Security Foundations Workshop, 1999.
27. A. Roscoe, J. Woodcock, and L. Wulf. Non-interference through determinism. In ESORICS 94, volume 875 of LNCS. Springer, 1994.
28. S. Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174-187, 1996.
29. J. Saltzer and M. Schroeder. The protection of information in computer systems. Proceedings of the IEEE, 63(9):1278-1308, September 1975.
30. P. Sewell and J. Vitek. Secure composition of untrusted code: Wrappers and causality types. In CSFW, 2000.