Sciweavers

325 search results - page 10 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
CSFW
2006
IEEE
14 years 1 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
FUIN
2007
104views more  FUIN 2007»
13 years 7 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
ICLP
2007
Springer
14 years 1 months ago
Universal Timed Concurrent Constraint Programming
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...
CCS
2004
ACM
14 years 26 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
POPL
1995
ACM
13 years 11 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta