{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:44:09Z","timestamp":1725727449654},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386305"},{"type":"electronic","value":"9783642386312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38631-2_36","type":"book-chapter","created":{"date-parts":[[2013,5,27]],"date-time":"2013-05-27T04:37:49Z","timestamp":1369629469000},"page":"493-506","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Multi-party Reconciliation Using Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Florian","family":"Weingarten","sequence":"first","affiliation":[]},{"given":"Georg","family":"Neugebauer","sequence":"additional","affiliation":[]},{"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","first-page":"160","volume-title":"Proceedings of the 23rd SFCS","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd SFCS, pp. 160\u2013164. IEEE Computer Society, Washington, DC (1982)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Meyer, U., Wetzel, S., Ioannidis, S.: Distributed privacy-preserving policy reconciliation. In: ICC, pp. 1342\u20131349 (2007)","DOI":"10.1109\/ICC.2007.226"},{"key":"36_CR3","unstructured":"Meyer, U., Wetzel, S., Ioannidis, S.: New Advances on Privacy-Preserving Policy Reconciliation. In: IACR eprint 2010\/64, http:\/\/eprint.iacr.org\/2010\/064"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Mayer, D.A., Teubert, D., Wetzel, S., Meyer, U.: Implementation and Performance Evaluation of Privacy-Preserving Fair Reconciliation Protocols on Ordered Sets. In: First ACM CODASPY (2011)","DOI":"10.1145\/1943513.1943529"},{"key":"36_CR5","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":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-18178-8_12","volume-title":"Information Security","author":"G. Neugebauer","year":"2011","unstructured":"Neugebauer, G., Meyer, U., Wetzel, S.: Fair and Privacy-Preserving Multi-party Protocols for Reconciling Ordered Input Sets. In: Burmester, M., Tsudik, G., Magliveras, S., Ili\u0107, I. (eds.) ISC 2010. LNCS, vol.\u00a06531, pp. 136\u2013151. Springer, Heidelberg (2011)"},{"key":"36_CR7","unstructured":"Neugebauer, G., Meyer, U., Wetzel, S.: Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets, Extended Version (2011), http:\/\/eprint.iacr.org\/2011\/200"},{"key":"36_CR8","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.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"36_CR9","unstructured":"Cheon, J.H., Jarecki, S., Seo, J.H.: Multi-party privacy-preserving set intersection with quasi-linear complexity. Cryptology ePrint Archive, Report 2010\/512 (2010)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-72738-5_15","volume-title":"Applied Cryptography and Network Security","author":"R. Li","year":"2007","unstructured":"Li, R., Wu, C.: An unconditionally secure protocol for multi-party set intersection. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 226\u2013236. Springer, Heidelberg (2007)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-10433-6_2","volume-title":"Cryptology and Network Security","author":"G. Sathya Narayanan","year":"2009","unstructured":"Sathya Narayanan, G., Aishwarya, T., Agrawal, A., Patra, A., Choudhary, A., Pandu Rangan, C.: Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 21\u201340. Springer, Heidelberg (2009)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-05445-7_5","volume-title":"Selected areas in cryptography","author":"A. Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Selected areas in cryptography, pp. 71\u201391. Springer, Heidelberg (2009)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-72738-5_16","volume-title":"Applied Cryptography and Network Security","author":"K. Frikken","year":"2007","unstructured":"Frikken, K.: Privacy-Preserving Set Union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 237\u2013252. Springer, Heidelberg (2007)"},{"key":"36_CR14","unstructured":"Hong, J., Kim, J.W., Kim, J., Park, K., Cheon, J.H.: Constant-round privacy preserving multiset union. IACR Cryptology ePrint Archive, 138 (2011)"},{"key":"36_CR15","volume-title":"34th IEEE Sarnoff Symposium","author":"D. Mayer","year":"2011","unstructured":"Mayer, D., Neugebauer, G., Meyer, U., Wetzel, S.: Enabling fair and privacy-preserving applications using reconciliation protocols on ordered sets. In: 34th IEEE Sarnoff Symposium. IEEE, Princeton (2011)"},{"key":"36_CR16","first-page":"169","volume-title":"Proceedings of the 41st STOC","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully Homomorphic Encryption using Ideal Lattices. In: Proceedings of the 41st STOC, pp. 169\u2013178. ACM, New York (2009)"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"36_CR18","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S.M., Wigderson, A.: How to play ANY mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"36_CR19","first-page":"365","volume-title":"Proceedings of the 14th STOC","author":"S. Goldwasser","year":"1982","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of the 14th STOC, pp. 365\u2013377. ACM Press, New York (1982)"},{"key":"36_CR20","volume-title":"The complexity of Boolean functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The complexity of Boolean functions. John Wiley & Sons, Inc., New York (1987)"},{"key":"36_CR21","unstructured":"Weingarten, F.: Evaluating the Use of Fully Homomorphic Encryption in Secure Multi-Party Computation. Diploma Thesis, Research Group IT-Security, RWTH Aachen University (2011)"},{"key":"36_CR22","unstructured":"Myers, S., Sergi, M., Shelat, A.: Threshold fully homomorphic encryption and secure computation, vol. 2011 (2011)"},{"key":"36_CR23","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University, Stanford, CA, USA, AAI3382729 (2009)"},{"key":"36_CR24","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)"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38631-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T23:08:20Z","timestamp":1688252900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38631-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386305","9783642386312"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38631-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}