Polylogarithmic Private Approximations and Efficient Matching
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- No. 117,p. 245-264
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On Private Scalar Product Computation for Privacy-Preserving Data Mining2005
- Efficient Private Matching and Set Intersection2004
- Secure Multiparty Computation of Approximations2001
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing2000
- One-Round Secure Computation and Secure Autonomous Mobile AgentsLecture Notes in Computer Science, 2000
- Computationally Private Information Retrieval with Polylogarithmic Communication1999
- Protecting data privacy in private information retrieval schemes1998
- The space complexity of approximating the frequency moments1996
- How to play ANY mental game1987
- A randomized protocol for signing contractsCommunications of the ACM, 1985