Sciweavers

54 search results - page 6 / 11
» On the Concurrent Composition of Zero-Knowledge Proofs
Sort
View
JCS
2007
141views more  JCS 2007»
13 years 7 months ago
Compositional information flow security for concurrent programs
We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
FOSSACS
2005
Springer
14 years 1 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 1 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ENTCS
2008
153views more  ENTCS 2008»
13 years 7 months ago
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
Johan Dovland, Einar Broch Johnsen, Olaf Owe
ESOP
2009
Springer
14 years 2 months ago
Deny-Guarantee Reasoning
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...
Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Vikt...