{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:16:09Z","timestamp":1725596169620},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222627"},{"type":"electronic","value":"9783642222634"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22263-4_15","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:34:45Z","timestamp":1310996085000},"page":"264-284","source":"Crossref","is-referenced-by-count":7,"title":["Broker-Based Private Matching"],"prefix":"10.1007","author":[{"given":"Abdullatif","family":"Shikfa","sequence":"first","affiliation":[]},{"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[]},{"given":"Refik","family":"Molva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/872757.872771","volume-title":"SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 86\u201397. ACM, New York (2003)"},{"key":"15_CR2","unstructured":"Ajmani, S., Morris, R., Liskov, B.: A trusted third-party computation service. Tech. Rep. MIT-LCS-TR-847, MIT, May 2001), \n                  \n                    http:\/\/www.pmg.csail.mit.edu\/ajmani\/papers\/tep.pdf"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-Nothing Disclosure of Secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"key":"15_CR5","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics, 636\u2013646 (2002)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-00468-1_12","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Rial, A., Sheedy, C.: Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 196\u2013214. Springer, Heidelberg (2009)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-540-72540-4_33","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J.L. Camenisch","year":"2007","unstructured":"Camenisch, J.L., Neven, G., Shelat, A.: Simulatable Adaptive Oblivious Transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 573\u2013590. Springer, Heidelberg (2007)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03549-4_7","volume-title":"Financial Cryptography and Data Security","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Zaverucha, G.M.: Private intersection of certified sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 108\u2013127. Springer, Heidelberg (2009)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Cristofaro, E.\u00a0D., and Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Financial Cryptography 2010, pp. 143\u2013159 (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-01957-9_8","volume-title":"Applied Cryptography and Network Security","author":"D. Dachman-Soled","year":"2009","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient Robust Private Set Intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 125\u2013142. Springer, Heidelberg (2009)"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Transactions on Networking\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-76900-2_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"M. Green","year":"2007","unstructured":"Green, M., Hohenberger, S.: Blind Identity-Based Encryption and Simulatable Oblivious Transfer. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 265\u2013282. Springer, Heidelberg (2007)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/336992.337012","volume-title":"EC 1999: Proceedings of the 1st ACM Conference on Electronic Commerce","author":"B.A. Huberman","year":"1999","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: EC 1999: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 78\u201386. ACM, New York (1999)"},{"key":"15_CR15","first-page":"98","volume-title":"Proceedings of the International Conference on Cryptography: Policy and Algorithms","author":"N. Jefferies","year":"1995","unstructured":"Jefferies, N., Mitchell, C.J., Walker, M.: A proposed architecture for trusted third party services. In: Proceedings of the International Conference on Cryptography: Policy and Algorithms, pp. 98\u2013104. Springer-Verlag, Heidelberg (1995)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"15_CR17","unstructured":"Li, Y., Tygar, D., Hellerstein, J.M.: Private matching. Tech. Rep. IRB-TR-04-005, Intel Research Laboratory Berkeley (2004), \n                  \n                    http:\/\/www.eecs.berkeley.edu\/~tygar\/papers\/Private_matching.pdf"},{"key":"15_CR18","unstructured":"Lynn, B. The pairing-based cryptography library (2006), \n                  \n                    http:\/\/crypto.stanford.edu\/pbc\/"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: STOC 1991: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 80\u201389 (1991)","DOI":"10.1145\/103418.103434"},{"key":"15_CR20","first-page":"356","volume":"20","author":"W. Ogata","year":"2004","unstructured":"Ogata, W., Kurosawa, K.: Oblivious keyword search. Journal of Complexity - Special Issue on Coding and Cryptography\u00a020, 356\u2013371 (2004)","journal-title":"Journal of Complexity - Special Issue on Coding and Cryptography"},{"key":"15_CR21","unstructured":"Rabin, M.O. How to exchange secrets with oblivious transfer, Harvard University Technical Report (1981)"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22263-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:07:37Z","timestamp":1558296457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22263-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222627","9783642222634"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22263-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}