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...
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...
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...
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 ...
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 ...