Quantifying the correctness, computational complexity, and security of privacy-preserving string comparators for record linkage. Durham, E., Xue, Y., Kantarcioglu, M., & Malin, B. A. Inf. Fusion, 13(4):245–259, 2012.
Quantifying the correctness, computational complexity, and security of privacy-preserving string comparators for record linkage [link]Paper  doi  bibtex   
@article{DBLP:journals/inffus/DurhamXKM12,
  author    = {Elizabeth Durham and
               Yuan Xue and
               Murat Kantarcioglu and
               Bradley A. Malin},
  title     = {Quantifying the correctness, computational complexity, and security
               of privacy-preserving string comparators for record linkage},
  journal   = {Inf. Fusion},
  volume    = {13},
  number    = {4},
  pages     = {245--259},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.inffus.2011.04.004},
  doi       = {10.1016/j.inffus.2011.04.004},
  timestamp = {Thu, 11 Nov 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/inffus/DurhamXKM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0