22 search results - page 3 / 5 » Communication Complexity in Algebraic Two-Party Protocols |
PODC
2009
ACM
14 years 11 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
ISOLA
2010
Springer
13 years 9 months ago
2010
Springer
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
CRYPTO
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
CRYPTO
2001
Springer
14 years 3 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
WISEC
2010
ACM
14 years 3 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...