HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection

Abstract : We propose a method for applying genetic algorithms to confidential data. Genetic algorithms are a well-known tool for finding approximate solutions to various optimization and searching problems. More specifically, we present a secure solution for solving the subset cover problem which is formulated by a binary integer linear programming (BIP) problem (i.e. a linear programming problem, where the solution is expected to be a 0-1 vector). Our solution is based on secure multi-party computation. We give a privacy definition inspired from semantic security definitions and show how a secure computation system based on secret sharing satisfies this definition. Our solution also achieves security against timing attacks, as the execution of the secure algorithm on two different inputs is indistinguishable to the observer. We implement and benchmark our solution on the SHAREMIND secure computation system. Performance tests show that our privacy-preserving implementation achieves a 99.32% precision within 6.5 seconds on a BIP problem of moderate size. As an application of our algorithm, we consider the problem of securely outsourcing risk assessment of an end user computer environment.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01400929
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 22, 2016 - 4:23:15 PM
Last modification on : Friday, September 25, 2020 - 3:50:04 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:00:19 PM

File

978-3-662-43826-8_8_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dan Bogdanov, Keita Emura, Roman Jagomägis, Akira Kanaoka, Shin’ichiro Matsuo, et al.. A Secure Genetic Algorithm for the Subset Cover Problem and Its Application to Privacy Protection. 8th IFIP International Workshop on Information Security Theory and Practice (WISTP), Jun 2014, Heraklion, Crete, Greece. pp.108-123, ⟨10.1007/978-3-662-43826-8_8⟩. ⟨hal-01400929⟩

Share

Metrics

Record views

339

Files downloads

96