{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:29:59Z","timestamp":1742995799441,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642545672"},{"type":"electronic","value":"9783642545689"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54568-9_12","type":"book-chapter","created":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T14:31:35Z","timestamp":1395325895000},"page":"178-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model"],"prefix":"10.1007","author":[{"given":"Georg","family":"Neugebauer","sequence":"first","affiliation":[]},{"given":"Lucas","family":"Brutschy","sequence":"additional","affiliation":[]},{"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,21]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical. In: Computer and Communications Security - CCS 1993, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: ACM Symposium on Theory of Computing - STOC 1988, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"12_CR3","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical report, ETH Z\u00fcrich (1997)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"1998","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13, 143\u2013202 (1998)","journal-title":"J. Cryptology"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. Cryptology ePrint Archive, 2000\/055 (2000)","DOI":"10.7146\/brics.v7i14.20141"},{"key":"12_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"12_CR7","series-title":"LNCS","first-page":"55","volume-title":"TRUST 2012","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. 7344, pp. 55\u201373. Springer, Heidelberg (2012)"},{"key":"12_CR8","unstructured":"Cristofaro, E., Tsudik, G.: On the performance of certain private set intersection protocols. Cryptology ePrint Archive, Report 2012\/054 (2012)"},{"key":"12_CR9","series-title":"LNCS","first-page":"119","volume-title":"PKC 2001","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. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"12_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012)"},{"key":"12_CR11","series-title":"LNCS","first-page":"186","volume-title":"Advances in Cryptology-CRYPTO 1986","author":"A Fiat","year":"1986","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) Advances in Cryptology-CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1986)"},{"key":"12_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"ASIACRYPT 2001","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 351\u2013368. Springer, Heidelberg (2001)"},{"key":"12_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: Basic applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of cryptography: Basic applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s00145-010-9067-9","volume":"23","author":"J Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. Cryptology 23, 546\u2013579 (2002)","journal-title":"J. Cryptology"},{"key":"12_CR15","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols. In: NDSS (2012)"},{"key":"12_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Mayer, D., Wetzel, S.: Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model. In: 7th Symposium on Information, Computer and Communications Security, ASIACCS. ACM (2012)","DOI":"10.1145\/2414456.2414482"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Mayer, D.A., Neugebauer, G., Meyer, U., Wetzel, S.: Enabling fair and privacy-preserving applications using reconciliation protocols on ordered sets. In: IEEE Sarnoff Symposium 2011, pp. 1\u20136. IEEE (2011)","DOI":"10.1109\/SARNOF.2011.5876461"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, U., Wetzel, S.: Distributed privacy-preserving policy reconciliation. In: ICC 2007, pp. 1342\u20131349. IEEE (2007)","DOI":"10.1109\/ICC.2007.226"},{"key":"12_CR20","unstructured":"Meyer, U., Wetzel, S., Ioannidis, S.: New advances on privacy-preserving policy reconciliation. Cryptology ePrint Archive, 2010\/064 (2010)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Neugebauer, G., Brutschy, L., Meyer, U., Wetzel, S.: Design and implementation of privacy-preserving reconciliation protocols. In: 6th PAIS. ACM (2013)","DOI":"10.1145\/2457317.2457339"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Neugebauer, G., Brutschy, L., Meyer, U., Wetzel, S.: Privacy-preserving multi-party reconciliation secure in the malicious model (extended version). Cryptology ePrint Archive, Report 2013\/655 (2013)","DOI":"10.1007\/978-3-642-54568-9_12"},{"key":"12_CR23","series-title":"LNCS","first-page":"136","volume-title":"ISC 2010","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. 6531, pp. 136\u2013151. Springer, Heidelberg (2011)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Neugebauer, G., Meyer, U., Wetzel, S.: Fair and privacy-preserving multi-party protocols for reconciling ordered input sets (extended version). Cryptology ePrint Archive, Report 2010\/512 (2011)","DOI":"10.1007\/978-3-642-18178-8_12"},{"key":"12_CR25","series-title":"LNCS","first-page":"61","volume-title":"ACNS 2004","author":"L Nguyen","year":"2004","unstructured":"Nguyen, L., Safavi-Naini, R., Kurosawa, K.: Verifiable shuffles: a formal model and a paillier-based efficient construction with provable security. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"12_CR26","series-title":"LNCS","first-page":"223","volume-title":"EUROCRYPT 1999","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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Symposium on Foundations of Computer Science - SFCS 1982, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management and Autonomous Spontaneous Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54568-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T22:15:54Z","timestamp":1675808154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-54568-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642545672","9783642545689"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54568-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}