120 search results - page 15 / 24 » A Practical and Secure Communication Protocol in the Bounded... |
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
ICQNM
2008
IEEE
14 years 2 months ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
EUROCRYPT
2003
Springer
14 years 26 days ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...