Sciweavers

609 search results - page 79 / 122
» Modelling and Checking Timed Authentication of Security Prot...
Sort
View
JOC
2008
86views more  JOC 2008»
13 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 3 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
ENTCS
2007
158views more  ENTCS 2007»
13 years 9 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
MOBIMEDIA
2007
13 years 10 months ago
AAA and mobile networks: security aspects and architectural efficiency
Security is a crucial factor in the provision of the network services, in both wireless and wired communications. Day by day, the number of subscribers is increased by an exponent...
Nicolas Sklavos, Spyros G. Denazis, Odysseas G. Ko...
ESORICS
2002
Springer
14 years 8 months ago
Formal Security Analysis with Interacting State Machines
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...
David von Oheimb, Volkmar Lotz