International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Polylogarithmic Private Approximations and Efficient Matching

Authors:
Piotr Indyk
David P. Woodruff
Download:
DOI: 10.1007/11681878_13
URL: https://iacr.org/archive/tcc2006/38760246/38760246.pdf
Search ePrint
Search Google
Conference: TCC 2006
BibTeX
@inproceedings{tcc-2006-3682,
  title={Polylogarithmic Private Approximations and Efficient Matching},
  booktitle={Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3876},
  pages={245-264},
  url={https://iacr.org/archive/tcc2006/38760246/38760246.pdf},
  doi={10.1007/11681878_13},
  author={Piotr Indyk and David P. Woodruff},
  year=2006
}