Sciweavers

10301 search results - page 1987 / 2061
» informs 2007
Sort
View
FOCS
2007
IEEE
15 years 11 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
FOCS
2007
IEEE
15 years 11 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
GLOBECOM
2007
IEEE
15 years 11 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
117
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
A Measurement Study of Piece Population in BitTorrent
—BitTorrent is the most popular peer-to-peer software for file sharing, which has contributed to a significant portion of today’s Internet traffic. Many measurement studies ...
Cameron Dale, Jiangchuan Liu
HASE
2007
IEEE
15 years 11 months ago
Scalable, Adaptive, Time-Bounded Node Failure Detection
This paper presents a scalable, adaptive and timebounded general approach to assure reliable, real-time Node-Failure Detection (NFD) for large-scale, high load networks comprised ...
Matthew Gillen, Kurt Rohloff, Prakash Manghwani, R...
« Prev « First page 1987 / 2061 Last » Next »