Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ciucanu, Radua; * | Lafourcade, Pascalb | Lombard-Platet, Mariusc | Soare, Martaa
Affiliations: [a] Université Grenoble Alpes, LIG, France. E-mails: radu.ciucanu@univ-grenoble-alpes.fr, marta.soare@univ-grenoble-alpes.fr | [b] Université Clermont Auvergne, LIMOS, France. E-mail: pascal.lafourcade@uca.fr | [c] Université PSL, DIENS, Be-Studys, France. E-mail: marius.lombard-platet@ens.fr
Correspondence: [*] Corresponding author. E-mail: radu.ciucanu@univ-grenoble-alpes.fr.
Abstract: We consider the problem of cumulative reward maximization in multi-armed bandits. We address the security concerns that occur when data and computations are outsourced to an honest-but-curious cloud i.e., that executes tasks dutifully, but tries to gain as much information as possible. We consider situations where data used in bandit algorithms is sensitive and has to be protected e.g., commercial or personal data. We rely on cryptographic schemes and propose UCB-MS, a secure multi-party protocol based on the UCB algorithm. We prove that UCB-MS computes the same cumulative reward as UCB while satisfying desirable security properties. In particular, cloud nodes cannot learn the cumulative reward or the sum of rewards for more than one arm. Moreover, by analyzing messages exchanged among cloud nodes, an external observer cannot learn the cumulative reward or the sum of rewards produced by some arm. We show that the overhead due to cryptographic primitives is linear in the size of the input. Our implementation confirms the linear-time behavior and the practical feasibility of our protocol, on both synthetic and real-world data.
Keywords: Security in machine learning, cumulative reward maximization, honest-but-curious cloud, UCB algorithm, AES-GCM symmetric encryption scheme, Paillier’s additive homomorphic asymmetric encryption scheme
DOI: 10.3233/JCS-210051
Journal: Journal of Computer Security, vol. 31, no. 1, pp. 1-27, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl