Sciweavers

1087 search results - page 24 / 218
» Distributed Oblivious Transfer
Sort
View
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
13 years 11 months ago
On the Feasibility of Consistent Computations
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...
Sven Laur, Helger Lipmaa
ASIACRYPT
2007
Springer
14 years 1 months ago
Multi-party Indirect Indexing and Applications
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...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
ASIACRYPT
2005
Springer
14 years 1 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
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...
Vladimir Kolesnikov
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
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...
Alexander Fanghänel, Berthold Vöcking, H...
ANCS
2009
ACM
13 years 5 months ago
Weighted random oblivious routing on torus networks
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...
Rohit Sunkam Ramanujam, Bill Lin