{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T21:16:38Z","timestamp":1766351798871,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["B14005"],"award-info":[{"award-number":["B14005"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"crossref","award":["NCET-11-0565"],"award-info":[{"award-number":["NCET-11-0565"]}],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2012JBZ010","K13JB00160","2014YJS038"],"award-info":[{"award-number":["2012JBZ010","K13JB00160","2014YJS038"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"US National Science Foundation","award":["CNS-1218085"],"award-info":[{"award-number":["CNS-1218085"]}]},{"name":"Amazon AWS Research"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cloud Comput."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1109\/tcc.2015.2511723","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T19:06:06Z","timestamp":1450897566000},"page":"747-759","source":"Crossref","is-referenced-by-count":22,"title":["Identity-Based Private Matching over Outsourced Encrypted Datasets"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8843-6711","authenticated-orcid":false,"given":"Shuo","family":"Qiu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1147-4327","authenticated-orcid":false,"given":"Jiqiang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yanfeng","family":"Shi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4073-0273","authenticated-orcid":false,"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5974-1589","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"73","article-title":"Public key\n encryption with conjunctive field keyword search","author":"park","year":"0","journal-title":"Proc Inf Security Appl"},{"key":"ref38","first-page":"414","article-title":"Achieving\n efficient conjunctive keyword searches over encrypted data","author":"ballard","year":"0","journal-title":"Proc Inf Commun Security"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36334-4_5"},{"key":"ref32","first-page":"119","article-title":"Probabilistic public key encryption with\n equality test","author":"yang","year":"0","journal-title":"Proc Int Conf Topics Cryptol"},{"key":"ref31","first-page":"3","article-title":"O-PSI:\n Delegated private set intersection on outsourced dataset","author":"abadi","year":"0","journal-title":"Proc ICT Syst Security Privacy Protection"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2015.38"},{"key":"ref37","first-page":"506","article-title":"Public key encyrption with keyword\n search","author":"boneh","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref36","first-page":"582","article-title":"Reuse it or lose it:\n More efficient secure computation through reuse of encrypted values","author":"mood","year":"0","journal-title":"Proc ACM Conf Comput Commun Security"},{"key":"ref35","first-page":"213","article-title":"Identity-based encryption from the weil pairing","author":"boneh","year":"0","journal-title":"Proc Crypto"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.032513.120149"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/sec.418"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9098-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2012.048080"},{"key":"ref15","first-page":"155","article-title":"Efficient protocols for set intersection and pattern matching with security against mailicious\n and covert adversaries","author":"hazay","year":"0","journal-title":"Proc Conf Theory of Cryptography"},{"key":"ref16","first-page":"577","article-title":"Efficient oblivious pseudorandom function with applications to adaptive OT and secure\n computation of set intersection","author":"jarecki","year":"0","journal-title":"Proc Theory Cryptography"},{"key":"ref17","first-page":"418","article-title":"Fast secure computation of set intersection","author":"jarecki","year":"0","journal-title":"Proc 7th Int Conf Security Cryptography Netw"},{"key":"ref18","first-page":"143","article-title":"Practical private set intersection protocols with linear computational and bandwidth complexity","author":"cristofaro","year":"0","journal-title":"Financial Cryptography and Data Security"},{"key":"ref19","article-title":"Private set\n intersection: Are garbled circuits better than custom protocols","author":"huang","year":"0","journal-title":"Proc 19th Netw Distrib Syst Secur Symp"},{"key":"ref28","first-page":"113","article-title":"Verifiable set\n operations over outsourced databases","author":"canetti","year":"0","journal-title":"Proc Public Key Cryptography"},{"key":"ref4","first-page":"114","article-title":"Efficient identity-based encryption without random oracles","author":"waters","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref27","first-page":"195","article-title":"Scaling private set intersection to\n billion-element sets","author":"kamara","year":"0","journal-title":"Financial Cryptography and Data Security"},{"key":"ref3","first-page":"41","article-title":"Short\n group signatures","author":"boneh","year":"0","journal-title":"Proc Crypto"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2014.18"},{"key":"ref5","first-page":"440","article-title":"Hierarchical identity based encryption with constant size ciphertext","author":"boneh","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0088-z"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.97"},{"key":"ref2","first-page":"1","article-title":"Efficient\n private matching and set intersection","author":"freedman","year":"0","journal-title":"Proc EUROCRYPT"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.124"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9006-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848153"},{"year":"0","key":"ref48"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756"},{"key":"ref21","first-page":"797","article-title":"Faster\n private set intersection based on OT extension","author":"pinkas","year":"0","journal-title":"Proc Usenix Security"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.282"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.98"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.215"},{"key":"ref23","first-page":"85","article-title":"Outsourced private set intersection using homomorphic encryption","author":"kerschbaum","year":"0","journal-title":"Proc 7th ACM Symp Inf Comput Commun Security"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.55"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/sec.988"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462196"},{"key":"ref25","first-page":"264","article-title":"Broker-based\n private matching","author":"shikfa","year":"0","journal-title":"Proc Privacy Enhancing Technol"}],"container-title":["IEEE Transactions on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/6245519\/8453982\/7364215-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245519\/8453982\/07364215.pdf?arnumber=7364215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:29Z","timestamp":1649444009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7364215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":48,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcc.2015.2511723","relation":{},"ISSN":["2168-7161","2372-0018"],"issn-type":[{"type":"electronic","value":"2168-7161"},{"type":"electronic","value":"2372-0018"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}