{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T19:35:36Z","timestamp":1772307336920,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":49,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987290","type":"print"},{"value":"9789819987306","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8730-6_9","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T07:02:04Z","timestamp":1702796524000},"page":"268-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Practically Efficient Private Set Intersection from\u00a0Trusted Hardware with\u00a0Side-Channels"],"prefix":"10.1007","author":[{"given":"Felix","family":"D\u00f6rre","sequence":"first","affiliation":[]},{"given":"Jeremias","family":"Mechler","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad, A., Kim, K., Sarfaraz, M.I., Lee, B.: OBLIVIATE: a data oblivious filesystem for intel SGX (2018)","DOI":"10.14722\/ndss.2018.23284"},{"key":"9_CR2","unstructured":"Apple: Secure enclave (2022). https:\/\/support.apple.com\/guide\/security\/secure-enclave-sec59b0b31ff\/web. Accessed 31 Aug 2022"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: Size-hiding private set intersection, pp. 156\u2013173 (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_10","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: capturing global setup within plain UC, pp. 1\u201330 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1","DOI":"10.1007\/978-3-030-64381-2_1"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bahmani, R., et al.: Secure multiparty computation from SGX, pp. 477\u2013497 (2017)","DOI":"10.1007\/978-3-319-70972-7_27"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption, pp. 394\u2013403 (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646128","DOI":"10.1109\/SFCS.1997.646128"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Bhatotia, P., Kohlweiss, M., Martinico, L., Tselekounis, Y.: Steel: composable hardware-based stateful and randomised functional encryption, pp. 709\u2013736 (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_25","DOI":"10.1007\/978-3-030-75248-4_25"},{"key":"9_CR8","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. Draft 0.6 (2026)"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles, pp. 280\u2013312 (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11","DOI":"10.1007\/978-3-319-78381-9_11"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols, pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup, pp. 61\u201385 (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments, pp. 19\u201340 (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version), pp. 209\u2013218 (1998). https:\/\/doi.org\/10.1145\/276698.276741","DOI":"10.1145\/276698.276741"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: On the random-oracle methodology as applied to length-restricted signature schemes, pp. 40\u201357 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_3","DOI":"10.1007\/978-3-540-24638-1_3"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Jain, A., Scafuro, A.: Practical UC security with a global random oracle, pp. 597\u2013608 (2014). https:\/\/doi.org\/10.1145\/2660267.2660374","DOI":"10.1145\/2660267.2660374"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels, pp. 337\u2013351 (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_22","DOI":"10.1007\/3-540-46035-7_22"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Carter, J., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90044-8, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0022000079900448","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"9_CR19","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive, Report 2016\/086 (2016). https:\/\/eprint.iacr.org\/2016\/086"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography, 22(6), 644\u2013654 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055638","DOI":"10.1109\/TIT.1976.1055638"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing, pp. 870\u2013899 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_29","DOI":"10.1007\/978-3-030-64840-4_29"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection, pp. 395\u2013425 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"9_CR23","unstructured":"Garriss, S., Kaminsky, M., Freedman, M.J., Karp, B., Mazi\u00e8res, D., Yu, H.: RE: reliable email. In: Peterson, L.L., Roscoe, T. (eds.) 3rd Symposium on Networked Systems Design and Implementation (NSDI 2006), 8\u201310 May 2007, San Jose, California, USA, Proceedings. USENIX (2006). http:\/\/www.usenix.org\/events\/nsdi06\/tech\/garriss.html"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs, pp. 182\u2013194 (1987). https:\/\/doi.org\/10.1145\/28395.28416","DOI":"10.1145\/28395.28416"},{"key":"9_CR25","unstructured":"Gueron, S.: Intel advanced encryption standard (AES) new instructions set (2010)"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, pp. 155\u2013175 (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"9_CR27","unstructured":"IBM: IBM secure execution for Linux (2022). https:\/\/www.ibm.com\/downloads\/cas\/O158MBWG, Accessed 31 Aug 2022"},{"key":"9_CR28","unstructured":"Intel: Intel software guard extensions (intel SGX) (2023). https:\/\/download.01.org\/intel-sgx\/sgx-linux\/2.9.1\/docs\/Intel_SGX_Developer_Guide.pdf"},{"issue":"1\u201310","key":"9_CR29","first-page":"119","volume":"1","author":"S Johnson","year":"2016","unstructured":"Johnson, S., Scarlata, V., Rozas, C., Brickell, E., Mckeen, F.: Intel software guard extensions: EPID provisioning and attestation services. White Paper 1(1\u201310), 119 (2016)","journal-title":"White Paper"},{"key":"9_CR30","unstructured":"Kulshrestha, A., Mayer, J.R.: Identifying harmful media in end-to-end encrypted communication: Efficient private membership computation. In: Bailey, M., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021(August), pp. 11\u201313, 2021, pp. 893\u2013910. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/kulshrestha"},{"key":"9_CR31","unstructured":"Kumar, A.: Active platform management demystified: unleashing the power of intel VPro (TM) technology. Intel Press (2009)"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Lu, Y., Zhang, B., Zhou, H.S., Liu, W., Zhang, L., Ren, K.: Correlated randomness teleportation via semi-trusted hardware - enabling silent multi-party computation, pp. 699\u2013720 (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_34","DOI":"10.1007\/978-3-030-88428-4_34"},{"key":"9_CR33","unstructured":"Marlinspike, M.: Private contact discovery for signal. https:\/\/signal.org\/blog\/private-contact-discovery\/ (2017)"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"McCune, J.M., Parno, B., Perrig, A., Reiter, M.K., Isozaki, H.: Flicker: an execution infrastructure for tcb minimization. In: Sventek, J.S., Hand, S. (eds.) Proceedings of the 2008 EuroSys Conference, Glasgow, Scotland, UK, April 1\u20134, 2008. pp. 315\u2013328. ACM (2008). https:\/\/doi.org\/10.1145\/1352592.1352625, https:\/\/doi.org\/10.1145\/1352592.1352625","DOI":"10.1145\/1352592.1352625"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Melotti, D., Rossi-Bellom, M., Continella, A.: Reversing and fuzzing the google titan m chip. In: Reversing and Offensive-oriented Trends Symposium, pp. 1\u201310 (2021)","DOI":"10.1145\/3503921.3503922"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability, 23(4), 594\u2013671 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9068-8","DOI":"10.1007\/s00145-010-9068-8"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Murdock, K., Oswald, D., Garcia, F.D., Van Bulck, J., Gruss, D., Piessens, F.: Plundervolt: software-based fault injection attacks against intel SGX, pp. 1466\u20131482 (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00057","DOI":"10.1109\/SP40000.2020.00057"},{"key":"9_CR38","unstructured":"Nilsson, A., Bideh, P.N., Brorsson, J.: A survey of published attacks on intel SGX. CoRR abs\/2006.13598 (2020). https:\/\/arxiv.org\/abs\/2006.13598"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E., Tram\u00e8r, F.: Formal abstractions for attested execution secure processors, pp. 260\u2013289 (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_10","DOI":"10.1007\/978-3-319-56620-7_10"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: Fast, malicious private set intersection, pp. 739\u2013767 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Rindal, P., Raghuraman, S.: Blazing fast PSI from improved OKVS and subfield VOLE. IACR Cryptol. ePrint Arch. p. 320 (2022). https:\/\/eprint.iacr.org\/2022\/320","DOI":"10.1145\/3548606.3560658"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Rindal, P., Rosulek, M.: Improved private set intersection against malicious adversaries, pp. 235\u2013259 (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_9","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Schwarz, M., et al.: ZombieLoad: cross-privilege-boundary data sampling, pp. 753\u2013768 (2019). https:\/\/doi.org\/10.1145\/3319535.3354252","DOI":"10.1145\/3319535.3354252"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Stapf, E., Jauernig, P., Brasser, F., Sadeghi, A.: In hardware we trust? from TPM to enclave computing on RISC-V. In: 29th IFIP\/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2021, Singapore, 4\u20137 October 2021, pp. 1\u20136. IEEE (2021). https:\/\/doi.org\/10.1109\/VLSI-SoC53125.2021.9606968","DOI":"10.1109\/VLSI-SoC53125.2021.9606968"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Sun, H., Su, J., Wang, X., Chen, R., Liu, Y., Hu, Q.: PriMal: cloud-based privacy-preserving malware detection, pp. 153\u2013172 (2017)","DOI":"10.1007\/978-3-319-59870-3_9"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Tamrakar, S., Liu, J., Paverd, A., Ekberg, J.E., Pinkas, B., Asokan, N.: The circle game: scalable private membership test using trusted hardware, pp. 31\u201344 (2017)","DOI":"10.1145\/3052973.3053006"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Tram\u00e8r, F., Zhang, F., Lin, H., Hubaux, J., Juels, A., Shi, E.: Sealed-glass proofs: using transparent enclaves to prove and sell knowledge. In: 2017 IEEE European Symposium on Security and Privacy, EuroS &P 2017, Paris, France, 26\u201328 April 2017, pp. 19\u201334. IEEE (2017). https:\/\/doi.org\/10.1109\/EuroSP.2017.28","DOI":"10.1109\/EuroSP.2017.28"},{"key":"9_CR48","unstructured":"Van Bulck, J., et al.: Foreshadow: extracting the keys to the intel SGX kingdom with transient out-of-order execution, pp. 991\u20131008 (2018)"},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"Zinkina, A.: UC-sichere private Schnittmengenberechnung mit transparenten Enklaven. KITopen Repository of the Karlsruhe Institute of Technology (2019). https:\/\/doi.org\/10.5445\/IR\/1000099120","DOI":"10.5445\/IR\/1000099120"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8730-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:49Z","timestamp":1765933369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8730-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987290","9789819987306"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8730-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"106","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":"0","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":"28% - 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":"12","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}