Differential Privacy in Social Networks Using Multi-Armed Bandit

dc.contributor.authorOdeyomi, Olusola T.
dc.date.accessioned2022-03-29T14:22:52Z
dc.date.available2022-03-29T14:22:52Z
dc.date.issued2022-01-20
dc.descriptionThis work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/en_US
dc.description.abstractThere has been an exponential growth over the years in the number of users connected to social networks. This has spurred research interest in social networks to ensure the privacy of users. From a theoretical standpoint, a social network is modeled as a directed graph network and interactions among agents in the directed graph network can be analyzed with non-Bayesian learning and online learning strategies. The goal of the agents is to learn the underlying time-varying true state of the network through repeated cooperative interaction among themselves. To overcome privacy challenges in social networks, recent research works include differential privacy in the social network analysis to guarantee the privacy of shared information among the agents. However, the common online learning strategy adopted in most existing work is the stochastic multi-armed bandit approach which assumes that the loss distribution is independent and identically distributed. This does not account for the arbitrariness of the time-varying true state in the social network. Therefore, this paper proposes a tougher but realistic setting that removes the restriction on the loss distribution. Two non-stochastic multi-armed bandit algorithms are proposed. The first algorithm uses the Laplace mechanism to guarantee differential privacy against a third-party intruder. The second algorithm uses the Laplace mechanism to guarantee differential privacy against both a third-party intruder and any spying agent in the network. The simulation results show that the agents’ beliefs converge to the most dominant true state among the sequence of arbitrarily time-varying true states over the time horizon. The speed of convergence comes as a trade-off with privacy. Regret bounds are obtained for the proposed algorithms and compared to the non-private algorithm in the literatureen_US
dc.description.sponsorshipThis work was supported in part by the Petroleum Technology Development Fund in Nigeria.en_US
dc.identifier.citationO. T. Odeyomi, "Differential Privacy in Social Networks Using Multi-Armed Bandit," in IEEE Access, vol. 10, pp. 11817-11829, 2022, doi: 10.1109/ACCESS.2022.3144084.en_US
dc.identifier.issn2169-3536
dc.identifier.urihttp://doi.org/10.1109/ACCESS.2022.3144084
dc.identifier.urihttps://soar.wichita.edu/handle/10057/22768
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesIEEE Access;2022
dc.rights.holderThe authoren_US
dc.subjectNon-Bayesian learningen_US
dc.subjectdiffusion learningen_US
dc.subjectdifferential privacyen_US
dc.subjectLaplace mechanismen_US
dc.titleDifferential Privacy in Social Networks Using Multi-Armed Banditen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Differential_Privacy_in_Social_Networks_Using_Multi-Armed_Bandit.pdf
Size:
3.99 MB
Format:
Adobe Portable Document Format
Description:
Open Access PDF
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.59 KB
Format:
Item-specific license agreed upon to submission
Description: