Camilla Fioravanti, G. Oliva, S. Panzieri, C. Hadjicostis
{"title":"Private Consensus using Chaotic Oscillator-Based Encryption","authors":"Camilla Fioravanti, G. Oliva, S. Panzieri, C. Hadjicostis","doi":"10.1109/MED54222.2022.9837163","DOIUrl":null,"url":null,"abstract":"Distributed average consensus is a fundamental feature of multi-agents systems; yet, in several cases agents are reluctant to disclose their initial conditions, e.g., due to their sensitivity about private data. Consequently, ensuring the privacy of such information against honest but curious neighbors becomes a mandatory necessity. In this paper we propose to implement a privacy-preserving consensus strategy that exploits, for this purpose, unpredictable chaotic phenomena, such as the trend of variables in a Chua oscillator. The initial conditions are then split into two fragments, one of which always remains hidden in the node, while the other is exchanged after undergoing oscillator-dependent manipulation, adding an extra layer of security to what is exchanged over the network. In this way, the combination of the two fragments converges to the average of the true initial conditions of each node. The paper is complemented by a simulation campaign aimed at numerically demonstrating the effectiveness of the proposed approach.","PeriodicalId":354557,"journal":{"name":"2022 30th Mediterranean Conference on Control and Automation (MED)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 30th Mediterranean Conference on Control and Automation (MED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED54222.2022.9837163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Distributed average consensus is a fundamental feature of multi-agents systems; yet, in several cases agents are reluctant to disclose their initial conditions, e.g., due to their sensitivity about private data. Consequently, ensuring the privacy of such information against honest but curious neighbors becomes a mandatory necessity. In this paper we propose to implement a privacy-preserving consensus strategy that exploits, for this purpose, unpredictable chaotic phenomena, such as the trend of variables in a Chua oscillator. The initial conditions are then split into two fragments, one of which always remains hidden in the node, while the other is exchanged after undergoing oscillator-dependent manipulation, adding an extra layer of security to what is exchanged over the network. In this way, the combination of the two fragments converges to the average of the true initial conditions of each node. The paper is complemented by a simulation campaign aimed at numerically demonstrating the effectiveness of the proposed approach.