Sciweavers

114 search results - page 9 / 23
» Conditional Reactive Simulatability
Sort
View
ESORICS
2005
Springer
14 years 7 days ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann
ISW
2004
Springer
14 years 2 days ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 10 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ICST
2008
IEEE
14 years 1 months ago
Scheduling Timed Modules for Correct Resource Sharing
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...
Cristina Cerschi Seceleanu, Paul Pettersson, Hans ...
FSTTCS
2008
Springer
13 years 7 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn