Sciweavers

117 search results - page 5 / 24
» Concurrent general composition of secure protocols in the ti...
Sort
View
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
13 years 12 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
ESORICS
2004
Springer
14 years 2 days ago
A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
14 years 1 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
ERSHOV
2003
Springer
13 years 12 months ago
Integration of Functional and Timed Testing of Real-Time and Concurrent Systems
The article presents an approach to model based testing of complex systems based on a generalization of finite state machines (FSM) and input output state machines (IOSM). The app...
Victor V. Kuliamin, Alexandre Petrenko, Nick V. Pa...
CSFW
2006
IEEE
14 years 22 days 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