{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:55:56Z","timestamp":1773413756422,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Med Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10916-016-0657-4","type":"journal-article","created":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T11:17:37Z","timestamp":1484565457000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Privacy-Preserving Integration of Medical Data"],"prefix":"10.1007","volume":"41","author":[{"given":"Atsuko","family":"Miyaji","sequence":"first","affiliation":[]},{"given":"Kazuhisa","family":"Nakasho","sequence":"additional","affiliation":[]},{"given":"Shohei","family":"Nishida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"issue":"1","key":"657_CR1","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Azar, Y., Broder, A. Z., Karlin, A. R., Upfal, E, Balanced allocations. SIAM J. Comput. 29(1): 180\u2013200, 1999.","journal-title":"SIAM J. Comput."},{"key":"657_CR2","doi-asserted-by":"crossref","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Nist special publication 800-57: Recommendation for key management \u2013 part 1: General(revision 3). Technical report, National Institute of Standards and Technology (NIST) (2012)","DOI":"10.6028\/NIST.SP.800-57p1r3"},{"issue":"7","key":"657_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B. H., Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7):422\u2013426, 1970.","journal-title":"Commun. ACM"},{"issue":"4","key":"657_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., and Mitzenmacher, M., Network applications of bloom filters: A survey. Internet Math. 1(4): 485\u2013 509, 2004.","journal-title":"Internet Math."},{"issue":"5","key":"657_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B., A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5):481\u2013490, 1997.","journal-title":"Eur. Trans. Telecommun."},{"key":"657_CR6","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: ASIACRYPT 2010, volume 6477 of LNCS, pages 213\u2013231. Springer (2010)","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"657_CR7","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., and Tsudik, G.: Practical private set intersection protocols with linear complexity. In: FC 2010, volume 6052 of LNCS, pages 143\u2013159. Springer (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"657_CR8","doi-asserted-by":"crossref","unstructured":"Dang, Q., Nist special publication 800-107: Recommendation for applications using approved hash algorithms(revision 1). Technical report, National Institute of Standards and Technology (NIST), 2012.","DOI":"10.6028\/NIST.SP.800-107r1"},{"key":"657_CR9","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., and Frankel, Y.: Threshold cryptosystems. In: CRYPTO 1989, volume 1462 of LNCS, pages 307\u2013315. Springer (1989)","DOI":"10.1007\/0-387-34805-0_28"},{"key":"657_CR10","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: An efficient and scalable protocol. In: ACMCCS 2013, pages 789\u2013800. ACM (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"657_CR11","doi-asserted-by":"crossref","unstructured":"Egert, R., Fischlin, M., Gens, D., Jacob, S., Senker, M., Tillmanns, J.: Privately computing set-union and set-intersection cardinality via bloom filters. In: ACISP 2015, volume 9144 of LNCS, pages 413\u2013430. Springer (2015)","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"657_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, M. J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: EUROCRYPT 2004, volume 3027 of LNCS, pages 1\u201319. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"657_CR13","unstructured":"Goldreich, O., Secure multi-party computation. Manuscript. Preliminary version, 1998."},{"issue":"2","key":"657_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., and Micali, S., Probabilistic encryption. J. Comput. Syst. Sci. 28(2):270\u2013299, 1984.","journal-title":"J. Comput. Syst. Sci."},{"key":"657_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: CRYPTO 2003, volume 2729 of LNCS, pages 145\u2013161. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"657_CR16","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: ACMCCS 2012, pages 85\u201386. ACM (2012)","DOI":"10.1145\/2414456.2414506"},{"key":"657_CR17","doi-asserted-by":"crossref","unstructured":"Kissner, L., and Song, D.: Privacy-preserving set operations. In: CRYPTO 2005, volume 3621 of LNCS, pages 241\u2013257. Springer (2005)","DOI":"10.1007\/11535218_15"},{"key":"657_CR18","unstructured":"Many, D., Burkhart, M., Dimitropoulos, X., Fast private set operations with sepia. Tech. Rep.,345, 2012."},{"key":"657_CR19","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: EUROCRYPT 1999, volume 1592 of LNCS, pages 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"657_CR20","unstructured":"Rabin, M. O., How to exchange secrets with oblivious transfer. Tech. Memo, TR-81, 1981."},{"issue":"1","key":"657_CR21","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/1609956.1609965","volume":"13","author":"Y Sang","year":"2009","unstructured":"Sang, Y., and Shen, H., Efficient and secure protocols for privacy-preserving set operations. ACM Trans. Inf. Syst. Secur. 13(1):9:1\u20139:35, 2009.","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Journal of Medical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10916-016-0657-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T20:47:54Z","timestamp":1658436474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10916-016-0657-4"}},"subtitle":["A Practical Multiparty Private Set Intersection"],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s10916-016-0657-4","relation":{},"ISSN":["0148-5598","1573-689X"],"issn-type":[{"value":"0148-5598","type":"print"},{"value":"1573-689X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,16]]},"article-number":"37"}}