Sciweavers

Share
11 search results - page 1 / 3
» Type-Based Verification of Correspondence Assertions for Com...
Sort
View
APLAS
2007
ACM
10 years 3 months ago
Type-Based Verification of Correspondence Assertions for Communication Protocols
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
Daisuke Kikuchi, Naoki Kobayashi
CSFW
2007
IEEE
10 years 6 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
RSP
2007
IEEE
139views Control Systems» more  RSP 2007»
10 years 6 months ago
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifyi...
Doron Drusinsky, Man-tak Shing
CCS
2008
ACM
10 years 1 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...
SCN
2011
Springer
292views Communications» more  SCN 2011»
9 years 6 months ago
Synthesis of attack actions using model checking for the verification of security protocols
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
books