Sciweavers

105 search results - page 2 / 21
» A General Composition Theorem for Secure Reactive Systems
Sort
View
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 2 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
82
Voted
EMSOFT
2003
Springer
15 years 2 months ago
Heterogeneous Reactive Systems Modeling and Correct-by-Construction Deployment
Abstract. We propose a mathematical framework to deal with the composition of heterogeneous reactive systems. Our theory allows to establish theorems, from which design techniques ...
Albert Benveniste, Luca P. Carloni, Paul Caspi, Al...
84
Voted
CSFW
2004
IEEE
15 years 1 months ago
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
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 protocol environ...
Michael Backes, Birgit Pfitzmann
FOCS
2003
IEEE
15 years 2 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
PPDP
2005
Springer
15 years 3 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet