Sciweavers

661 search results - page 55 / 133
» Robustness Guarantees for Anonymity
Sort
View
SASO
2008
IEEE
15 years 7 months ago
Autonomic Request Management Algorithms for Geographically Distributed Internet-Based Systems
Supporting Web-based services through geographical distributed clusters of servers is a common solution to the increasing volume and variability of modern traffic. These architec...
Mauro Andreolini, Sara Casolari, Michele Colajanni
ICOIN
2005
Springer
15 years 6 months ago
A Self-organized Authentication Architecture in Mobile Ad-Hoc Networks
Abstract. Network security is considered one of the obstacles that prevent the wide deployment of ad-hoc wireless networks. Among many security problems, authentication is the most...
Seongil Hahm, Yongjae Jung, Seunghee Yi, Yukyoung ...
95
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 23 days ago
Why neighbor-joining works
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
Radu Mihaescu, Dan Levy, Lior Pachter
97
Voted
JOC
2007
93views more  JOC 2007»
15 years 19 days ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
130
Voted
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek