Sciweavers

269 search results - page 8 / 54
» Online oblivious routing
Sort
View
JUCS
2008
156views more  JUCS 2008»
13 years 7 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
CCCG
2006
13 years 8 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
CAL
2008
13 years 7 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
IPPS
2006
IEEE
14 years 1 months ago
Oblivious parallel probabilistic channel utilization without control channels
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
Christian Schindelhauer
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...