Peter Ligeti

2papers

2 Papers

AIOct 15, 2022
A Secure Federated Data-Driven Evolutionary Multi-objective Optimization Algorithm

Qiqi Liu, Yuping Yan, Peter Ligeti et al.

Data-driven evolutionary algorithms usually aim to exploit the information behind a limited amount of data to perform optimization, which have proved to be successful in solving many complex real-world optimization problems. However, most data-driven evolutionary algorithms are centralized, causing privacy and security concerns. Existing federated Bayesian algorithms and data-driven evolutionary algorithms mainly protect the raw data on each client. To address this issue, this paper proposes a secure federated data-driven evolutionary multi-objective optimization algorithm to protect both the raw data and the newly infilled solutions obtained by optimizing the acquisition function conducted on the server. We select the query points on a randomly selected client at each round of surrogate update by calculating the acquisition function values of the unobserved points on this client, thereby reducing the risk of leaking the information about the solution to be sampled. In addition, since the predicted objective values of each client may contain sensitive information, we mask the objective values with Diffie-Hellmann-based noise, and then send only the masked objective values of other clients to the selected client via the server. Since the calculation of the acquisition function also requires both the predicted objective value and the uncertainty of the prediction, the predicted mean objective and uncertainty are normalized to reduce the influence of noise. Experimental results on a set of widely used multi-objective optimization benchmarks show that the proposed algorithm can protect privacy and enhance security with only negligible sacrifice in the performance of federated data-driven evolutionary optimization.

CRJun 27, 2019
Smallest graphs achieving the Stinson bound

Mate Gyarmati, Peter Ligeti

Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the unqualified subsets cannot determine anything about the secret. The most important property is the efficiency of the system, which is measured by the information ratio. It can be shown that for graphs the information ratio is at most $(δ+1)/2$ where $δ$ is the maximal degree of the graph. Blundo et al. constructed a family of $δ$-regular graphs with information ratio $(δ+1)/2$ on at least $c\cdot 6^δ$ vertices. We improve this result by constructing a significantly smaller graph family on $c\cdot 2^δ$ vertices achieving the same upper bound both in the worst and the average case.