1087 search results - page 24 / 218 » Distributed Oblivious Transfer |
190
click to vote
PKC
2010
Springer
15 years 9 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
167
click to vote
ASIACRYPT
2007
Springer
16 years 2 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...
180
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
167
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
167
click to vote
ANCS
2009
ACM
15 years 3 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...