{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:19:03Z","timestamp":1725758343625},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642420009"},{"type":"electronic","value":"9783642420016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42001-6_14","type":"book-chapter","created":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T23:25:02Z","timestamp":1384989902000},"page":"183-210","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Reconciliation Protocols: From Theory to Practice"],"prefix":"10.1007","author":[{"given":"Ulrike","family":"Meyer","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: A System for Secure Multi-Party Computation. In: Conference on Computer and Communications Security (CCS). ACM (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aguiar, E.: Private and Oblivious Set and Multiset Operations. In: Symposium on Information, Computer and Communications Security (ASIACCS). ACM (2012)","DOI":"10.1145\/2414456.2414479"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D. Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"key":"14_CR4","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics. In: USENIX Security Symposium. USENIX (2010)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03549-4_7","volume-title":"Financial Cryptography and Data Security","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Zaverucha, G.M.: Private Intersection of Certified Sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 108\u2013127. Springer, Heidelberg (2009)"},{"key":"14_CR6","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.\u00a05536, pp. 125\u2013142. Springer, Heidelberg (2009)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-30921-2_4","volume-title":"Trust and Trustworthy Computing","author":"E. De Cristofaro","year":"2012","unstructured":"De Cristofaro, E., Tsudik, G.: Experimenting with Fast Private Set Intersection. In: Katzenbeisser, S., Weippl, E., Camp, L.J., Volkamer, M., Reiter, M., Zhang, X. (eds.) Trust 2012. LNCS, vol.\u00a07344, pp. 55\u201373. Springer, Heidelberg (2012)"},{"key":"14_CR8","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 De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical Private Set Intersection Protocols with Linear Complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"14_CR9","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":"14_CR10","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.B. Frikken","year":"2007","unstructured":"Frikken, K.B.: Privacy-Preserving Set Union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 237\u2013252. Springer, Heidelberg (2007)"},{"key":"14_CR11","unstructured":"Geisler, M.: Cryptographic Protocols: Theory and Implementation. PhD Thesis, Aarhus University (2010)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a01. Press Syndicate of the University of Cambridge (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"14_CR13","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption & How to Play Mental Poker Keeping Secret all Partial Information. In: Symposium on Theory of Computing (STOC). ACM (1984)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-13013-7_19","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Nissim, K.: Efficient Set Operations in the Presence of Malicious Adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 312\u2013331. Springer, Heidelberg (2010)"},{"key":"14_CR15","unstructured":"Huang, Y., Evans, D., Katz, J.: Private Set Intersection: Are Garbled Circuits Better than Custom Protocols. In: Network and Distributed System Security Symposium (NDSS). Internet Societey (2012)"},{"key":"14_CR16","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":"14_CR17","unstructured":"Mayer, D.: Design and Implementation of Efficient Privacy-Preserving and Unbiased Reconciliation Protocols. PhD Thesis, Stevens Institute of Technology (2012)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Mayer, D., Neugebauer, G., Meyer, U., Wetzel, S.: Enabling Fair and Privacy-Preserving Applications Using Reconciliation Protocols on Ordered Sets. In: Sarnoff Symposium. IEEE (2011)","DOI":"10.1109\/SARNOF.2011.5876461"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-34691-0_6","volume-title":"Testing Software and Systems","author":"D.A. Mayer","year":"2012","unstructured":"Mayer, D.A., Steele, O., Wetzel, S., Meyer, U.: CaPTIF: Comprehensive Performance TestIng Framework. In: Nielsen, B., Weise, C. (eds.) ICTSS 2012. LNCS, vol.\u00a07641, pp. 55\u201370. Springer, Heidelberg (2012)"},{"key":"14_CR20","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: Conference on Data and Application Security and Privacy (CODASPY). ACM (2011)","DOI":"10.1145\/1943513.1943529"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Mayer, D.A., Wetzel, S.: Verifiable Private Equality Test: Enabling Unbiased 2-Party Reconciliation on Ordered Sets in the Malicious Model. In: Symposium on Information, Computer and Communications Security (ASIACCS). ACM (2012)","DOI":"10.1145\/2414456.2414482"},{"key":"14_CR22","unstructured":"Meyer, U.: Secure Roaming and Handover Procedures in Wireless Access Networks. PhD Thesis, Darmstadt University of Technology (2005)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Meyer, U., Wetzel, S., Ioannidis, S.: Distributed Privacy-Preserving Policy Reconciliation. In: International Conference on Communications (ICC). IEEE (2007)","DOI":"10.1109\/ICC.2007.226"},{"key":"14_CR24","unstructured":"Meyer, U., Wetzel, S., Ioannidis, S.: New Advances on Privacy-preserving Policy Reconciliation. Cryptology ePrint Archive, 2010\/064 (2010)"},{"key":"14_CR25","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.S. Narayanan","year":"2009","unstructured":"Narayanan, G.S., Aishwarya, T., Agrawal, A., Patra, A., Choudhary, A., Rangan, C.P.: 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":"14_CR26","doi-asserted-by":"crossref","unstructured":"Neugebauer, G., Brutschy, L., Meyer, U., Wetzel, S.: Design and Implementation of Privacy-Preserving Reconciliation Protocols. In: International Workshop on Privacy and Anonymity in the Information Society (PAIS). ACM (2013)","DOI":"10.1145\/2457317.2457339"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Neugebauer, G., Brutschy, L., Meyer, U., Wetzel, S.: Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model. In: International Workshop on Data Privacy Management (DPM). ACM (2013)","DOI":"10.1007\/978-3-642-54568-9_12"},{"key":"14_CR28","unstructured":"Neugebauer, G., Meyer, U.: SMC-MuSe: A Framework for Secure Multi-Party Computation on MultiSets, RWTH Aachen University Technical Report AIB-2012-16 (2012)"},{"key":"14_CR29","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":"14_CR30","unstructured":"Neugebauer, G., Meyer, U., Wetzel, S.: Fair and Privacy-Preserving Multi-Party Protocols for Reconciling Ordered Input Sets (Extended Version) (2011), \n                    \n                      http:\/\/eprint.iacr.org\/2011\/200"},{"key":"14_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 - 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":"14_CR32","unstructured":"PreFairAppl\u2014Private and Fair Applications (2013), \n                    \n                      http:\/\/www.prefairappl.info"},{"key":"14_CR33","unstructured":"Sang, Y., Shen, H.: Privacy Preserving Set Intersection Based on Bilinear Groups. In: Proc. of the Thirty-First AACCS. Australian Computer Science Conference (ACSC), vol.\u00a074, Australian Computer Society, Inc. (2008)"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-642-38631-2_36","volume-title":"Network and System Security","author":"F. Weingarten","year":"2013","unstructured":"Weingarten, F., Neugebauer, G., Meyer, U., Wetzel, S.: Privacy-Preserving Multi-Party Reconciliation using Fully Homomorphic Encryption. In: Lopez, J., Huang, X., Sandhu, R. (eds.) NSS 2013. LNCS, vol.\u00a07873, pp. 493\u2013506. Springer, Heidelberg (2013)"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for Secure Computations. In: Symposium on Foundations of Computer Science (SFCS). IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","\u2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42001-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:39:05Z","timestamp":1558687145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42001-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420009","9783642420016"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42001-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}