Polylogarithmic Private Approximations and Efficient Matching
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- No. 117,p. 245-264
- https://doi.org/10.1007/11681878_13
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On Private Scalar Product Computation for Privacy-Preserving Data MiningLecture Notes in Computer Science, 2005
- Efficient Private Matching and Set IntersectionLecture Notes in Computer Science, 2004
- Secure Multiparty Computation of ApproximationsLecture Notes in Computer Science, 2001
- Reducing the Servers Computation in Private Information Retrieval: PIR with PreprocessingLecture Notes in Computer Science, 2000
- One-Round Secure Computation and Secure Autonomous Mobile AgentsLecture Notes in Computer Science, 2000
- Computationally Private Information Retrieval with Polylogarithmic CommunicationLecture Notes in Computer Science, 1999
- Protecting data privacy in private information retrieval schemesPublished by Association for Computing Machinery (ACM) ,1998
- The space complexity of approximating the frequency momentsPublished by Association for Computing Machinery (ACM) ,1996
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- A randomized protocol for signing contractsCommunications of the ACM, 1985