{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:25:54Z","timestamp":1740144354442,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["EPCN-1944403","CCF-1908308"],"award-info":[{"award-number":["EPCN-1944403","CCF-1908308"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3052360","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T19:00:37Z","timestamp":1614279637000},"page":"2276-2287","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Adversarial Policies in the Multiplicative Learning System With a Malicious Expert"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2087-6136","authenticated-orcid":false,"given":"S. Rasoul","family":"Etesami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Negar","family":"Kiyavash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Leon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-131X","authenticated-orcid":false,"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761050"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2046684.2046692"},{"key":"ref13","first-page":"15","article-title":"Sybil-resilient online content voting","volume":"9","author":"tran","year":"2009","journal-title":"Proc NSDI"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/11856214_5","article-title":"Paragraph: Thwarting signature learning by training maliciously","author":"newsome","year":"2006","journal-title":"Proc Int Workshop Recent Adv Intrusion Detection"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","article-title":"The sybil attack","author":"douceur","year":"2002","journal-title":"Proceedings of the International Workshop on Peer-to-Peer Systems"},{"key":"ref16","first-page":"263","article-title":"Behavior of sequential predictors of binary sequences","author":"cover","year":"1965","journal-title":"Proc 4th Prague Conf Inf Theory Stat Decesion Fundation Random Processes"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch39"},{"key":"ref18","article-title":"Tight lower bounds for multiplicative weights algorithmic families","volume":"80","author":"gravin","year":"2017","journal-title":"LIPIcs-Leibniz International Proceedings in Informatics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59119-2_169"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.26"},{"key":"ref5","first-page":"863","article-title":"The pareto regret frontier","author":"koolen","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2718488"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2018.2806179"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5178-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref22","volume":"1","author":"bertsekas","year":"1995","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3025866"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1941-0003498-3"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/10206\/9151439\/9328196-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09328196.pdf?arnumber=9328196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:41Z","timestamp":1652194361000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9328196\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3052360","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2021]]}}}