{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:43:08Z","timestamp":1772044988776,"version":"3.50.1"},"reference-count":39,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T00:00:00Z","timestamp":1708128000000},"content-version":"vor","delay-in-days":47,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFC3306201"],"award-info":[{"award-number":["2023YFC3306201"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N2317004"],"award-info":[{"award-number":["N2317004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772125"],"award-info":[{"award-number":["61772125"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>\n                    Two\u2010party private set intersection (PSI) plays a pivotal role in secure two\u2010party computation protocols. The communication cost in a PSI protocol is normally influenced by the sizes of the participating parties. However, for parties with unbalanced sets, the communication costs of existing protocols mainly depend on the size of the larger set, leading to high communication cost. In this paper, we propose a low communication\u2010cost PSI protocol designed specifically for unbalanced two\u2010party private sets, aiming to enhance the efficiency of communication. For each item in the smaller set, the receiver queries whether it belongs to the larger set, such that the communication cost depends solely on the smaller set. The queries are implemented by private information retrieval which is constructed with trapdoor hash function. Our investigation indicates that in each instance of invoking the trapdoor hash function, the receiver is required to transmit both a hash key and an encoding key to the sender, thus incurring significant communication cost. In order to address this concern, we propose the utilization of a seed hash key, a seed encoding key, and a Latin square. By employing these components, the sender can autonomously generate all the necessary hash keys and encoding keys, obviating the multiple transmissions of such keys. The proposed protocol is provably secure against a semihonest adversary under the Decisional Diffie\u2013Hellman assumption. Through implementation demonstration, we showcase that when the sizes of the two sets are 2\n                    <jats:sup>8<\/jats:sup>\n                    and 2\n                    <jats:sup>14<\/jats:sup>\n                    , the communication cost of our protocol is only 3.3% of the state\u2010of\u2010the\u2010art protocol and under 100\u2009Kbps bandwidth, we achieve 1.46x speedup compared to the state\u2010of\u2010the\u2010art protocol. Our source code is available on GitHub:\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/TAN-OpenLab\/Unbanlanced-PSI\">https:\/\/github.com\/TAN-OpenLab\/Unbanlanced-PSI<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1049\/2024\/6052651","type":"journal-article","created":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T15:05:07Z","timestamp":1708182307000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low Communication\u2010Cost PSI Protocol for Unbalanced Two\u2010Party Private Sets"],"prefix":"10.1049","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6949-6636","authenticated-orcid":false,"given":"Jingyu","family":"Ning","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-8925","authenticated-orcid":false,"given":"Zhenhua","family":"Tan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2760-3273","authenticated-orcid":false,"given":"Kaibing","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8004-4563","authenticated-orcid":false,"given":"Weizhong","family":"Ye","sequence":"additional","affiliation":[]}],"member":"265","published-online":{"date-parts":[[2024,2,17]]},"reference":[{"key":"e_1_2_12_1_2","volume-title":"A Pragmatic Introduction to Secure Multi-Party Computation","author":"David E.","year":"2018"},{"key":"e_1_2_12_2_2","doi-asserted-by":"crossref","unstructured":"RosulekM.andTrieuN. Compact and Malicious Private Set Intersection for Small Sets Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security 2021 Association for Computing Machinery 1166\u20131181 https:\/\/doi.org\/10.1145\/3460120.3484778.","DOI":"10.1145\/3460120.3484778"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.1049\/ise2.12070"},{"key":"e_1_2_12_5_2","doi-asserted-by":"crossref","unstructured":"IonM. KreuterB. NergizA. E. PatelS. SaxenaS. SethK. RaykovaM. ShanahanD. andYungM. On deploying secure computing: private intersection-sum-with-cardinality 2020 IEEE European Symposium on Security and Privacy 2020 Genoa Italy IEEE 370\u2013389 https:\/\/doi.org\/10.1109\/EuroSP48549.2020.00031.","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_2_12_6_2","unstructured":"KalesD. RechbergerC. SchneiderT. SenkerM. andWeinertC. Mobile private contact discovery at scale 28th USENIX Security Symposium 2019 USENIX 1\u201320."},{"key":"e_1_2_12_7_2","doi-asserted-by":"crossref","unstructured":"MeadowsC. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party IEEE Symposium on Security & Privacy 1986 IEEE 134\u2013134 https:\/\/doi.org\/10.1109\/SP.1986.10022 2-s2.0-84920452265.","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_2_12_8_2","doi-asserted-by":"crossref","unstructured":"HubermanB. A. FranklinM. andHoggT. Enhancing privacy and trust in electronic communities Proceedings of the 1st ACM conference on Electronic commerce 1999 Association for Computing Machinery 78\u201386 https:\/\/doi.org\/10.1145\/336992.337012 2-s2.0-84883891962.","DOI":"10.1145\/336992.337012"},{"key":"e_1_2_12_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_2_12_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"e_1_2_12_11_2","first-page":"797","volume-title":"Faster private Set Intersection Based on OT Extension","author":"Pinkas B.","year":"2014"},{"key":"e_1_2_12_12_2","doi-asserted-by":"crossref","unstructured":"KolesnikovV. KumaresanR. RosulekM. andTrieuN. Efficient batched oblivious PRF with applications to private set intersection Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security 2016 Association for Computing Machinery 818\u2013829 https:\/\/doi.org\/10.1145\/2976749.2978381 2-s2.0-84995387186.","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_2_12_13_2","first-page":"515","volume-title":"Phasing: Private Set Intersection Using Permutation-Based Hashing","author":"Pinkas B.","year":"2015"},{"key":"e_1_2_12_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_2_12_15_2","doi-asserted-by":"crossref","unstructured":"RindalP.andRosulekM. Malicious-secure private set intersection via dual execution Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security 2017 Association for Computing Machinery 1229\u20131242 https:\/\/doi.org\/10.1145\/3133956.3134044 2-s2.0-85040312295.","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_2_12_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_2_12_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_2_12_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_2_12_25_2","doi-asserted-by":"crossref","unstructured":"ChenH. LaineK. andRindalP. Fast private set intersection from homomorphic encryption Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security 2017 Association for Computing Machinery 1243\u20131255 https:\/\/doi.org\/10.1145\/3133956.3134061 2-s2.0-85041431930.","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_2_12_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2971254"},{"key":"e_1_2_12_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3040776"},{"key":"e_1_2_12_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3129512"},{"key":"e_1_2_12_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"e_1_2_12_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90456-2_5"},{"key":"e_1_2_12_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"e_1_2_12_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_2_12_33_2","volume-title":"Foundations of Cryptography: Volume 2: Basic Applications","author":"Goldreich O.","year":"2004"},{"key":"e_1_2_12_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_12_35_2","volume-title":"Introductory Combinatorics","author":"Brualdi R. A.","year":"2009"},{"key":"e_1_2_12_36_2","doi-asserted-by":"crossref","unstructured":"KushilevitzE.andOstrovskyR. Replication is not needed: single database computationally-private information retrieval Proceedings 38th Annual Symposium on Foundations of Computer Science 1997 Miami Beach FL USA IEEE 364\u2013373 https:\/\/doi.org\/10.1109\/SFCS.1997.646125.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_2_12_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3227753"},{"key":"e_1_2_12_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2355850"},{"key":"e_1_2_12_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0432-z"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/6052651.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/6052651.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2024\/6052651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:57:27Z","timestamp":1762333047000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2024\/6052651"}},"subtitle":[],"editor":[{"given":"Helena","family":"Rif\u00e0-Pous","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1049\/2024\/6052651"],"URL":"https:\/\/doi.org\/10.1049\/2024\/6052651","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2023-09-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6052651"}}