Theory of Security and Applications: Joint Workshop, TOSCA 2011, Saarbrücken, Germany,March 31-April 1, 2011, Revised Selected Papers
Sebastian Moedersheim, Catuscia Palamidessi
Springer Science & Business Media, Jan 9, 2012 - Computers - 225 pages
This book constitutes the thoroughly refereed post-conference proceedings of the Joint Workshop on Theory of Security and Applications (formely known as ARSPA-WITS), TOSCA 2011, held in Saarbrücken, Germany, in March/April 2011, in association with ETAPS 2011.
The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 24 submissions. The papers feature topics including various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Union and Intersection Types for Secure Protocol Implementations
Secure Composition of Protocols
Constructive Cryptography A New Paradigm for Security Definitions and Proofs
Cryptographic Protocols from GoalDriven Specifications
Modeling LongTerm Signature Validation for Resolution of Dispute
Formal Analysis of Privacy for Anonymous Location Based Services
Formal Analysis of the EMV Protocol Suite
Security Goals and Protocol Transformations
ModelChecking Secure Information Flow for Multithreaded Programs
Multiple Congruence Relations FirstOrder Theories on Terms and the Frames of the Applied PiCalculus
Automated Code Injection Prevention for Web Applications
Soundness of Removing Cancellation Identities in Protocol Analysis under ExclusiveOR
Other editions - View all
abstract adversary Alamitos algebra algorithm anonymity applications assume attacker authentication calculus certificate channel ciphertext client code injection compiler Computer Security Computer Security Foundations configuration congruence relations consider constructive cryptography critical pair cryptographic protocols decryption deduction defined definition denoted derive digital signature disjoint encoding encryption equational theory equivalence example executed expression favor of Alice formal formula function goal Heidelberg implementation input interface intersection types knowledge nodes Lemma LNCS logic Los Alamitos multiple congruence nonce NonDisj one-time pad operational semantics pair parameters pi-calculus plaintext predicate properties ProVerif public key result rewrite system role Section secure channel secure information flow security protocols semantics server simulated skeleton specification Springer statement strand subtyping symbols syntax tags term terminal Theorem time-stamps transaction tree type system type-checker validation variables verify yvki zero-knowledge proofs