20 search results - page 3 / 4 » Oblivious RAM Revisited |
PKC
2010
Springer
13 years 8 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ASIACRYPT
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
IACR
2011
12 years 5 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
CCS
2009
ACM
14 years 6 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...