23 search results - page 4 / 5 » Practical Private Set Intersection Protocols with Linear Com... |
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels 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...
CRYPTO
2005
Springer
14 years 1 months 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 ...
PERVASIVE
2008
Springer
13 years 7 months ago
2008
Springer
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...