5793 search results - page 1000 / 1159 » Individual communication complexity |
ASPDAC
2005
ACM
14 years 3 months ago
2005
ACM
— With the rise in complexity of modern systems, designers are spending a significant time on at the system level of abstraction. This paper introduces Model Algebra, a formalis...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ADHOCNOW
2005
Springer
14 years 3 months 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...
ASIACRYPT
2005
Springer
14 years 3 months 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 ...
ASIACRYPT
2005
Springer
14 years 3 months 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...