108 search results - page 7 / 22 » Communication Complexity of Key Agreement on Small Ranges |
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
TDSC
2011
13 years 2 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
TIT
2002
13 years 7 months ago
2002
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
COMPLEX
2009
Springer
14 years 2 months ago
2009
Springer
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...