4 search results - page 1 / 1 » Secure Computation of Constant-Depth Circuits with Applicati... |
CRYPTO
2005
Springer
14 years 13 days ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
IACR
2011
12 years 6 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 ...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...