{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:15:31Z","timestamp":1783210531590,"version":"3.54.6"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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","award":["62372285"],"award-info":[{"award-number":["62372285"]}],"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":["62572189"],"award-info":[{"award-number":["62572189"]}],"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":["62372175"],"award-info":[{"award-number":["62372175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["40500-20104-222609"],"award-info":[{"award-number":["40500-20104-222609"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission","doi-asserted-by":"publisher","award":["25SG49"],"award-info":[{"award-number":["25SG49"]}],"id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003024","name":"Shanghai Education Development Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016096","name":"Shanghai Key Basic Research Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016096","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,7]]},"DOI":"10.1016\/j.jisa.2026.104501","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:49:46Z","timestamp":1778820586000},"page":"104501","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Laconic attribute-based PSI on authenticated inputs and applications"],"prefix":"10.1016","volume":"100","author":[{"given":"Zhe","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9728-4051","authenticated-orcid":false,"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2281-4112","authenticated-orcid":false,"given":"Junqing","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jisa.2026.104501_bib0001","series-title":"USENIX security 2021","first-page":"3577","article-title":"PrivateDrop: practical privacy-preserving authentication for apple AirDrop","author":"Heinrich","year":"2021"},{"key":"10.1016\/j.jisa.2026.104501_bib0002","series-title":"USENIX security 2010","first-page":"95","article-title":"BotGrep: finding P2P bots with structured graph analysis","author":"Nagaraja","year":"2010"},{"key":"10.1016\/j.jisa.2026.104501_bib0003","series-title":"NDSS 2011","article-title":"Location privacy via private proximity testing","author":"Narayanan","year":"2011"},{"key":"10.1016\/j.jisa.2026.104501_bib0004","series-title":"ACM CCS 2011","first-page":"691","article-title":"Countering GATTACA: efficient and secure testing of fully-sequenced human genomes","author":"Baldi","year":"2011"},{"key":"10.1016\/j.jisa.2026.104501_bib0005","series-title":"ASIACRYPT 2020, part III","first-page":"870","article-title":"Catalic: delegated PSI cardinality with applications to contact tracing","author":"Duong","year":"2020"},{"issue":"1","key":"10.1016\/j.jisa.2026.104501_bib0006","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/TCC.2024.3360098","article-title":"Efficient verifiable cloud-assisted psi cardinality for privacy-preserving contact tracing","volume":"12","author":"Chen","year":"2024","journal-title":"IEEE Trans Cloud Comput"},{"key":"10.1016\/j.jisa.2026.104501_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.sysarc.2024.103307","article-title":"Non-interactive set intersection for privacy-preserving contact tracing","volume":"158","author":"Wu","year":"2025","journal-title":"J Syst Archit"},{"key":"10.1016\/j.jisa.2026.104501_bib0008","series-title":"EUROCRYPT 2021, part II","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.104501_bib0009","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.104501_bib0010","series-title":"EUROCRYPT 2004","first-page":"1","article-title":"Efficient private matching and set intersection","author":"Freedman","year":"2004"},{"key":"10.1016\/j.jisa.2026.104501_bib0011","series-title":"ACM CCS 2018","first-page":"1223","article-title":"Labeled PSI from fully homomorphic encryption with malicious security","author":"Chen","year":"2018"},{"key":"10.1016\/j.jisa.2026.104501_bib0012","series-title":"EUROCRYPT 2019, part III","first-page":"122","article-title":"Efficient circuit-based PSI with linear communication","author":"Pinkas","year":"2019"},{"key":"10.1016\/j.jisa.2026.104501_bib0013","series-title":"International conference on financial cryptography and data security","first-page":"108","article-title":"Private intersection of certified sets","author":"Camenisch","year":"2009"},{"key":"10.1016\/j.jisa.2026.104501_bib0014","series-title":"International conference on financial cryptography and data security","first-page":"143","article-title":"Practical private set intersection protocols with linear complexity","author":"De Cristofaro","year":"2010"},{"key":"10.1016\/j.jisa.2026.104501_bib0015","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.104501_bib0016","article-title":"Re-visiting authorized private set intersection: a new privacy-preserving variant and two protocols","author":"Falzon","year":"2025","journal-title":"Proc Priv Enhanc Technol"},{"key":"10.1016\/j.jisa.2026.104501_bib0017","series-title":"30th USENIX security symposium (USENIX security 21)","first-page":"893","article-title":"Identifying harmful media in {end-to-end} encrypted communication: efficient private membership computation","author":"Kulshrestha","year":"2021"},{"key":"10.1016\/j.jisa.2026.104501_bib0018","series-title":"EUROCRYPT 2023, part II","first-page":"594","article-title":"Privacy-preserving blueprints","author":"Kohlweiss","year":"2023"},{"key":"10.1016\/j.jisa.2026.104501_bib0019","series-title":"EUROCRYPT 2023, part V","first-page":"35","article-title":"End-to-end secure messaging with traceability only for illegal content","author":"Bartusek","year":"2023"},{"key":"10.1016\/j.jisa.2026.104501_bib0020","series-title":"International conference on the theory and application of cryptology and information security","first-page":"262","article-title":"Laconic PSI on authenticated inputs and applications","author":"Bartusek","year":"2025"},{"key":"10.1016\/j.jisa.2026.104501_bib0021","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ins.2020.05.041","article-title":"Attribute-based fine-grained access control for outscored private set intersection computation","volume":"536","author":"Ali","year":"2020","journal-title":"Inf Sci"},{"key":"10.1016\/j.jisa.2026.104501_bib0022","series-title":"2024\u202fIEEE 23rd international conference on trust, security and privacy in computing and communications (trustcom)","first-page":"2098","article-title":"Efficient multi-subset fine-grained authorization PSI over outsourced encrypted datasets","author":"Zheng","year":"2024"},{"key":"10.1016\/j.jisa.2026.104501_bib0023","doi-asserted-by":"crossref","first-page":"4050","DOI":"10.1109\/TIFS.2021.3101059","article-title":"Private set intersection with authorization over outsourced encrypted datasets","volume":"16","author":"Wang","year":"2021","journal-title":"IEEE Trans Inf Forens Secur"},{"key":"10.1016\/j.jisa.2026.104501_bib0024","series-title":"EUROCRYPT 2008","first-page":"415","article-title":"Efficient non-interactive proof systems for bilinear groups","author":"Groth","year":"2008"},{"key":"10.1016\/j.jisa.2026.104501_bib0025","article-title":"Laconic updatable private set intersection","volume":"89","author":"Kong","year":"2025","journal-title":"J Inf Secur Appl"},{"key":"10.1016\/j.jisa.2026.104501_bib0026","series-title":"ACM CCS 2021","first-page":"1166","article-title":"Compact and malicious private set intersection for small sets","author":"Rosulek","year":"2021"},{"key":"10.1016\/j.jisa.2026.104501_bib0027","article-title":"Malicious secure lightweight private set intersection","volume":"97","author":"Lyu","year":"2026","journal-title":"J Inf Secur Appl"},{"key":"10.1016\/j.jisa.2026.104501_bib0028","article-title":"Bandwidth efficient partial authorized PSI","author":"Koster","year":"2025","journal-title":"Cryptol ePrint Arch"},{"key":"10.1016\/j.jisa.2026.104501_bib0029","series-title":"TCC 2021, part III","first-page":"94","article-title":"Laconic private set intersection and applications","author":"Alamati","year":"2021"},{"issue":"1","key":"10.1016\/j.jisa.2026.104501_bib0030","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TCC.2024.3361882","article-title":"Cloud-assisted laconic private set intersection cardinality","volume":"12","author":"Wu","year":"2024","journal-title":"IEEE Trans Cloud Comput"},{"key":"10.1016\/j.jisa.2026.104501_bib0031","series-title":"CRYPTO 2018, part II","first-page":"33","article-title":"The algebraic group model and its applications","author":"Fuchsbauer","year":"2018"},{"key":"10.1016\/j.jisa.2026.104501_bib0032","series-title":"PKC 2011","first-page":"53","article-title":"Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization","author":"Waters","year":"2011"},{"key":"10.1016\/j.jisa.2026.104501_bib0033","series-title":"ASIACRYPT 2022, part IV","first-page":"159","article-title":"Additive-homomorphic functional commitments and applications to homomorphic signatures","author":"Catalano","year":"2022"},{"key":"10.1016\/j.jisa.2026.104501_bib0034","series-title":"ACM CCS 2020","first-page":"2007","article-title":"Pointproofs: aggregating proofs for multiple vector commitments","author":"Gorbunov","year":"2020"},{"key":"10.1016\/j.jisa.2026.104501_bib0035","series-title":"[1993] Proceedings of the eigth annual structure in complexity theory conference","first-page":"102","article-title":"On span programs","author":"Karchmer","year":"1993"},{"key":"10.1016\/j.jisa.2026.104501_bib0036","series-title":"IACR International conference on public-key cryptography","first-page":"132","article-title":"Witness encryption for succinct functional commitments and applications","author":"Campanelli","year":"2024"}],"container-title":["Journal of Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T23:22:18Z","timestamp":1783207338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2214212626001316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":36,"alternative-id":["S2214212626001316"],"URL":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104501","relation":{},"ISSN":["2214-2126"],"issn-type":[{"value":"2214-2126","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Laconic attribute-based PSI on authenticated inputs and applications","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.104501","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":"104501"}}