Sciweavers

1816 search results - page 1 / 364
» Trace oblivious computation
Sort
View
EUROPAR
2009
Springer
13 years 11 months ago
A Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
Andre Osterloh
MOBIHOC
2008
ACM
14 years 4 months ago
Bubble rap: social-based forwarding in delay tolerant networks
In this paper we seek to improve our understanding of human mobility in terms of social structures, and to use these structures in the design of forwarding algorithms for Pocket S...
Pan Hui, Jon Crowcroft, Eiko Yoneki
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 8 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
ASIACRYPT
2004
Springer
13 years 10 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger