{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T05:16:08Z","timestamp":1759814168531,"version":"3.37.3"},"reference-count":14,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672010","61702168","61701173","WHUTIOT-2017B001"],"award-info":[{"award-number":["61672010","61702168","61701173","WHUTIOT-2017B001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672010","61702168","61701173","WHUTIOT-2017B001"],"award-info":[{"award-number":["61672010","61702168","61701173","WHUTIOT-2017B001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672010","61702168","61701173","WHUTIOT-2017B001"],"award-info":[{"award-number":["61672010","61702168","61701173","WHUTIOT-2017B001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hubei Key Laboratory of Transportation Internet of Things","award":["61672010","61702168","61701173","WHUTIOT-2017B001"],"award-info":[{"award-number":["61672010","61702168","61701173","WHUTIOT-2017B001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,9,1]]},"abstract":"<jats:p>Private set intersection (PSI) allows participants to securely compute the intersection of their inputs, which has a wide range of applications such as privacy-preserving contact tracing of COVID-19. Most existing PSI protocols were based on asymmetric\/symmetric cryptosystem. Therefore, keys-related operations would burden these systems. In this paper, we transform the problem of the intersection of sets into the problem of finding roots of polynomials by using point-value polynomial representation, blind polynomials\u2019 point-value pairs for secure transportation and computation with the pseudorandom function, and then propose an efficient PSI protocol without any cryptosystem. We optimize the protocol based on the permutation-based hash technique which divides a set into multisubsets to reduce the degree of the polynomial. The following advantages can be seen from the experimental result and theoretical analysis: (1) there is no cryptosystem for data hiding or encrypting and, thus, our design provides a lightweight system; (2) with set elements less than <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:msup><mml:mrow><mml:mn>2<\/mml:mn><\/mml:mrow><mml:mrow><mml:mn>12<\/mml:mn><\/mml:mrow><\/mml:msup><\/mml:math>, our protocol is highly efficient compared to the related protocols; and (3) a detailed formal proof is given in the semihonest model.<\/jats:p>","DOI":"10.1155\/2020\/8890677","type":"journal-article","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T23:34:29Z","timestamp":1599003269000},"page":"1-12","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Private Set Intersection Using Point-Value Polynomial Representation"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8189-3258","authenticated-orcid":true,"given":"Ou","family":"Ruan","sequence":"first","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Hao","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan 430068, China"}]}],"member":"311","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.3390\/biom9100575"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-014-0271-8"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1985.1057074"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/5207386"},{"first-page":"411","volume-title":"How to play any mental game or a completeness theorem for protocols with honest majority","year":"2019","key":"25"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"issue":"1","key":"38","first-page":"21","volume":"35","year":"2003","journal-title":"Algorithmica"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8890677.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8890677.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8890677.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T23:34:34Z","timestamp":1599003274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8890677\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":14,"alternative-id":["8890677","8890677"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8890677","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2020,9,1]]}}}