Sciweavers

12183 search results - page 2135 / 2437
» Computers under Attacks!
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 10 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
ASIACRYPT
2007
Springer
15 years 10 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
169
Voted
CHIMIT
2007
ACM
15 years 10 months ago
Network-centricity: hindered by hierarchical anchors
Network-centricity is a concept under consideration as a useful paradigm for complex organizational operations, combining the strengths of bureaucracy with the innovative possibil...
Steve Abrams, Gloria Mark
DEBS
2007
ACM
15 years 10 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...
ICDCS
2010
IEEE
15 years 10 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—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 ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
« Prev « First page 2135 / 2437 Last » Next »