172 search results - page 20 / 35 » Black-Box Constructions of Protocols for Secure Computation |
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
IACR
2011
12 years 7 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
IEEEARES
2008
IEEE
14 years 2 months ago
2008
IEEE
With the growing demand of databases outsourcing and its security concerns, we investigate privacy-preserving set intersection in a distributed scenario. We propose a one-round pr...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...