The adoption of the Dolev-Yao model, an abstraction of security protocols that supports symbolic reasoning, is responsible for many successes in protocol analysis. In particular, it has enabled using logic effectively to reason about protocols. One recent framework for expressing the basic assumptions of the Dolev-Yao model is given by strand spaces, certain directed graphs whose structure reflects causal inter- actions among protocol participants. We represent strand constructions as relatively simple formulas in first-order linear logic, a refinement of traditional logic known for an intrinsic and natural accounting of process states, events, and resources. The proposed encoding is shown to be sound and complete. Interestingly, this encoding differs from the multiset rewriting definition of the Dolev-Yao model, which is also based on linear logic. This raises the possibility that the multiset rewriting framework may differ from strand spaces in some subtle way, although the two settings are known to agree on the basic secrecy property.

This book constitutes the refereed proceedings of the 5th International Symposium on Functional and Logic Programming, FLOPS 2001, held in Tokyo, Japan in March 2001. The 21 revised full papers presented together with three invited papers were carefully reviewed and selected from 40 submissions. The book offers topical sections on functional programming, logic programming, functional logic programming, types, program analysis and transformation, and Lambda calculus.

This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.

This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.

This Festschrift was published in honor of Joshua Guttman on the occasion of his 66.66 birthday. The impact of his work is reflected in the 23 contributions enclosed in this volume. Joshua’s most influential and enduring contribution to the field has been the development of the strand space formalism for analyzing cryptographic protocols. It is one of several “symbolic approaches” to security protocol analysis in which the underlying details of cryptographic primitives are abstracted away, allowing a focus on potential flaws in the communication patterns between participants. His attention to the underlying logic of strand spaces has also allowed him to merge domain-specific reasoning about protocols with general purpose, first-order logical theories. The identification of clear principles in a domain paves the way to automated reasoning, and Joshua has been a leader in the development and distribution of several tools for security analysis.

This book presents the refereed proceedings of the International Workshop on Mathematical Methods, Models, and Architectures for Network Security Systems, MMM-ACNS 2001, held in St. Petersburg in May 2001. The 24 revised full papers presented together with five invited contributions were carefully reviewed and selected from 36 submissions. The papers are organized in topical sections on network security systems: foundations, models and architectures; intrusion detection: foundations and models; access control, authentication, and authorization; and cryptography and steganography: mathematical basis, protocols, and applied methods.