{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:24:06Z","timestamp":1742923446568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930424"},{"type":"electronic","value":"9783030930431"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93043-1_4","type":"book-chapter","created":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T03:03:52Z","timestamp":1639019032000},"page":"56-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privately Querying Privacy: Privacy Estimation with\u00a0Guaranteed Privacy of\u00a0User and\u00a0Database Party"],"prefix":"10.1007","author":[{"given":"Anna Katharina","family":"Hildebrandt","sequence":"first","affiliation":[]},{"given":"Ernst","family":"Althaus","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Hildebrandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"key":"4_CR1","unstructured":"Aggarwal, C.C.: On k-anonymity and the curse of dimensionality. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB 2005, pp. 901\u2013909. VLDB Endowment (2005). http:\/\/dl.acm.org\/citation.cfm?id=1083592.1083696"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar Melchor, C., Barrier, J., Fousse, L., Killijian, M.O.: XPIR: private information retrieval for everyone. Proc. Privacy Enhan. Technol. 2016, 155\u2013174 (2016)","DOI":"10.1515\/popets-2016-0010"},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998). https:\/\/doi.org\/10.1145\/293347.293350","journal-title":"J. ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Couteau, G.: New protocols for secure equality test and comparison. In: Proceedings of the Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Leuven, Belgium, July 2\u20134, 2018, pp. 303\u2013320 (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_16","DOI":"10.1007\/978-3-319-93387-0_16"},{"key":"4_CR5","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. 5536, pp. 125\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01957-9_8"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: 22nd Annual Network and Distributed System Security Symposium (NDSS 2015). Internet Society, February 2015. http:\/\/tubiblio.ulb.tu-darmstadt.de\/101761\/","DOI":"10.14722\/ndss.2015.23113"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Diggelmann, O., Cleis, M.N.: How the right to privacy became a human right. Hum. Rights Law Rev. 14(3), 441\u2013458 (2014)","DOI":"10.1093\/hrlr\/ngu014"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.: Differential privacy (2020). https:\/\/doi.org\/10.1007\/978-3-319-96131-6_23","DOI":"10.1007\/978-3-319-96131-6_23"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","DOI":"10.1145\/3812.3818"},{"key":"4_CR11","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":"MJ 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. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gymrek, M., McGuire, A.L., Golan, D., Halperin, E., Erlich, Y.: Identifying personal genomes by surname inference. Science 339(6117), 321\u2013324 (2013)","DOI":"10.1126\/science.1229566"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., Pinkas, B.: Private set intersection for unequal set sizes with mobile applications. In: Proceedings on Privacy Enhancing Technologies, vol. 4, pp. 177\u2013197 (2017). https:\/\/doi.org\/10.1515\/popets-2017-0044","DOI":"10.1515\/popets-2017-0044"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 818\u2013829. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2976749.2978381, http:\/\/doi.acm.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Sadeghi, A., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Proceedings of the Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, 12\u201314 December 2009. pp. 1\u201320 (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_1","DOI":"10.1007\/978-3-642-10433-6_1"},{"issue":"11","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.14778\/3342263.3342274","volume":"12","author":"I Kotsogiannis","year":"2019","unstructured":"Kotsogiannis, I., Tao, Y., He, X., Fanaeepour, M., Machanavajjhala, A., Hay, M., Miklau, G.: Privatesql: a differentially private SGL query engine. Proc. VLDB Endow. 12(11), 1371\u20131384 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-Closeness: privacy beyond k-anonymity and l-diversity. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 106\u2013115, April 2007. https:\/\/doi.org\/10.1109\/ICDE.2007.367856","DOI":"10.1109\/ICDE.2007.367856"},{"issue":"2","key":"4_CR18","first-page":"324","volume":"19","author":"S Li","year":"2010","unstructured":"Li, S., Wang, D., Dai, Y.: Efficient secure multiparty computational geometry. Chin. J. Electr. 19(2), 324\u2013328 (2010)","journal-title":"Chin. J. Electr."},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Liu, X., Li, S., Liu, J., Chen, X., Xu, G.: Secure multiparty computation of a comparison problem. SpringerPlus 5 (2016). https:\/\/doi.org\/10.1186\/s40064-016-3061-0, https:\/\/pdfs.semanticscholar.org\/454f\/f4c920ea2dd4ea74cc4ac3e7114ff016c582.pdf","DOI":"10.1186\/s40064-016-3061-0"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: L-diversity: privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data 1(1), March 2007. https:\/\/doi.org\/10.1145\/1217299.1217302, http:\/\/doi.acm.org\/10.1145\/1217299.1217302","DOI":"10.1145\/1217299.1217302"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing. STOC 1999, pp. 245\u2013254. ACM, New York (1999). https:\/\/doi.org\/10.1145\/301250.301312, http:\/\/doi.acm.org\/10.1145\/301250.301312","DOI":"10.1145\/301250.301312"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: 2008 IEEE Symposium on Security and Privacy (SP 2008), pp. 111\u2013125, May 2008. https:\/\/doi.org\/10.1109\/SP.2008.33","DOI":"10.1109\/SP.2008.33"},{"key":"4_CR23","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Sweeney, L.: K-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002). https:\/\/doi.org\/10.1142\/S0218488502001648, http:\/\/dx.doi.org\/10.1142\/S0218488502001648","DOI":"10.1142\/S0218488502001648"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Wagner, I.: Genomic privacy metrics: a systematic comparison. In: 2015 IEEE Security and Privacy Workshops, pp. 50\u201359, May 2015. https:\/\/doi.org\/10.1109\/SPW.2015.15","DOI":"10.1109\/SPW.2015.15"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Wagner, I., Eckhoff, D.: Technical privacy metrics: a systematic survey. ACM Comput. Surv. 51(3), 57:1\u201357:38 (2018). https:\/\/doi.org\/10.1145\/3168389, http:\/\/doi.acm.org\/10.1145\/3168389","DOI":"10.1145\/3168389"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160\u2013164, November 1982. https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167, October 1986. https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93043-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T19:12:32Z","timestamp":1639509152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93043-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030930424","9783030930431"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93043-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOCLOUD2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.06","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}