Sciweavers

199 search results - page 14 / 40
» Randomised Individual Communication Complexity
Sort
View
EUROCRYPT
1997
Springer
13 years 11 months ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
HOLOMAS
2003
Springer
14 years 21 days ago
The Link between Autonomy and Organisation in Multiagent Systems
Abstract. Market-based approaches have a long tradition in supporting of taskassignment multiagent systems. Such systems consist of customer agents with jobs to assign, and provide...
Michael Schillo, Klaus Fischer, Jörg H. Siekm...
CAV
2007
Springer
122views Hardware» more  CAV 2007»
13 years 11 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
SDMW
2004
Springer
14 years 25 days ago
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqian...
MDM
2010
Springer
213views Communications» more  MDM 2010»
13 years 5 months ago
Towards Adaptive Sensor Data Management for Distributed Fire Evacuation Infrastructure
— We introduce a novel strategy for data processing in Wireless Sensor Networks (WSNs) in the case of emergency fire evacuation with stringent delay constraints. Such networks sh...
Andrii Cherniak, Vladimir Zadorozhny