Sciweavers

390 search results - page 27 / 78
» Computing shortest paths for any number of hops
Sort
View
102
Voted
ICNP
1999
IEEE
15 years 6 months ago
Policy Disputes in Path-Vector Protocols
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based met...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 3 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
110
Voted
TOC
2008
94views more  TOC 2008»
15 years 1 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
GLOBECOM
2009
IEEE
15 years 8 months ago
Hierarchical Network Formation Games in the Uplink of Multi-Hop Wireless Networks
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
Walid Saad, Quanyan Zhu, Tamer Basar, Zhu Han, Are...
ICNP
2003
IEEE
15 years 7 months ago
Characterizing Overlay Multicast Networks
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Sonia Fahmy, Minseok Kwon