4616 search results - page 757 / 924 » The Communication Complexity of Correlation |
200
click to vote
ADHOCNOW
2005
Springer
16 years 22 days ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
208
click to vote
ASIACRYPT
2005
Springer
16 years 21 days ago
2005
Springer
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 ...
168
click to vote
ASIACRYPT
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
176
click to vote
DBISP2P
2005
Springer
16 years 21 days ago
2005
Springer
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
198
click to vote
DCOSS
2005
Springer
16 years 21 days ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...