{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:44:27Z","timestamp":1768743867989,"version":"3.49.0"},"reference-count":28,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Minister of Science and Technology, Taiwan","award":["MOST 111-2221-E-002-134-MY3"],"award-info":[{"award-number":["MOST 111-2221-E-002-134-MY3"]}]},{"name":"Minister of Science and Technology, Taiwan","award":["TSMC: 112H1002-D"],"award-info":[{"award-number":["TSMC: 112H1002-D"]}]},{"name":"Taiwan Semiconductor Manufacturing Company","award":["MOST 111-2221-E-002-134-MY3"],"award-info":[{"award-number":["MOST 111-2221-E-002-134-MY3"]}]},{"name":"Taiwan Semiconductor Manufacturing Company","award":["TSMC: 112H1002-D"],"award-info":[{"award-number":["TSMC: 112H1002-D"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This work presents an efficient and effective system allowing hospitals to share patients\u2019 private information while ensuring that each hospital database\u2019s medical records will not be leaked; moreover, the privacy of patients who access the data will also be protected. We assume that the thread model of the hospital\u2019s security is semi-honest (i.e., curious but honest), and each hospital hired a trusted medical records department administrator to manage patients\u2019 private information from other hospitals. With the help of Homomorphic Encryption- and Private Set Intersection -related algorithms, our proposed system protects patient privacy, allows physicians to obtain patient information across hospitals, and prevents threats such as troublesome insider attacks and man-in-the-middle attacks.<\/jats:p>","DOI":"10.3390\/a16050244","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T01:57:51Z","timestamp":1683683871000},"page":"244","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Privacy-Preserving Symptoms Retrieval System with the Aid of Homomorphic Encryption and Private Set Intersection Schemes"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2452-2088","authenticated-orcid":false,"given":"Yi-Wei","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106216, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3631-1551","authenticated-orcid":false,"given":"Ja-Ling","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106216, Taiwan"},{"name":"Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei 106216, Taiwan"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Li, H., Liu, D., Jia, K., and Lin, X. (2015, January 8\u201312). Achieving authorized and ranked multi-keyword search over encrypted cloud data. Proceedings of the 2015 IEEE International Conference on Communications (ICC), London, UK.","DOI":"10.1109\/ICC.2015.7249517"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"30444","DOI":"10.1109\/ACCESS.2018.2846037","article-title":"Efficiently revocable and searchable attribute-based encryption scheme for mobile cloud storage","volume":"6","author":"Wang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"109038","DOI":"10.1109\/ACCESS.2019.2928455","article-title":"A Keyword-searchable ABE scheme from lattice in cloud storage environment","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_4","first-page":"1667","article-title":"Multi-authority attribute-based keyword search over encrypted cloud data","volume":"18","author":"Miao","year":"2021","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"46313","DOI":"10.1109\/ACCESS.2021.3068194","article-title":"Abkspbm: Attribute-based keyword search with partial bilinear map","volume":"9","author":"Khan","year":"2021","journal-title":"IEEE Access"},{"key":"ref_6","first-page":"1307","article-title":"Secure fine-grained encrypted keyword search for e-Healthcare cloud","volume":"18","author":"Wang","year":"2021","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_7","unstructured":"Rivest, R.L., Dertouzos, M.L., and Adleman, L. (1978). Foundations of Secure Computation, Academic Press."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., and Micali, S. (1982, January 5\u20137). Probabilistic encryption & how to play mental poker keeping secret all partial information. Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, CA, USA.","DOI":"10.1145\/800070.802212"},{"key":"ref_10","unstructured":"(2023, May 04). Wikipedia: Homomorphic Encryption. Available online: https:\/\/en.wikipedia.org\/wiki\/Homomorphic_encryption."},{"key":"ref_11","unstructured":"Fan, J., and Vercauteren, F. (2023, May 04). Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2012\/144. Available online: https:\/\/ia.cr\/2012\/144."},{"key":"ref_12","unstructured":"Gentry, C. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the STOC \u201809: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3124441","article-title":"A Survey on fully homomorphic encryption: An engineering perspective","volume":"50","author":"Martins","year":"2017","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Meadows, C. (1986, January 7\u20139). A More efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, USA.","DOI":"10.1109\/SP.1986.10022"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Huberman, B.A., Franklin, M., and Hogg, T. (1999, January 3\u20135). Enhancing privacy and trust in electronic communities. Proceedings of the EC \u201899: Proceedings of the 1st ACM Conference on Electronic Commerce, Denver, CO, USA.","DOI":"10.1145\/336992.337012"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., and Pinkas, B. (2004, January 2\u20136). Efficient private matching and set intersection. Proceedings of the Advances in Cryptology-EUROCRYPT, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Hazay, C., and Lindell, Y. (2008, January 19\u201321). Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Proceedings of the Theory of Cryptography Conference, New York, NY, USA.","DOI":"10.1007\/s00145-008-9034-x"},{"key":"ref_18","first-page":"797","article-title":"Faster private set intersection based on OT extension","volume":"14","author":"Pinkas","year":"2014","journal-title":"Usenix Secur."},{"key":"ref_19","unstructured":"Pinkas, B., Schneider, T., and Zohner, M. (2023, May 04). Scalable Private Set Intersection Based on OT Extension. Available online: http:\/\/eprint.iacr.org\/2016\/930."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Orsini, E., and Scholl, P. (2017, January 14\u201317). Actively secure 1-out-of-n ot extension with application to private set intersection. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Francisco, CA, USA.","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., and Trieu, N. (2023, May 04). Efficient Batched Oblivious PRF with Applications to Private Set Intersec-tion. Available online: http:\/\/eprint.iacr.org\/2016\/799.","DOI":"10.1145\/2976749.2978381"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., and Rindal, P. (November, January 30). Fast private set intersection from homomorphic encryption. Proceedings of the CCS \u201817: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134061"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., and Rindal, P. (2018, January 15\u201319). Labeled PSI from fully homomorphic encryption with malicious security. Proceedings of the CCS \u201818: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada.","DOI":"10.1145\/3243734.3243836"},{"key":"ref_24","unstructured":"Gentry, C., Halevi, S., and Smart, N.P. (2012, January 19\u201323). Homomorphic evaluation of the AES circuit. Proceedings of the 32nd Annual Cryptology Conference (CRYPTO\u201912), Santa Barbara, CA, USA."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","article-title":"Cuckoo Hashing","volume":"51","author":"Pagh","year":"2004","journal-title":"J. Algorithms"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Arbitman, Y., Naor, M., and Segev, G. (2010, January 23\u201326). Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. Proceedings of the 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, USA. Available online: https:\/\/www.cs.huji.ac.il\/w~segev\/papers\/BackyardCuckooHashing.pdf.","DOI":"10.1109\/FOCS.2010.80"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kuo, T.-H., and Wu, J.-L. (2023). A High Throughput BFV-Encryption-Based Secure Comparison Protocol. Mathematics, 11.","DOI":"10.3390\/math11051227"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Nissenbaum, O., Omri, E., and Paskin-Cherniavsky, A. (June, January 30). PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. Proceedings of the ASIA CCS \u201822: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, Nagasaki, Japan.","DOI":"10.1145\/3488932.3523254"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/244\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:32:02Z","timestamp":1760124722000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":28,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["a16050244"],"URL":"https:\/\/doi.org\/10.3390\/a16050244","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,9]]}}}