{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T04:27:20Z","timestamp":1786595240245,"version":"build-2736575974"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Security and Applications"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jisa.2026.104567","type":"journal-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T03:28:45Z","timestamp":1783740525000},"page":"104567","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Using private data with freedom: A cloud-assisted ID-Private data join protocol for privacy-preserving machine learning over distributed data"],"prefix":"10.1016","volume":"102","author":[{"given":"Xu","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Lian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jialin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xianghong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinling","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jisa.2026.104567_bib0001","series-title":"2017 IEEE symposium on security and privacy (SP)","first-page":"19","article-title":"Secureml: a system for scalable privacy-preserving machine learning","author":"Mohassel","year":"2017"},{"key":"10.1016\/j.jisa.2026.104567_bib0002","first-page":"4961","article-title":"Crypten: secure multi-party computation meets machine learning","volume":"34","author":"Knott","year":"2021","journal-title":"Adv Neural Inform Process Syst"},{"key":"10.1016\/j.jisa.2026.104567_bib0003","series-title":"International conference on the theory and applications of cryptographic techniques","first-page":"1","article-title":"Efficient private matching and set intersection","author":"Freedman","year":"2004"},{"issue":"2","key":"10.1016\/j.jisa.2026.104567_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","article-title":"Scalable private set intersection based on OT extension","volume":"21","author":"Pinkas","year":"2018","journal-title":"ACM Trans Priv Secur (TOPS)"},{"key":"10.1016\/j.jisa.2026.104567_bib0005","series-title":"Annual international conference on the theory and applications of cryptographic techniques","first-page":"901","article-title":"Vole-psi: fast oprf and circuit-psi from vector-ole","author":"Rindal","year":"2021"},{"key":"10.1016\/j.jisa.2026.104567_bib0006","article-title":"iprivjoin: an ID-private data join framework for privacy-preserving machine learning","author":"Liu","year":"2023","journal-title":"IEEE Trans Inform Forens Secur"},{"key":"10.1016\/j.jisa.2026.104567_bib0007","series-title":"Proceedings of the 34th USENIX security symposium (USENIX security 2025)","article-title":"Suda: an efficient and secure unbalanced data alignment framework for vertical privacy-preserving machine learning","author":"Song","year":"2025"},{"key":"10.1016\/j.jisa.2026.104567_bib0008","doi-asserted-by":"crossref","first-page":"2706","DOI":"10.1109\/TIFS.2025.3542244","article-title":"Peafowl: private entity alignment in multi-party privacy-preserving machine learning","volume":"20","author":"Gao","year":"2025","journal-title":"IEEE Trans Inform Forens Secur"},{"key":"10.1016\/j.jisa.2026.104567_bib0009","unstructured":"Chen S., Lin G., Niu H., Song L., Hong C., Han W.. Idcloak: a practical secure multi-party dataset join framework for vertical privacy-preserving machine learning. 2025. arXiv: 2506.01072."},{"key":"10.1016\/j.jisa.2026.104567_bib0010","series-title":"Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining","first-page":"2652","article-title":"When homomorphic encryption marries secret sharing: secure large-scale sparse logistic regression and applications in risk control","author":"Chen","year":"2021"},{"issue":"2","key":"10.1016\/j.jisa.2026.104567_bib0011","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/972639.972643","article-title":"Number-theoretic constructions of efficient pseudo-random functions","volume":"51","author":"Naor","year":"2004","journal-title":"Journal of the ACM (JACM)"},{"key":"10.1016\/j.jisa.2026.104567_bib0012","series-title":"24th USENIX security symposium (USENIX security 15)","first-page":"547","article-title":"The pythia {PRF} service","author":"Everspaugh","year":"2015"},{"key":"10.1016\/j.jisa.2026.104567_bib0013","series-title":"1986 IEEE symposium on security and privacy","first-page":"134","article-title":"A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party","author":"Meadows","year":"1986"},{"key":"10.1016\/j.jisa.2026.104567_bib0014","series-title":"Theory of cryptography conference","first-page":"303","article-title":"Keyword search and oblivious pseudorandom functions","author":"Freedman","year":"2005"},{"key":"10.1016\/j.jisa.2026.104567_bib0015","series-title":"Annual international cryptology conference","first-page":"145","article-title":"Extending oblivious transfers efficiently","author":"Ishai","year":"2003"},{"key":"10.1016\/j.jisa.2026.104567_bib0016","series-title":"Proceedings of the 2016 ACM SIGSAC conference on computer and communications security","first-page":"818","article-title":"Efficient batched oblivious PRF with applications to private set intersection","author":"Kolesnikov","year":"2016"},{"key":"10.1016\/j.jisa.2026.104567_bib0017","series-title":"Proceedings of the 2013 ACM SIGSAC conference on computer & communications security","first-page":"789","article-title":"When private set intersection meets big data: an efficient and scalable protocol","author":"Dong","year":"2013"},{"key":"10.1016\/j.jisa.2026.104567_bib0018","series-title":"Annual international conference on the theory and applications of cryptographic techniques","first-page":"739","article-title":"Psi from paxos: fast, malicious private set intersection","author":"Pinkas","year":"2020"},{"key":"10.1016\/j.jisa.2026.104567_bib0019","series-title":"32nd USENIX security symposium (USENIX security 23)","first-page":"337","article-title":"Linear private set union from {Multi-Query} reverse private membership test","author":"Zhang","year":"2023"},{"key":"10.1016\/j.jisa.2026.104567_bib0020","unstructured":"Dong M., Chen Y., Zhang C., Bai Y.. Breaking free: efficient multi-party private set union without non-collusion assumptions. 2024; arXiv: 240607011."},{"key":"10.1016\/j.jisa.2026.104567_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.sysarc.2025.103581","article-title":"Efficient two-party private set union and circuit-based version for large-scale data set based on novel oblivious filter","volume":"168","author":"Xu","year":"2025","journal-title":"J Syst Arch"},{"key":"10.1016\/j.jisa.2026.104567_bib0022","doi-asserted-by":"crossref","unstructured":"Kissner L., Song D.. Privacy-preserving set operations. In: Shoup V., editor. Advances in cryptology \u2013 CRYPTO 2005. Berlin, Heidelberg: Springer. 2005, pp. 241\u2013257.","DOI":"10.1007\/11535218_15"},{"key":"10.1016\/j.jisa.2026.104567_bib0023","series-title":"Public-key cryptography \u2013 PKC 2017","first-page":"175","article-title":"Scalable multi-party private set-intersection","author":"Hazay","year":"2017"},{"key":"10.1016\/j.jisa.2026.104567_bib0024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIFS.2021.3118879","article-title":"Practical multi-party private set intersection protocols","volume":"17","author":"Bay","year":"2021","journal-title":"IEEE Trans Inform Forens Secur"},{"key":"10.1016\/j.jisa.2026.104567_bib0025","series-title":"NDSS","article-title":"Private set intersection: are garbled circuits better than custom protocols?","author":"Huang","year":"2012"},{"key":"10.1016\/j.jisa.2026.104567_bib0026","series-title":"27th Annual symposium on foundations of computer science (Sfcs 1986)","first-page":"162","article-title":"How to generate and exchange secrets","author":"Yao","year":"1986"},{"key":"10.1016\/j.jisa.2026.104567_bib0027","series-title":"Annual international conference on the theory and applications of cryptographic techniques","first-page":"125","article-title":"Efficient circuit-based PSI via cuckoo hashing","author":"Pinkas","year":"2018"},{"key":"10.1016\/j.jisa.2026.104567_bib0028","article-title":"Circuit-PSI with linear complexity via relaxed batch OPPRF","author":"Chandran","year":"2022","journal-title":"Proc Priv Enhanc Technol"},{"key":"10.1016\/j.jisa.2026.104567_bib0029","series-title":"Advances in cryptology\u2013EUROCRYPT 2019: 38th Annual international conference on the theory and applications of cryptographic techniques, Darmstadt, Germany, May 19\u201323, 2019, proceedings, Part III 38","first-page":"122","article-title":"Efficient circuit-based PSI with linear communication","author":"Pinkas","year":"2019"},{"key":"10.1016\/j.jisa.2026.104567_bib0030","series-title":"International conference on cryptology and network security","first-page":"218","article-title":"Fast and private computation of cardinality of set intersection and union","author":"De Cristofaro","year":"2012"},{"key":"10.1016\/j.jisa.2026.104567_bib0031","series-title":"2020 IEEE European symposium on security and privacy (EuroS&P)","first-page":"370","article-title":"On deploying secure computing: private intersection-sum-with-cardinality","author":"Ion","year":"2020"},{"key":"10.1016\/j.jisa.2026.104567_bib0032","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.future.2019.09.022","article-title":"Unbalanced private set intersection cardinality protocol with low communication cost","volume":"102","author":"Lv","year":"2020","journal-title":"Futur Gen Comput Syst"},{"key":"10.1016\/j.jisa.2026.104567_bib0033","series-title":"International conference on information security","first-page":"209","article-title":"Secure and efficient private set intersection cardinality using bloom filter","author":"Debnath","year":"2015"},{"key":"10.1016\/j.jisa.2026.104567_bib0034","series-title":"Proceedings of the 2024 16th international conference on machine learning and computing","first-page":"65","article-title":"Break two PSI-CA protocols in polynomial time","author":"Tan","year":"2024"},{"key":"10.1016\/j.jisa.2026.104567_bib0035","series-title":"Proceedings of the 2018 ACM SIGSAC conference on computer and communications security","first-page":"35","article-title":"Aby3: a mixed protocol framework for machine learning","author":"Mohassel","year":"2018"},{"key":"10.1016\/j.jisa.2026.104567_bib0036","unstructured":"Hunt T., Song C., Shokri R., Shmatikov V., Witchel E.. Chiron: privacy-preserving machine learning as a service. 2018; arXiv: 180305961."},{"key":"10.1016\/j.jisa.2026.104567_bib0037","unstructured":"Tramer F., Boneh D.. Slalom: fast, verifiable and private execution of neural networks in trusted hardware. 2018; arXiv: 180603287."},{"key":"10.1016\/j.jisa.2026.104567_bib0038","unstructured":"Narra K.G., Lin Z., Wang Y., Balasubramaniam K., Annavaram M.. Privacy-preserving inference in machine learning services using trusted execution environments. 2019; arXiv: 191203485."},{"key":"10.1016\/j.jisa.2026.104567_bib0039","series-title":"2023 IEEE 8th European symposium on security and privacy (EuroS&P)","first-page":"73","article-title":"Chex-mix: combining homomorphic encryption with trusted execution environments for oblivious inference in the cloud","author":"Natarajan","year":"2023"},{"key":"10.1016\/j.jisa.2026.104567_bib0040","series-title":"European symposium on research in computer security","first-page":"182","article-title":"Confidential and verifiable machine learning delegations on the cloud","author":"Wu","year":"2024"},{"key":"10.1016\/j.jisa.2026.104567_bib0041","series-title":"Theory of cryptography","first-page":"182","article-title":"Correlated-input secure hash functions","author":"Goyal","year":"2011"},{"issue":"11","key":"10.1016\/j.jisa.2026.104567_bib0042","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun ACM"},{"issue":"7","key":"10.1016\/j.jisa.2026.104567_bib0043","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Communications ACM"},{"key":"10.1016\/j.jisa.2026.104567_bib0044","series-title":"International conference on the theory and applications of cryptographic techniques","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"Paillier","year":"1999"},{"key":"10.1016\/j.jisa.2026.104567_bib0045","article-title":"Encryption performance improvements of the paillier cryptosystem","author":"Jost","year":"2015","journal-title":"Cryptol ePrint Arch"},{"issue":"4","key":"10.1016\/j.jisa.2026.104567_bib0046","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"Elgamal","year":"1985","journal-title":"IEEE Trans Inf Theory"},{"key":"10.1016\/j.jisa.2026.104567_bib0047","doi-asserted-by":"crossref","DOI":"10.1109\/TIFS.2023.3295941","article-title":"Jedi: joint and effective privacy preserving outsourced set intersection and data integration protocols","author":"Chen","year":"2023","journal-title":"IEEE Trans Inform Forens Secur"},{"key":"10.1016\/j.jisa.2026.104567_bib0048","series-title":"Public key cryptography","first-page":"119","article-title":"A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system","author":"Damg\u00e5rd","year":"2001"}],"container-title":["Journal of Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T03:34:20Z","timestamp":1786592060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2214212626001973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":48,"alternative-id":["S2214212626001973"],"URL":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104567","relation":{},"ISSN":["2214-2126"],"issn-type":[{"value":"2214-2126","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Using private data with freedom: A cloud-assisted ID-Private data join protocol for privacy-preserving machine learning over distributed data","name":"articletitle","label":"Article Title"},{"value":"Journal of Information Security and Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104567","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104567"}}