Sciweavers

1497 search results - page 284 / 300
» A Computational Model for Message Passing
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
79
Voted
EUROPAR
2003
Springer
15 years 2 months ago
Exploring the Catallactic Coordination Approach for Peer-to-Peer Systems
Efficient discovery and resource allocation is one of the challenges of current Peer-to-Peer systems. In centralized approaches, the user requests can be matched to the fastest, ch...
Oscar Ardaiz, Pau Artigas, Torsten Eymann, Felix F...
SG
2009
Springer
15 years 2 months ago
User-Centered Development of a Visual Exploration System for In-Car Communication
Abstract. Modern premium automobiles are equipped with an increasing number of Electronic Control Units (ECUs). These ECUs are interconnected and form a complex network to provide ...
Michael Sedlmair, Benjamin Kunze, Wolfgang Hinterm...
ASIACRYPT
2001
Springer
15 years 2 months ago
How to Leak a Secret
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
Ronald L. Rivest, Adi Shamir, Yael Tauman
ATAL
2008
Springer
14 years 11 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan