Privacy-Preserving Group Discovery with Linear Complexity

Mark Manulis, Benny Pinkas, Bertram Poettering. Privacy-Preserving Group Discovery with Linear Complexity. In Jianying Zhou, Moti Yung, editors, Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Beijing, China, June 22-25, 2010. Proceedings. Volume 6123 of Lecture Notes in Computer Science, pages 420-437, 2010. [doi]

@inproceedings{ManulisPP10,
  title = {Privacy-Preserving Group Discovery with Linear Complexity},
  author = {Mark Manulis and Benny Pinkas and Bertram Poettering},
  year = {2010},
  doi = {10.1007/978-3-642-13708-2_25},
  url = {http://dx.doi.org/10.1007/978-3-642-13708-2_25},
  tags = {discovery},
  researchr = {https://researchr.org/publication/ManulisPP10},
  cites = {0},
  citedby = {0},
  pages = {420-437},
  booktitle = {Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Beijing, China, June 22-25, 2010. Proceedings},
  editor = {Jianying Zhou and Moti Yung},
  volume = {6123},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-642-13707-5},
}