2021 13th International Conference on Advanced Computational Intelligence (ICACI) 2021
DOI: 10.1109/icaci52617.2021.9435860
|View full text |Cite
|
Sign up to set email alerts
|

A New Evolutionary Computation Framework for Privacy-Preserving Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…This particular situation gives rise to a complex and significant challenge referred to as privacy-preserving optimization. In this context, the traditional assumption of having access to the objective function no longer holds true, necessitating the development of novel approaches and techniques to address this issue [29]. Addressing privacy-preserving optimization has emerged as a new and challenging frontier in the evolutionary computation community.…”
Section: Proposed Methodology Regarding the First Research Objectivementioning
confidence: 99%
“…This particular situation gives rise to a complex and significant challenge referred to as privacy-preserving optimization. In this context, the traditional assumption of having access to the objective function no longer holds true, necessitating the development of novel approaches and techniques to address this issue [29]. Addressing privacy-preserving optimization has emerged as a new and challenging frontier in the evolutionary computation community.…”
Section: Proposed Methodology Regarding the First Research Objectivementioning
confidence: 99%
“…For the particle p n i , i D 1; 2; : : : ; s i , during the specific particle updating process, SA-MDP first calculates the modifying distance as Eq. (18).…”
Section: Evolutionmentioning
confidence: 99%
“…Compared with the general EA [18] , SA-MDP contains an extra operation: Mother particle splitting. Based on the introduced concept, the old particle can split into several new particles, it improves the diversity of the solution and the exploration ability of SA-MDP.…”
Section: Evaluation Of the Efficiencymentioning
confidence: 99%
“…However, the work [19] fails to support privacypreserving selection operations, and no practical problem is involved to evaluate its effectiveness and efficiency. Zhan et al [20] proposed a rank-based cryptographic function (RCF) to construct privacy-preserving EAs including particle swarm optimization and differential evolution. However, the authors do not the construct of RCF and their scheme suffers from some privacy concerns.…”
Section: Related Workmentioning
confidence: 99%
“…However, the authors do not the construct of RCF and their scheme suffers from some privacy concerns. Although a designer in [20] fails to obtain the fitness function, he holds possible solutions. Thus, as long as the designer learns which solution is dominant, he can obtain the approximate optimal solution, which discloses a user's privacy.…”
Section: Related Workmentioning
confidence: 99%