{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T05:01:13Z","timestamp":1785474073301,"version":"3.56.0"},"reference-count":62,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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-037"}],"funder":[{"name":"Horizon Europe"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1109\/eurosp68448.2026.00020","type":"proceedings-article","created":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T19:07:02Z","timestamp":1785438422000},"page":"138-159","source":"Crossref","is-referenced-by-count":0,"title":["Bandwidth Efficient Partial Authorized PSI"],"prefix":"10.1109","author":[{"given":"Tjitske","family":"Koster","sequence":"first","affiliation":[{"name":"TU Delft","place":["Delft, The Netherlands"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesca","family":"Falzon","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich","place":["Z\u00fcrich, Switzerland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evangelia Anna","family":"Markatou","sequence":"additional","affiliation":[{"name":"TU Delft","place":["Delft, The Netherlands"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/bibm.2018.8621291"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2013.032513.120149"},{"key":"ref4","first-page":"7","article-title":"Botgrep: Finding p2p bots with structured graph analysis","volume-title":"Proceedings of the 19th USENIX Conference on Security","author":"Nagaraja"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-50594-2_23"},{"key":"ref7","first-page":"1447","article-title":"Mobile private contact discovery at scale","volume-title":"28th USENIX Security Symposium, USENIX Security 2019, Santa Clara, CA, USA, August 14-16, 2019","author":"Kales"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/eurosp48549.2020.00031"},{"key":"ref9","first-page":"738","article-title":"Private intersection-sum protocol with applications to attributing aggregate ad conversions","volume-title":"IACR Cryptol. ePrint Arch.","author":"Ion","year":"2017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92075-3_21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/sp.1986.10022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"ref14","first-page":"34","article-title":"Private set intersection in the internet setting from lightweight oblivious prf","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part III","author":"Chase"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref16","article-title":"Learning from functionality outputs: Private join and compute in the real world","volume-title":"34th USENIX Security Symposium, USENIX Security 2025, Seattle, WA, USA, August 13-15, 2025","author":"Falzon"},{"key":"ref17","first-page":"1487","article-title":"Birds of a feather flock together: How set bias helps to deanonymize you via revealed intersection sizes","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Guo"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2024.241279","article-title":"Anonpsi: An anonymity assessment framework for PSI","volume-title":"31st Annual Network and Distributed System Security Symposium, NDSS 2024, San Diego, California, USA, February 26 - March 1, 2024","author":"Jiang"},{"key":"ref19","volume-title":"On the insecurity of bloom filter-based private set intersections","author":"Vos","year":"2024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_10"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2025-0041"},{"key":"ref23","volume-title":"General data protection regulation (GDPR)","year":"2016"},{"key":"ref24","volume-title":"Applying data minimzation to consumer requests","year":"2024"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1182\/blood-2018-11-833954"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3517385"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2808138.2808149"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_25"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2523649.2523668"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31410-0_23"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690349"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2023.23563"},{"key":"ref37","volume-title":"PICS: Private intersection over committed (and reusable) sets","author":"Goel","year":"2025"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2025.111844"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0054851"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417244"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"ref44","volume-title":"Verkle trees","author":"Kuszmaul","year":"2019"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007447"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214069"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_16"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_15"},{"key":"ref50","volume-title":"27 google ads benchmarks (2025), Average Google Shopping CPC - Clothing & Apparel and Average Google Search Ads Cost Per Click - Legal","author":"Moons"},{"key":"ref51","article-title":"What is the average lawyer retainer fee?","volume-title":"Bankruptcy","author":"Brock"},{"key":"ref52","volume-title":"Faker"},{"key":"ref53","volume-title":"Rs_merkle","author":"Suprunchuk"},{"key":"ref54","volume-title":"Pointproofs vector commitment parameter generation"},{"key":"ref55","volume-title":"Re-visiting authorized private set intersection: A new privacy-preserving variant and two protocols","author":"Falzon","year":"2025"},{"key":"ref56","volume-title":"Compute engine pricing"},{"key":"ref57","volume-title":"Machine families resource and comparison guide"},{"key":"ref58","volume-title":"All networking pricing"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref60","volume-title":"Pcs multiproofs using random evaluation","author":"Feist","year":"2021"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"ref62","volume-title":"Kzg-commitment"}],"event":{"name":"2026 IEEE 11th European Symposium on Security and Privacy (EuroS&P)","location":"Lisbon, Portugal","start":{"date-parts":[[2026,7,6]]},"end":{"date-parts":[[2026,7,10]]}},"container-title":["2026 IEEE 11th European Symposium on Security and Privacy (EuroS&P)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11624144\/11623655\/11624278.pdf?arnumber=11624278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T04:53:31Z","timestamp":1785473611000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11624278\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/eurosp68448.2026.00020","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]}}}