9 search results - page 2 / 2 » Linear-Complexity Private Set Intersection Protocols Secure ... |
ACSC
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
FC
2005
Springer
13 years 10 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
JOC
2010
12 years 11 months ago
2010
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
PKC
2010
Springer
13 years 8 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...