Guest Editor's Preface

Dimitris Gritzalis, Dimitris Gritzalis
2011 Journal of Computer Security  
Though it has grown slightly over the years to around 50 participants, CSFW has kept its general character: a small group of researchers meets in a relatively isolated spot to exchange ideas at the foundations of security. The enclosed papers are based upon the recommendation of the program committee. The authors revised their original papers and the results were reviewed according to the usual standards for JCS. (Editor-in-Chief Jon Millen graciously agreed to take over editorial duties for me
more » ... where there was potential for conflict of interest.) Two main areas of interest for CSFW over the years have been the formal analysis of security protocols and the mathematical characterization of information flow security. These continued to be well represented. Two of the papers were on the formal analysis of security protocols. "Fault-preserving simplifying transformations for security protocols" by Hui and Lowe describes techniques that allow the simplification of an actual protocol specification without removing any security faults in the process. This oddly desirable result is useful for analyzing the large protocols encountered in practice today, which are often too unwieldy to be easily amenable to formal analysis. The techniques in this paper allow the transformation of protocols into something more manageable while preserving the correctness of the analysis, and these techniques are illustrated in application to a large commercial protocol. In "Athena: a novel approach to efficient automatic security protocol analysis" Song, Berezin, and Perrig describe an automated verification tool, Athena, that is based on the Strand Space Model. This model was described in the special issue of JCS from CSFW11 and is proving to be very influential on the field as a whole. In this paper, Song et al. expand that model and design an associated logic and tool that also combines in techniques of theorem proving and model checking. In the area of of information flow security, Ryan and Schneider present "Process algebra and noninterference", a careful study of non-interference properties from the standpoint of process algebra. A central thesis of the paper is that much of the dispute over different formulations of noninterference can be fruitfully viewed as a dispute over different formulations of process equivalence. Ryan and Schneider show how one can gain insight into the nature of noninterference by recasting its various formulations within the framework of the process algebra CSP. In "A logic for SDSI's linked local name spaces", Halpern and van der Meyden present a logic for local names in Rivest and Lampson's Simple Distributed System Infrastructure (SDSI). SDSI's name spaces have been considered logically before, notably by Abadi; however, the logic and semantics in this paper more directly respects SDSI's name resolution algorithm. Also, Abadi speculated that his logic was
doi:10.3233/jcs-2011-0441 fatcat:ie5byugxdfgrdirr3bdwf6kuym