23 search results - page 3 / 5 » Oblivious Polynomial Evaluation and Oblivious Neural Learnin... |
PKC
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
COLT
1992
Springer
15 years 1 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
73
Voted
ICISC
2008
14 years 11 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
ESORICS
2005
Springer
15 years 3 months ago
2005
Springer
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
CRYPTO
2010
Springer
14 years 6 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...