{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:17:56Z","timestamp":1766067476716,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"MIAI@Grenoble Alpes","award":["ANR-19-P3IA-0003"],"award-info":[{"award-number":["ANR-19-P3IA-0003"]}]},{"name":"EU H2020 Research and Innovation Programme","award":["952215"],"award-info":[{"award-number":["952215"]}]},{"name":"INODE","award":["863410"],"award-info":[{"award-number":["863410"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1109\/tdsc.2022.3154585","type":"journal-article","created":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T20:31:21Z","timestamp":1645821081000},"page":"1378-1389","source":"Crossref","is-referenced-by-count":5,"title":["Secure Protocols for Best Arm Identification in Federated Stochastic Multi-Armed Bandits"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9678-6615","authenticated-orcid":false,"given":"Radu","family":"Ciucanu","sequence":"first","affiliation":[{"name":"University Grenoble Alpes & LIG, Saint-Martin-d'Heres, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8557-522X","authenticated-orcid":false,"given":"Anatole","family":"Delabrouille","sequence":"additional","affiliation":[{"name":"University Bordeaux, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4459-511X","authenticated-orcid":false,"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[{"name":"University Clermont Auvergne & LIMOS, Clermont-Ferrand, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5610-8470","authenticated-orcid":false,"given":"Marta","family":"Soare","sequence":"additional","affiliation":[{"name":"University Grenoble Alpes & LIG, Saint-Martin-d'Heres, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref4","first-page":"67","article-title":"Bandit algorithms for tree search","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Coquelin","year":"2007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000038"},{"key":"ref6","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. 5th Annu. Workshop Comput. Learn. Theory","author":"Audibert","year":"2010"},{"key":"ref7","first-page":"1079","article-title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","volume":"7","author":"Even-Dar","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","first-page":"3221","article-title":"Best arm identification: A unified approach to fixed budget and fixed confidence","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Gabillon","year":"2012"},{"issue":"1:1\u20131:42","key":"ref9","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","first-page":"828","article-title":"Best-arm identification in linear bandits","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Soare","year":"2014"},{"key":"ref11","first-page":"152","volume-title":"Proc. Int. Conf. Inf. Secur. Pract. Experience","author":"Ciucanu","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom50675.2020.00038"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62576-4_13"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref18","first-page":"387","article-title":"Corrupt Bandits for Preserving Local Privacy","volume-title":"Proc. Algorithmic Learn. Theory","author":"Gajane","year":"2018"},{"key":"ref19","first-page":"1901","article-title":"Decentralized exploration in multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"F\u00e9raud","year":"2019"},{"key":"ref20","first-page":"592","article-title":"\u201c(Nearly) optimal differentially private stochastic multi-arm bandits","volume-title":"Proc. 31st Conf. Uncertainty Artif. Intell.","author":"Mishra","year":"2015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10212"},{"key":"ref22","article-title":"\u201c(Almost) Free Incentivized Exploration From Decentralized Learning Agents","volume-title":"Neural Inf. Process. Syst.","author":"Shi","year":"2021"},{"key":"ref23","article-title":"Exploiting heterogeneity in robust federated best-arm identification","volume-title":"Comput. Res. Repository","author":"Mitra","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2929409"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2787987"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646128"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8463"},{"issue":"2","key":"ref32","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1011419012209","article-title":"Eigentaste: A constant time collaborative filtering algorithm","volume":"4","author":"Goldberg","year":"2001","journal-title":"Inf. Retrieval"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10068314\/09721650.pdf?arnumber=9721650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:38:57Z","timestamp":1705534737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9721650\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":32,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2022.3154585","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2023,3,1]]}}}