{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:24:06Z","timestamp":1725535446186},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035487"},{"type":"electronic","value":"9783642035494"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03549-4_3","type":"book-chapter","created":{"date-parts":[[2009,7,16]],"date-time":"2009-07-16T10:05:28Z","timestamp":1247738728000},"page":"32-50","source":"Crossref","is-referenced-by-count":5,"title":["Privacy-Preserving Information Markets for Computing Statistical Data"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"B\u00fclent","family":"Yener","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the k th-ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"3_CR2","first-page":"86","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 Press, New York (2003)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Akl, S.G., Taylor, P.D.: Cryptographic solution to a multilevel security problem. In: CRYPTO, pp. 237\u2013249 (1982)","DOI":"10.1007\/978-1-4757-0602-4_23"},{"key":"3_CR4","unstructured":"Antecol, M., Bermount, B.: Wired teens aren\u2019t naive about online privacy, forrester research, July 24 (2001)"},{"key":"3_CR5","first-page":"446","volume-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997)","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Commodity-based cryptography. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), May 1997, pp. 446\u2013455. Association for Computing Machinery, New York (1997)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Yung, M.: Distributing the power of a government to enhance the privacy of voters (extended abstract). In: PODC, pp. 52\u201362 (1986)","DOI":"10.1145\/10590.10595"},{"key":"3_CR7","first-page":"9","volume-title":"CCS 1993: Proceedings of the 1st ACM conference on Computer and communications security","author":"M. Blaze","year":"1993","unstructured":"Blaze, M.: A cryptographic file system for unix. In: CCS 1993: Proceedings of the 1st ACM conference on Computer and communications security, pp. 9\u201316. ACM Press, New York (1993)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/1150402.1150415","volume-title":"Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Brickell","year":"2006","unstructured":"Brickell, J., Shmatikov, V.: Efficient anonymity-preserving data collection. In: Eliassi-Rad, T., Ungar, L.H., Craven, M., Gunopulos, D. (eds.) Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, pp. 76\u201385. ACM, New York (2006)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 98\u2013115. Springer, Heidelberg (1999)"},{"key":"3_CR11","volume-title":"The privacy payoff","author":"A. Cavoukian","year":"2002","unstructured":"Cavoukian, A., Hamilton, T.: The privacy payoff. McGraw-Hill, New York (2002)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024, 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/0-387-34805-0_29","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"G.C. Chick","year":"1990","unstructured":"Chick, G.C., Tavares, S.E.: Flexible access control with master keys. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 316\u2013322. Springer, Heidelberg (1990)"},{"key":"3_CR14","first-page":"372","volume-title":"26th Annual Symposium on Foundations of Computer Science","author":"J.D. Cohen","year":"1985","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, October 21\u201323, pp. 372\u2013382. IEEE, Los Alamitos (1985)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/SFCS.1985.14","volume-title":"26th Annual Symposium on Foundations of Computer Science (FOCS 1985)","author":"P. Feldman","year":"1985","unstructured":"Feldman, P., Micali, S.: Byzantine agreement in constant expected time (and trusting no one). In: 26th Annual Symposium on Foundations of Computer Science (FOCS 1985), Los Angeles, Ca, USA, pp. 267\u2013276. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"3_CR19","first-page":"148","volume-title":"Proceedings of the 20th Annual ACM Symposium on the Theory of Computing","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Cole, R. (ed.) Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, pp. 148\u2013161. ACM Press, New York (1988)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: FOCS, pp. 384\u2013393 (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed rsa-key generation. In: STOC, pp. 663\u2013672 (1998)","DOI":"10.1145\/276698.276882"},{"key":"3_CR22","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":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"3_CR24","first-page":"724","volume-title":"Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1995","author":"Z. Galil","year":"1995","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS 1995, Milwaukee, WI, October 23-25, 1995, pp. 724\u2013733. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"3_CR25","first-page":"31","volume-title":"Proceedings of the 25th Annual ACM Symposium on the Theory of Computing","author":"J. Garay","year":"1993","unstructured":"Garay, J., Moses, Y.: Fully polynomial byzantine agreement in t\u2009+\u20091 rounds. In: Aggarwal, A. (ed.) Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, USA, pp. 31\u201341. ACM Press, New York (1993)"},{"key":"3_CR26","volume-title":"NDSS","author":"E.-J. Goh","year":"2003","unstructured":"Goh, E.-J., Shacham, H., Modadugu, N., Boneh, D.: Sirius: Securing remote untrusted storage. In: NDSS. The Internet Society, San Diego (2003)"},{"key":"3_CR27","first-page":"218","volume-title":"STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM, New York (1987)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Goldwasser, S.: Multi-party computations: Past and present. In: PODC, pp. 1\u20136 (1997)","DOI":"10.1145\/259380.259405"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Golle, P., McSherry, F., Mironov, I.: Data collection with self-enforcing privacy. ACM Trans. Inf. Syst. Secur.\u00a012(2) (2008)","DOI":"10.1145\/1455518.1477940"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"key":"3_CR31","unstructured":"Statistical Research Inc. How people use the internet 2001, study (June 2001)"},{"key":"3_CR32","volume-title":"SDM","author":"G. Jagannathan","year":"2006","unstructured":"Jagannathan, G., Pillaipakkamnatt, K., Wright, R.N.: A new privacy-preserving distributed k-clustering algorithm. In: Ghosh, J., Lambert, D., Skillicorn, D.B., Srivastava, J. (eds.) SDM. SIAM, Philadelphia (2006)"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M. Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng.\u00a016, 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-44987-6_6","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Myers, S., Ostrovsky, R.: Cryptographic counters and applications to electronic voting. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 78\u201392. Springer, Heidelberg (2001)"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11507840_13","volume-title":"Financial Cryptography and Data Security","author":"A. Kiayias","year":"2005","unstructured":"Kiayias, A., Mitrofanova, A.: Testing disjointness of private datasets. In: S. Patrick, A., Yung, M. (eds.) FC 2005, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/11767480_33","volume-title":"Applied Cryptography and Network Security","author":"A. Kiayias","year":"2006","unstructured":"Kiayias, A., Mitrofanova, A.: Syntax-driven private evaluation of quantified membership queries. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol.\u00a03989, pp. 470\u2013485. Springer, Heidelberg (2006)"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Kiayias","year":"2004","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 571\u2013589. Springer, Heidelberg (2004)"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","volume-title":"Public Key Cryptography","author":"A. Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Self-tallying elections and perfect ballot secrecy. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 141\u2013158. Springer, Heidelberg (2002)"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-45126-6_22","volume-title":"Financial Cryptography","author":"A. Kiayias","year":"2003","unstructured":"Kiayias, A., Yung, M.: Non-interactive zero-sharing with applications to private distributed decision making. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 303\u2013320. Springer, Heidelberg (2003)"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27809-2_9","volume-title":"Financial Cryptography","author":"A. Kiayias","year":"2004","unstructured":"Kiayias, A., Yung, M.: The vector-ballot e-voting approach. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 72\u201389. Springer, Heidelberg (2004)"},{"key":"3_CR42","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.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"3_CR44","unstructured":"Nunes, P.F., Kambil, A.: Internet privacy: A look under the covers, accenture institute for strategic change (July 2000), http:\/\/www.accenture.com"},{"key":"3_CR45","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/1029179.1029203","volume-title":"WPES 2004: Proceedings of the 2004 ACM workshop on Privacy in the electronic society","author":"C.M. O\u2019Keefe","year":"2004","unstructured":"O\u2019Keefe, C.M., Yung, M., Gu, L., Baxter, R.: Privacy-preserving data linkage protocols. In: WPES 2004: Proceedings of the 2004 ACM workshop on Privacy in the electronic society, pp. 94\u2013102. ACM Press, New York (2004)"},{"key":"3_CR46","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":"3_CR47","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/507711.507723","volume-title":"SACMAT 2002: Proceedings of the seventh ACM symposium on Access control models and technologies","author":"I. Ray","year":"2002","unstructured":"Ray, I., Ray, I., Narasimhamurthi, N.: A cryptographic solution to implement access control in a hierarchy and more. In: SACMAT 2002: Proceedings of the seventh ACM symposium on Access control models and technologies, pp. 65\u201373. ACM Press, New York (2002)"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-48658-5_37","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"K. Sako","year":"1994","unstructured":"Sako, K., Kilian, J.: Secure voting using partially compatible homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 411\u2013424. Springer, Heidelberg (1994)"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme: A practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"issue":"2","key":"3_CR50","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(88)90099-3","volume":"27","author":"R.S. Sandhu","year":"1988","unstructured":"Sandhu, R.S.: Cryptographic implementation of a tree hierarchy for access control. Inf. Process. Lett.\u00a027(2), 95\u201398 (1988)","journal-title":"Inf. Process. Lett."},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11) (1979)","DOI":"10.1145\/359168.359176"},{"key":"3_CR52","unstructured":"Szabo, N.: The idea of smart contracts (1997), http:\/\/szabo.best.vwh.net\/smart_contracts_idea.html"},{"key":"3_CR53","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD 2002: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 639\u2013644. ACM Press, New York (2002)"},{"issue":"9","key":"3_CR54","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/TKDE.2006.147","volume":"18","author":"Z. Yang","year":"2006","unstructured":"Yang, Z., Wright, R.N.: Privacy-preserving computation of bayesian networks on vertically partitioned data. IEEE Trans. Knowl. Data Eng.\u00a018(9), 1253\u20131264 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/1081870.1081909","volume-title":"KDD 2005: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining","author":"Z. Yang","year":"2005","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Anonymity-preserving data collection. In: KDD 2005: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 334\u2013343. ACM Press, New York (2005)"},{"key":"3_CR56","first-page":"139","volume-title":"PODS","author":"S. Zhong","year":"2005","unstructured":"Zhong, S., Yang, Z., Wright, R.N.: Privacy-enhancing -anonymization of customer data. In: Li, C. (ed.) PODS, pp. 139\u2013147. ACM, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03549-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T19:08:49Z","timestamp":1633720129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03549-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035487","9783642035494"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03549-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}