Sciweavers

361 search results - page 23 / 73
» Composition of Password-Based Protocols
Sort
View
SIGSOFT
2010
ACM
13 years 6 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 9 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena
IEEESCC
2009
IEEE
14 years 3 months ago
Dynamic Service Composition in Ambient Intelligence Environment
In Ambient Intelligence (AmI) environments, some services provided by AmI devices are often not visible to users and to other devices. The existing approaches deal with servicesā€...
Yazid Benazzouz, Nicolas Sabouret, Belkacem Chikha...
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 2 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 deļ¬nitional ļ¬‚avours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ARTS
1999
Springer
14 years 28 days ago
Process Algebra with Probabilistic Choice
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
Suzana Andova