{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:33:39Z","timestamp":1743125619378,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811536533"},{"type":"electronic","value":"9789811536540"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this chapter, we describe two security primitives for big data utilization. One is a privacy-preserving data integration among databases distributed in different organizations. This primitive integrates the same data among databases kept in different organizations while keeping any different data in an organization secret to other organizations. Another is a privacy-preserving classification. This primitive executes a procedure for server\u2019s classification rule to client\u2019s input database and outputs only the result to the client while keeping the client\u2019s input database secret to the server and server\u2019s classification rule to the client. These primitives can be executed not only independently but also jointly. That is, after we integrate databases from distributed organization by executing the privacy-preserving data integration, we can execute a privacy-preserving classification.<\/jats:p>","DOI":"10.1007\/978-981-15-3654-0_3","type":"book-chapter","created":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T12:02:40Z","timestamp":1587643360000},"page":"35-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Primitive for Big Data Utilization"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Kawachi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Nakasho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiying","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuuki","family":"Takano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"L. Kissner, D. Song, Privacy-preserving set operations, in CRYPTO 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 241\u2013257","DOI":"10.1007\/11535218_15"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1609956.1609965","volume":"13","author":"Y Sang","year":"2009","unstructured":"Y. Sang, H. Shen, 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."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"R. Egert, M. Fischlin, D. Gens, S. Jacob, M. Senker, J. Tillmanns, Privately computing set-union and set-intersection cardinality via bloom filters, in ACISP 2015. LNCS, vol. 9144 (Springer, Berlin, 2015), pp. 413\u2013430","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"3_CR4","unstructured":"D.\u00a0Many, M.\u00a0Burkhart, X.\u00a0Dimitropoulos, Fast private set operations with sepia. Technical Report, 345 (2012)"},{"key":"3_CR5","unstructured":"O. Goldreich, Secure multi-party computation. Manuscript, Preliminary version (1998)"},{"issue":"7","key":"3_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"B.H. Bloom, Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"A. Broder, M. Mitzenmacher, Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"P.\u00a0Paillier, Public-key cryptosystems based on composite degree residuosity classes, in EUROCRYPT 1999. LNCS, vol. 1592 (Springer, Berlin, 1999), pp. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, B. Schoenmakers, A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481\u2013490 (1997)","journal-title":"Eur. Trans. Telecommun."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, Y. Frankel, Threshold cryptosystems, in CRYPTO 1989. LNCS, vol. 1462 (Springer, Berlin, 1989), pp. 307\u2013315","DOI":"10.1007\/0-387-34805-0_28"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"M.J. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set intersection, in EUROCRYPT 2004. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 1\u201319","DOI":"10.1007\/978-3-540-24676-3_1"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1999","unstructured":"Y. Azar, A.Z. Broder, A.R. Karlin, E. Upfal, Balanced allocations. SIAM J. Comput. 29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"E.\u00a0De Cristofaro, G.\u00a0Tsudik, Practical private set intersection protocols with linear complexity, in FC 2010. LNCS, vol. 6052 (Springer, Berlin, 2010), pp. 143\u2013159","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"E. De Cristofaro, J. Kim, G. Tsudik, Linear-complexity private set intersection protocols secure in malicious model, in ASIACRYPT 2010. LNCS, vol. 6477 (Springer, Berlin, 2010), pp. 213\u2013231","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"F. Kerschbaum, Outsourced private set intersection using homomorphic encryption, in ACMCCS 2012 (ACM, 2012), pp. 85\u201386","DOI":"10.1145\/2414456.2414506"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfers efficiently, in CRYPTO 2003. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"3_CR18","unstructured":"M.O. Rabin, How to exchange secrets with oblivious transfer. Technical Memo, TR-81 (1981)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"C. Dong, L. Chen, Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in ACMCCS 2013 (ACM, 2013), pp. 789\u2013800","DOI":"10.1145\/2508859.2516701"},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar","year":"2018","unstructured":"C. Aguilar, O. Blazy, J.-C. Deneuville, P. Gaborit, G. Z\u00e9mor, Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927\u20133943 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR21","unstructured":"National\u00a0Institute of\u00a0Standards and Technology. Post-quantum cryptography, round 2 submissions (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"3_CR22","unstructured":"A.C.-C. Yao, How to generate and exchange secrets, in Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (1986), pp. 162\u2013167"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"D.J. Wu, T. Feng, M. Naehrig, K. Lauter, Privately evaluating decision trees and random forests, in Proceeding on Privacy Enhancing Technologies, vol. 4 (2016), pp. 1\u201321","DOI":"10.1515\/popets-2016-0043"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"I. Dangaard, M. Fitzi, E. Kiltz, J.B. Nielsen, T. Toft, Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, in TCC2006: Theory of Cryptography (2006), pp. 285\u2013304","DOI":"10.1007\/11681878_15"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgaard, J.B. Nielsen, Multiparty computation from threshold encryption, in Eurocrypt (2001), pp. 280\u2013299","DOI":"10.1007\/3-540-44987-6_18"}],"container-title":["Security Infrastructure Technology for Integrated Utilization of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3654-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T12:37:41Z","timestamp":1721738261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-3654-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811536533","9789811536540"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3654-0_3","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}