Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32451
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZou, L-
dc.contributor.authorWang, Z-
dc.contributor.authorShen, B-
dc.contributor.authorDong, H-
dc.date.accessioned2025-12-04T16:52:06Z-
dc.date.available2025-12-04T16:52:06Z-
dc.date.issued2025-10-14-
dc.identifierORCiD: Lei Zou https://orcid.org/0000-0002-0409-7941-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifierORCiD: Hongli Dong https://orcid.org/0000-0001-8531-6757-
dc.identifierArticle number: 112652-
dc.identifier.citationZou, L. et al. (2026) 'Anti-eavesdropping set-membership state estimation for networked systems: An encryption–decryption scheme', Automatica, 183, 112652, pp. 1 - 12. doi: 10.1016/j.automatica.2025.112652.en_US
dc.identifier.issn0005-1098-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32451-
dc.descriptionThe material in this paper was not presented at any conference.en_US
dc.description.abstractIn this paper, the secure set-membership state estimation problem is investigated for a class of networked linear systems, where the measurement data might be intercepted by potential eavesdroppers. To protect the privacy of system state from information leakage, an artificial-noise-assisted encryptor is dedicatedly designed to transform the measurement data into the ciphertext (i.e., the encrypted data) before being transmitted, and a decryptor is then employed at the state estimator side to decrypt the received ciphertext. Under the proposed encryption–decryption mechanism, the concept of secrecy capacity is introduced to quantify the information security of the signal transmission process. A parameter-dependent state estimator is constructed to confine the estimation error into a time-varying ellipsoidal set. The desired parameters for the state estimator and the encryptor are co-designed by resorting to a set of recursions. Furthermore, sufficient conditions are derived to guarantee the ultimate boundedness of the time-varying ellipsoidal set. Finally, two simulation examples are provided to demonstrate the effectiveness of our developed secure set-membership state estimation scheme.en_US
dc.description.sponsorshipThis work was supported in part by the National Natural Science Foundation of China under Grants 62273087, 61933007, 62273088 and U21A2019, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germanyen_US
dc.format.extent1 - 12-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.rightsCreative Commons Attribution-NonCommercial-NoDerivatives 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.subjecteavesdroppingen_US
dc.subjectencryption–decryption schemeen_US
dc.subjectset-membership state estimationen_US
dc.subjectartificial-noise-assisted techniqueen_US
dc.subjectultimate boundedness analysisen_US
dc.titleAnti-eavesdropping set-membership state estimation for networked systems: An encryption–decryption schemeen_US
dc.typeArticleen_US
dc.date.dateAccepted2025-09-17-
dc.identifier.doihttps://doi.org/10.1016/j.automatica.2025.112652-
dc.relation.isPartOfAutomatica-
pubs.issueJanuary 2026-
pubs.publication-statusPublished-
pubs.volume183-
dc.identifier.eissn1873-2836-
dc.rights.licensehttps://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.en-
dcterms.dateAccepted2025-09-17-
dc.rights.holderElsevier Ltd.-
Appears in Collections:Dept of Computer Science Embargoed Research Papers

Files in This Item:
File Description SizeFormat 
FulText.pdfEmbargoed until 14 October 2026. Copyright © 2025 Elsevier Ltd. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ (see: https://www.elsevier.com/about/policies/sharing).356.78 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons