12th IEEE Computer Security Foundations Workshop: Proceedings of the 12th IEEE Computer Security Foundations Workshop : June 28-30, 1999, Mordano, Italy
IEEE Computer Society Press, 1999 - Computers - 239 pages
Formal models; notation, transformation, and simplification in security protocol analysis; strand spaces; local names; interaction and composition; logics for authorization and access control; advances in automated security protocol analysis; and non-interference using process algebras are the general themes of the 19 papers. The topics include a formal framework and evaluation method for the network denial of service, a meta-notation for protocol analysis, honest functions and their applications to the analysis of cryptographic protocols, the formalization and proof of secrecy properties, the secure composition of insecure components, and a logical framework for reasoning on data access control policies. Only authors are indexed. Annotation copyrighted by Book News, Inc., Portland, OR.
What people are saying - Write a review
We haven't found any reviews in the usual places.
IO Automaton Models and Proofs for SharedKey Communication Systems
Notation Transformation and Simplification
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
12 other sections not shown
Abadi abstraction access control actions agent algorithm Alice allow analysis apply atomic attack authentication authorization set axioms bisimulation bundle calculus channel checking clause client communication components composition Computer Security cryptographic protocols cryptosystem decomposition rule decryption defined definition delegation denial of service denote derivation downgrader encryption enemy environment equivalence example existential quantification finite formal formulas framework function high level IEEE Computer Society implementation information flow initial input interact intruder Intuitively Lemma linear logic Logic Programming model checking morphism multiset Needham-Schroeder node non-determinism nonce noninterference output penetrator predicate principal process algebra proof Proposition relation relative address represents request says secrecy Security and Privacy security policy security protocols semantics sequence server setc Spec specification spi-calculus strand space T-calculus Theorem theory tion tocol trace transformation transition verify wrappers X window system