2016 search results - page 285 / 404 » Megamaps: Construction and Examples |
156
click to vote
FC
2010
Springer
15 years 8 months ago
2010
Springer
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
137
click to vote
ICDCS
2010
IEEE
15 years 8 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 ...
132
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
167
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
189
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...