Efficient Private Matching and Set Intersection
Top Cited Papers
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Limiting privacy breaches in privacy preserving data miningPublished by Association for Computing Machinery (ACM) ,2003
- Using multiple hash functions to improve IP lookupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fair and efficient solution to the socialist millionaires’ problemDiscrete Applied Mathematics, 2001
- Secure Multiparty Computation of ApproximationsLecture Notes in Computer Science, 2001
- A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key SystemLecture Notes in Computer Science, 2001
- Priced Oblivious Transfer: How to Sell Digital GoodsLecture Notes in Computer Science, 2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Computationally Private Information Retrieval with Polylogarithmic CommunicationLecture Notes in Computer Science, 1999
- Balanced AllocationsSIAM Journal on Computing, 1999
- Comparing information without leaking itCommunications of the ACM, 1996