{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:27:40Z","timestamp":1742639260068},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319598697"},{"type":"electronic","value":"9783319598703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59870-3_13","type":"book-chapter","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:14:17Z","timestamp":1496096057000},"page":"235-248","source":"Crossref","is-referenced-by-count":8,"title":["Private Graph Intersection Protocol"],"prefix":"10.1007","author":[{"given":"Fucai","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Zifeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yuxi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Su","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., et al.: Graph structure in the web. Comput. Netw. 33(1), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The web as a graph: measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 1\u201317. Springer, Heidelberg (1999). doi:\n10.1007\/3-540-48686-0_1"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Botafogo, R.A., Shneiderman, B.: Identifying aggregates in hypertext structures. In: Proceedings of the third Annual ACM Conference on Hypertext, pp. 63\u201374. ACM (1991)","DOI":"10.1145\/122974.122981"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, B., Li, H., Liu, Y., et al.: Improving web search results using affinity graph. In: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 504\u2013511. ACM (2005)","DOI":"10.1145\/1076034.1076120"},{"key":"13_CR5","unstructured":"Page, L., Brin, S., Motwani, R., et al.: The PageRank citation ranking: Bringing order to the web. Stanford InfoLab (1999)"},{"key":"13_CR6","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., et al.: Bidirectional expansion for keyword search on graph databases. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 505\u2013516. VLDB Endowment (2005)"},{"issue":"11","key":"13_CR7","doi-asserted-by":"crossref","first-page":"4649","DOI":"10.1109\/TIP.2012.2207397","volume":"21","author":"M Wang","year":"2012","unstructured":"Wang, M., Li, H., Tao, D., et al.: Multimodal graph-based reranking for web image search. IEEE Trans. Image Process. 21(11), 4649\u20134661 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"11","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1016\/S1389-1286(99)00052-3","volume":"31","author":"S Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., Van den Berg, M., Dom, B.: Focused crawling: a new approach to topic-specific web resource discovery. Comput. Netw. 31(11), 1623\u20131640 (1999)","journal-title":"Comput. Netw."},{"issue":"14","key":"13_CR9","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1002\/asi.20078","volume":"55","author":"V Cothey","year":"2004","unstructured":"Cothey, V.: Web-crawling reliability. J. Am. Soc. Inform. Sci. Technol. 55(14), 1228\u20131238 (2004)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Pant, G., Srinivasan, P., Menczer, F.: Crawling the web. In: Web Dynamics, pp. 153\u2013177. Springer, Berlin Heidelberg (2004)","DOI":"10.1007\/978-3-662-10874-1_7"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 95\u2013106. ACM (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BFb0026695","volume-title":"Machine Learning: ECML-98","author":"M Craven","year":"1998","unstructured":"Craven, M., Slattery, S., Nigam, K.: First-order learning for web mining. In: N\u00e9dellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 250\u2013255. Springer, Heidelberg (1998). doi:\n10.1007\/BFb0026695"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Sharma, K., Shrivastava, G., Kumar, V.: Web mining: today and tomorrow. In: 2011 3rd International Conference on Electronics Computer Technology (ICECT), vol. 1, pp. 399\u2013403. IEEE (2011)","DOI":"10.1109\/ICECTECH.2011.5941631"},{"key":"13_CR14","unstructured":"Pamnani, R., Web, C.P., Mining, U.: A research area in web mining. In: Proceedings of ISCET, pp. 73\u201377 (2010)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Cha, M., Mislove, A., Gummadi, K.P.: A measurement-driven analysis of information propagation in the flickr social network. In: Proceedings of the 18th International Conference on World Wide Web, pp. 721\u2013730. ACM (2009)","DOI":"10.1145\/1526709.1526806"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Myers, S.A., Sharma, A., Gupta, P., et al.: Information network or social network?: the structure of the twitter follow graph. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 493\u2013498. ACM (2014)","DOI":"10.1145\/2567948.2576939"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-41190-8_44","volume-title":"New Trends in Image Analysis and Processing \u2013 ICIAP 2013","author":"V Carletti","year":"2013","unstructured":"Carletti, V., Foggia, P., Vento, M.: Performance comparison of five exact graph matching algorithms on biological databases. In: Petrosino, A., Maddalena, L., Pala, P. (eds.) ICIAP 2013. LNCS, vol. 8158, pp. 409\u2013417. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-41190-8_44"},{"issue":"1","key":"13_CR18","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1186\/1756-0381-4-10","volume":"4","author":"GA Pavlopoulos","year":"2011","unstructured":"Pavlopoulos, G.A., Secrier, M., Moschopoulos, C.N., et al.: Using graph theory to analyze biological networks. Biodata Mining 4(1), 10 (2011)","journal-title":"Biodata Mining"},{"issue":"2","key":"13_CR19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian, Y., Mceachin, R.C., Santos, C., et al.: SAGA: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"issue":"4","key":"13_CR20","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., et al.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"13_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. (CSUR) 40(1), 1 (2008)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"13_CR23","unstructured":"Kyrola, A., Blelloch, G.E., GraphChi, G.C.: Large-scale graph computation on just a PC. In: OSDI, vol. 12, pp. 31\u201346 (2012)"},{"key":"13_CR24","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of 2000 IEEE Symposium on Security and Privacy, S&P 2000, pp. 44\u201355. IEEE (2000)"},{"issue":"5","key":"13_CR25","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., Kamara, S., et al.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-40041-4_20"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-15546-8_7","volume-title":"Secure Data Management","author":"P Liesdonk","year":"2010","unstructured":"Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally efficient searchable symmetric encryption. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 87\u2013100. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-15546-8_7"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-17373-8_33"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., et al.: GRECS: graph encryption for approximate shortest distance queries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 504\u2013517. ACM (2015)","DOI":"10.1145\/2810103.2813672"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). doi:\n10.1007\/3-540-48910-X_16"},{"key":"13_CR32","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":"MJ 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. 3027, pp. 1\u201319. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24676-3_1"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005). doi:\n10.1007\/11535218_15"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E Cristofaro","year":"2010","unstructured":"Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14577-3_13"},{"key":"13_CR35","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. 5536, pp. 125\u2013142. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-01957-9_8"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59870-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:19:19Z","timestamp":1496096359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59870-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598697","9783319598703"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59870-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}