Privacy-preserving multi-objective evolutionary algorithms

8Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents their use for many security sensitive business optimization problems, such as our use case in collaborative supply chain management. We present a technique to construct privacy-preserving algorithms that address multi-objective problems and secure the entire algorithm including survivor selection. We improve performance over Yao's protocol for privacy-preserving algorithms and achieve solution quality only slightly inferior to the multi-objective evolutionary algorithm NSGA-II. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Funke, D., & Kerschbaum, F. (2010). Privacy-preserving multi-objective evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6239 LNCS, pp. 41–50). https://doi.org/10.1007/978-3-642-15871-1_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free