{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:16:24Z","timestamp":1743653784816,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315398"},{"type":"electronic","value":"9783642315404"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31540-4_13","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T13:18:03Z","timestamp":1340630283000},"page":"161-176","source":"Crossref","is-referenced-by-count":7,"title":["Privacy-Preserving Subgraph Discovery"],"prefix":"10.1007","author":[{"given":"Danish","family":"Mehmood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Basit","family":"Shafiq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nabil","family":"Adam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijayalakshmi","family":"Atluri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","first-page":"487","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, September 12-15, pp. 487\u2013499. VLDB, Santiago (1994), http:\/\/www.vldb.org\/dblp\/db\/conf\/vldb\/vldb94-487.html"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/342009.335438","volume-title":"Proceedings of the 2000 ACM SIGMOD Conference on Management of Data","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, May 14-19, pp. 439\u2013450. ACM, Dallas (2000), http:\/\/doi.acm.org\/10.1145\/342009.335438"},{"key":"13_CR3","unstructured":"Chittimoori, R.N., Holder, L.B., Cook, D.J.: Applying the subdue substructure discovery system to the chemical toxicity domain. In: Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, pp. 90\u201394. AAAI Press (1999), http:\/\/dl.acm.org\/citation.cfm?id=646812.707494"},{"key":"13_CR4","first-page":"1","volume-title":"IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining","author":"W. Du","year":"2002","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Clifton, C., Estivill-Castro, V. (eds.) IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, December 9, vol.\u00a014, pp. 1\u20138. Australian Computer Society, Maebashi City (2002), http:\/\/crpit.com\/Vol14.html"},{"key":"13_CR5","first-page":"218","volume-title":"Proceedings of the 19th ACM Symposium on the Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing, pp. 218\u2013229. ACM, New York (1987), http:\/\/doi.acm.org\/10.1145\/28395.28420"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1109\/TKDE.2006.173","volume":"18","author":"E. Gudes","year":"2006","unstructured":"Gudes, E., Shimony, S.E., Vanetik, N.: Discovering frequent graph patterns using disjoint paths. IEEE Trans. on Knowl. and Data Eng.\u00a018, 1441\u20131456 (2006), http:\/\/dx.doi.org\/10.1109\/TKDE.2006.173","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn.\u00a050, 321\u2013354 (2003), http:\/\/dl.acm.org\/citation.cfm?id=608108.608123","journal-title":"Mach. Learn."},{"key":"13_CR8","first-page":"593","volume-title":"Proceedings of the 2005 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"G. Jagannathan","year":"2005","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the 2005 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 21-24, pp. 593\u2013599. ACM, Chicago (2005)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1198\/106186005X47714","volume":"14","author":"A.F. Karr","year":"2005","unstructured":"Karr, A.F., Lin, X., Sanil, A.P., Reiter, J.P.: Secure regressions on distributed databases. Journal of Computational and Graphical Statistics\u00a014, 263\u2013279 (2005)","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) ICDM, pp. 313\u2013320. IEEE Computer Society (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"13_CR12","unstructured":"Mukherjee, M.: Graph-based data mining for social network analysis. In: Proceedings of the ACM KDD Workshop on Link Analysis and Group Detection (2004)"},{"key":"13_CR13","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 - EUROCRYPT \u201999","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.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a0IT-24, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1142\/S0218213004001405","volume":"13","author":"A. Rakhshan","year":"2004","unstructured":"Rakhshan, A., Holder, L.B., Cook, D.J.: Structural web search engine. International Journal on Artificial Intelligence Tools\u00a013(1), 27\u201344 (2004)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1145\/1014052.1014139","volume-title":"KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A.P. Sanil","year":"2004","unstructured":"Sanil, A.P., Karr, A.F., Lin, X., Reiter, J.P.: Privacy preserving regression modelling via distributed computation. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 677\u2013682. ACM Press, New York (2004)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Su, S., Cook, D.J., Holder, L.B.: Application of knowledge discovery to molecular biology: Identifying structural regularities in proteins. In: Pacific Symposium on Biocomputing, pp. 190\u2013201 (1999)","DOI":"10.1142\/9789814447300_0019"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/956750.956776","volume-title":"The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2003","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24-27, pp. 206\u2013215. ACM, Washington, DC (2003), http:\/\/doi.acm.org\/10.1145\/956750.956776"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1137\/1.9781611972740.59","volume-title":"2004 SIAM International Conference on Data Mining","author":"J. Vaidya","year":"2004","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving na\u00efve bayes classifier for vertically partitioned data. In: 2004 SIAM International Conference on Data Mining, April 22-24, pp. 522\u2013526. SIAM, Philadelphia (2004)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/ICDM.2004.10081","volume-title":"Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM 2004)","author":"J. Vaidya","year":"2004","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving outlier detection. In: Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM 2004), November 1-4, pp. 233\u2013240. IEEE Computer Society Press, Los Alamitos (2004)"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J. Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4), 593\u2013622 (2005)","journal-title":"Journal of Computer Security"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1409620.1409624","volume":"2","author":"J. Vaidya","year":"2008","unstructured":"Vaidya, J., Clifton, C., Kantarcioglu, M., Patterson, A.S.: Privacy-preserving decision trees over vertically partitioned data. ACM Trans. Knowl. Discov. Data\u00a02(3), 1\u201327 (2008)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"13_CR23","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, pp. 721\u2013724 (2002)"},{"key":"13_CR24","first-page":"162","volume-title":"Proceedings of the 27th IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Los Alamitos (1986)"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1014052.1014153","volume-title":"KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Y. Zhu","year":"2004","unstructured":"Zhu, Y., Liu, L.: Optimal randomization for privacy preserving data mining. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 761\u2013766. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXVI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31540-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T15:10:12Z","timestamp":1743606612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31540-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315398","9783642315404"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31540-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}