Sciweavers

117 search results - page 6 / 24
» Concurrent general composition of secure protocols in the ti...
Sort
View
FUIN
2007
104views more  FUIN 2007»
13 years 6 months ago
Modelling and Checking Timed Authentication of Security Protocols
In this paper we offer a novel methodology for verifying correctness of (timed) security protocols. The idea consists in computing the time of a correct execution of a session and ...
Gizela Jakubowska, Wojciech Penczek
FSTTCS
2003
Springer
13 years 12 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
CCS
2004
ACM
14 years 3 days ago
Authenticity by tagging and typing
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
CSFW
2007
IEEE
14 years 1 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
ICFEM
2010
Springer
13 years 5 months ago
A Semantic Model for Service Composition with Coordination Time Delays
The correct behavior of a service composition depends on the appropriate coordination of its services. According to the idea of channelbased coordination, services exchange message...
Natallia Kokash, Behnaz Changizi, Farhad Arbab