18 search results - page 3 / 4 » Private Intersection of Certified Sets |
FC
2005
Springer
13 years 12 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 ...
ACNS
2011
Springer
12 years 10 months ago
2011
Springer
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
WISE
2000
Springer
13 years 10 months ago
2000
Springer
In this work we discuss a service that aims to make quoting of online documents, „web contents“ easy and provable. For that reason we report the conception of a gateway that w...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
CANS
2011
Springer
12 years 6 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...