Sciweavers

752 search results - page 96 / 151
» Abstract models for dialogue protocols
Sort
View
158
Voted
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 4 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
126
Voted
ICSOC
2009
Springer
15 years 10 months ago
An Automatic Approach to Enable Replacement of Conversational Services
Abstract. In Service Oriented Architectures (SOAs) services invoked in a composition can be replaced by other services, which are possibly discovered and bound at runtime. Most of ...
Luca Cavallaro, Elisabetta Di Nitto, Matteo Pradel...
136
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
On the Routing Problem in Disconnected Vehicular Ad-hoc Networks
Abstract— Vehicular Ad Hoc Wireless Network (VANET) exhibits a bipolar behavior in terms of network topology: fully connected topology with high traffic volume or sparsely conne...
Nawaporn Wisitpongphan, Fan Bai, Priyantha Mudalig...
101
Voted
CONCUR
2007
Springer
15 years 9 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
151
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz