@inproceedings{conf/eurocrypt/FreedmanNP04,
  added-at = {2017-05-24T00:00:00.000+0200},
  author = {Freedman, Michael J. and Nissim, Kobbi and Pinkas, Benny},
  biburl = {https://www.bibsonomy.org/bibtex/2011ed30761e599fbee66d6eea0be97a4/dblp},
  booktitle = {EUROCRYPT},
  crossref = {conf/eurocrypt/2004},
  editor = {Cachin, Christian and Camenisch, Jan},
  ee = {https://doi.org/10.1007/978-3-540-24676-3_1},
  interhash = {948899a0481df1b1e66fc9fce78792e0},
  intrahash = {011ed30761e599fbee66d6eea0be97a4},
  isbn = {3-540-21935-8},
  keywords = {dblp},
  pages = {1-19},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T18:58:30.000+0200},
  title = {Efficient Private Matching and Set Intersection.},
  url = {http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2004.html#FreedmanNP04},
  volume = 3027,
  year = 2004
}

{"_id":"iZT86dSMJWALrwYvf","bibbaseid":"freedman-nissim-pinkas-efficientprivatematchingandsetintersection-2004","authorIDs":[],"author_short":["Freedman, M. J.","Nissim, K.","Pinkas, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-24T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Freedman"],"firstnames":["Michael","J."],"suffixes":[]},{"propositions":[],"lastnames":["Nissim"],"firstnames":["Kobbi"],"suffixes":[]},{"propositions":[],"lastnames":["Pinkas"],"firstnames":["Benny"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2011ed30761e599fbee66d6eea0be97a4/dblp","booktitle":"EUROCRYPT","crossref":"conf/eurocrypt/2004","editor":[{"propositions":[],"lastnames":["Cachin"],"firstnames":["Christian"],"suffixes":[]},{"propositions":[],"lastnames":["Camenisch"],"firstnames":["Jan"],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-540-24676-3_1","interhash":"948899a0481df1b1e66fc9fce78792e0","intrahash":"011ed30761e599fbee66d6eea0be97a4","isbn":"3-540-21935-8","keywords":"dblp","pages":"1-19","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T18:58:30.000+0200","title":"Efficient Private Matching and Set Intersection.","url":"http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2004.html#FreedmanNP04","volume":"3027","year":"2004","bibtex":"@inproceedings{conf/eurocrypt/FreedmanNP04,\n added-at = {2017-05-24T00:00:00.000+0200},\n author = {Freedman, Michael J. and Nissim, Kobbi and Pinkas, Benny},\n biburl = {https://www.bibsonomy.org/bibtex/2011ed30761e599fbee66d6eea0be97a4/dblp},\n booktitle = {EUROCRYPT},\n crossref = {conf/eurocrypt/2004},\n editor = {Cachin, Christian and Camenisch, Jan},\n ee = {https://doi.org/10.1007/978-3-540-24676-3_1},\n interhash = {948899a0481df1b1e66fc9fce78792e0},\n intrahash = {011ed30761e599fbee66d6eea0be97a4},\n isbn = {3-540-21935-8},\n keywords = {dblp},\n pages = {1-19},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T18:58:30.000+0200},\n title = {Efficient Private Matching and Set Intersection.},\n url = {http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2004.html#FreedmanNP04},\n volume = 3027,\n year = 2004\n}\n\n","author_short":["Freedman, M. J.","Nissim, K.","Pinkas, B."],"editor_short":["Cachin, C.","Camenisch, J."],"key":"conf/eurocrypt/FreedmanNP04","id":"conf/eurocrypt/FreedmanNP04","bibbaseid":"freedman-nissim-pinkas-efficientprivatematchingandsetintersection-2004","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-540-24676-3_1","Paper":"http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2004.html#FreedmanNP04"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/benny pinkas?items=1000","creationDate":"2019-08-20T14:01:14.166Z","downloads":0,"keywords":["dblp"],"search_terms":["efficient","private","matching","set","intersection","freedman","nissim","pinkas"],"title":"Efficient Private Matching and Set Intersection.","year":2004,"dataSources":["cqD7CZfhPQfyEKZAn"]}