{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:09:13Z","timestamp":1778789353256,"version":"3.51.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030900182","type":"print"},{"value":"9783030900199","type":"electronic"}],"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-90019-9_18","type":"book-chapter","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:47:48Z","timestamp":1635878868000},"page":"352-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Provably Secure Contact Tracing with Conditional Private Set Intersection"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Takeshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Karl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alamin","family":"Mohammed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Striegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taeho","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,3]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Altuwaiyan, T., et al.: Epic: efficient privacy-preserving contact tracing for infection detection. In: IEEE ICC, pp. 1\u20136 (2018)","DOI":"10.1109\/ICC.2018.8422886"},{"key":"18_CR2","unstructured":"Apple and Google. Privacy-Preserving Contact Tracing (2020). apple.co\/3bFFWzp"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Baumg\u00e4rtner, L., et al.: Mind the GAP: security and privacy risks of contact tracing apps. arXiv preprint (2020). arXiv:2006.05914","DOI":"10.1109\/TrustCom50675.2020.00069"},{"key":"18_CR4","unstructured":"Bay, J., et al.: BlueTrace: a privacy-preserving protocol for community-driven contact tracing across borders. Tech. Rep. GovTech-Singapore (2020)"},{"key":"18_CR5","unstructured":"Bell, J., et al.: Tracesecure: towards privacy preserving contact tracing. arXiv preprint arXiv:2004.04059 (2020)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM TOCT 6(3), 1\u201336 (2014)","DOI":"10.1145\/2633600"},{"key":"18_CR7","unstructured":"Burke, L.:. New variant meets its first university (2021)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H., et al.: Fast private set intersection from homomorphic encryption. In: ACM CCS, pp. 1243\u20131255 (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., et al.: Labeled PSI from fully homomorphic encryption with malicious security. In: ACM CCS, pp. 1223\u20131237 (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"18_CR10","unstructured":"Cho, H., Ippolito, D., Yu, Y.W.:. Contact tracing mobile apps for covid-19: Privacy considerations and related trade-offs. arXiv preprint arXiv:2003.11511 (2020)"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Orlandi, C.: Combining private set-intersection with secure two-party computation. In: Catalano, D., De Prisco, R. (eds) Security and Cryptography for Networks. SCN 2018. Lecture Notes in Computer Science, vol. 11035. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_25","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"18_CR12","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. IACR Cryptol. ePrint Arch. 86, 1\u2013118 (2016)"},{"key":"18_CR13","unstructured":"Dave C., Kurt R., Yuriy P., Ryan, G.:. The PALISADE lattice cryptography library (2020). bit.ly\/35Bthtz"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set Intersection and Union. In: Pieprzyk, J., Sadeghi, A., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35404-5_17","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"18_CR15","unstructured":"Junfeng Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch., 144 (2012)"},{"key":"18_CR16","unstructured":"Centers for Disease Control and Prevention. Appendix A - Glossary of Key Terms (2020). bit.ly\/2LljkK0"},{"key":"18_CR17","unstructured":"Garmin. Project Tesserae powered by Garmin (2018). bit.ly\/3nI2yBC"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES Circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"18_CR19","unstructured":"Halevi, S., Shoup, V.: Design and implementation of a homomorphic-encryption library. IBM Research (Manuscript) 6, 12\u201315 (2013)"},{"key":"18_CR20","unstructured":"Ion, M., et al.: Private intersection-sum protocol with applications to attributing aggregate ad conversions. IACR Cryptol. ePrint Arch. 738 (2017)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: How to simulate it-a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography, pp. 277\u2013346 (2017)","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Liu, S., Jiang, Y., Striegel, A.: Face-to-face proximity estimationusing bluetooth on smartphones. IEEE Trans. Mobile Comput. 13(4), 811\u2013823 (2014)","DOI":"10.1109\/TMC.2013.44"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Lounis, K., Zulkernine, M.: Attacks and defenses in short-range wireless technologies for iot. IEEE Access 8, 88892\u201388932 (2020)","DOI":"10.1109\/ACCESS.2020.2993553"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Michael, K., Abbas, R.: Behind covid-19 contact trace apps: the Google-Apple partnership. IEEE Consumer Electronics Magazine 9(5), 71\u201376 (2020)","DOI":"10.1109\/MCE.2020.3002492"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Mofrad, S., Zhang, F., Lu, S., Shi, W.: A comparison study of intel sgx and amd memory encryption technology. In: HASP, pp. 1\u20138 (2018)","DOI":"10.1145\/3214292.3214301"},{"key":"18_CR26","unstructured":"Morgan, A.U., et al.: Remote monitoring of patients with covid-19: design, implementation, and outcomes of the first 3,000 patients in COVID Watch. NEJM Catalyst Innovations in Care Delivery, 1(4) (2020)"},{"key":"18_CR27","unstructured":"Nietzel, M.: Duke University suddenly imposes week-long stay-at-home order on all undergraduates (2021)"},{"key":"18_CR28","unstructured":"Government of Singapore. TraceTogether (2020). www.tracetogether.gov.sg"},{"key":"18_CR29","unstructured":"Benny, P., Eyal, R.: Hashomer-a proposal for a privacy-preserving bluetooth based contact tracing scheme for Hamagen (2020)"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Benny, P., Thomas, S., Christian, W., Udi, W.:. Efficient circuit-based PSI via cuckoo hashing. In: EUROCRYPT, pp. 125\u2013157 (2018)","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"18_CR31","unstructured":"Benny, P., Thomas, S., Michael, Z.: Faster private set intersection based on $$\\{$$OT$$\\}$$ extension. In: Usenix Security, pp. 797\u2013812 (2014)"},{"key":"18_CR32","unstructured":"Ramesh, R., et al.: Apps gone rogue: maintaining personal privacy in an epidemic. arXiv preprint arXiv:2003.08567 (2020)"},{"key":"18_CR33","unstructured":"Raskar, R., Pahwa, D., Beaudry, R.: Contact tracing: holistic solution beyond bluetooth. IEEE Data Eng. Bull 43(2), 67\u201370 (2020)"},{"key":"18_CR34","unstructured":"Reichert, L., Brack, S., Scheuermann, B.:. Privacy-preserving contact tracing of covid-19 patients. IACR Cryptol. ePrint Arch. 375 (2020)"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., et al.: HEAX: an architecture for computing on encrypted data. In: ACM ASPLOS, pp. 1295\u20131309 (2020)","DOI":"10.1145\/3373376.3378523"},{"key":"18_CR36","unstructured":"Microsoft SEAL (release 3.6) (2020). bit.ly\/3qgKCjd"},{"key":"18_CR37","unstructured":"Singh, P., et al.: Ppcontacttracing: a privacy-preserving contact tracing protocol for covid-19 pandemic. arXiv preprint arXiv:2008.06648 (2020)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Taassori, M., et al.: Vault: reducing paging overheads in SGX with efficient integrity verification structures. In: ASPLOS, pp. 665\u2013678 (2018)","DOI":"10.1145\/3296957.3177155"},{"key":"18_CR39","doi-asserted-by":"publisher","unstructured":"Takeshita, J., et al.: Algorithmic acceleration of B\/FV-Like somewhat homomorphic encryption for compute-enabled RAM. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 66\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_3","DOI":"10.1007\/978-3-030-81652-0_3"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Tan, B.H.M., et al.: Efficient private comparison queries over encrypted databases using fully homomorphic encryption with finite fields. IEEE TDSC (2020)","DOI":"10.1109\/TDSC.2020.2967740"},{"key":"18_CR41","unstructured":"Tang, Q.: Privacy-preserving contact tracing: current solutions and open questions. arXiv preprint arXiv:2004.06818 (2020)"},{"key":"18_CR42","unstructured":"Trieu, N., et al.: Epione: lightweight contact tracing with strong privacy. arXiv preprint arXiv:2004.13293 (2020)"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Wang, X.S., et al.: Efficient genome-wide, privacy-preserving similar patient query based on private edit distance. In: ACM CCS, pp. 492\u2013503 (2015)","DOI":"10.1145\/2810103.2813725"},{"key":"18_CR44","unstructured":"Wu, J., et al.: $$\\{$$BLESA$$\\}$$: spoofing attacks against reconnections in Bluetooth low energy. In: 14th $$\\{$$USENIX$$\\}$$ Workshop on Offensive Technologies ($$\\{$$WOOT$$\\}$$ 20) (2020)"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Yasaka, T.M., Lehrich, B.M., Sahyouni, R.:. Peer-to-peer contact tracing: development of a privacy-preserving smartphone app. JMIR Mhealth Uhealth, 8(4), e18936 (2020)","DOI":"10.2196\/18936"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Yoneki, E.: Fluphone study: virtual disease spread using haggle. In: CHANTS, pp. 65\u201366 (2011)","DOI":"10.1145\/2030652.2030672"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90019-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:57:15Z","timestamp":1635879435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90019-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030900182","9783030900199"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90019-9_18","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"3 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","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":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2021\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"56","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":"39% - 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":"3","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)"}}]}}