Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/26612
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZou, L-
dc.contributor.authorWang, Z-
dc.contributor.authorShen, B-
dc.contributor.authorDong, H-
dc.contributor.authorLu, G-
dc.date.accessioned2023-06-07T10:55:26Z-
dc.date.available2023-06-07T10:55:26Z-
dc.date.issued2023-03-28-
dc.identifierORCID iDs: Lei Zou 0000-0002-0409-7941; Zidong Wang https://orcid.org/0000-0002-9576-7401.-
dc.identifier.citationZou, L. et al. (2023) 'Encrypted Finite-Horizon Energy-to-Peak State Estimation for Time-Varying Systems Under Eavesdropping Attacks: Tackling Secrecy Capacity', IEEE/CAA Journal of Automatica Sinica, 10 (4), pp. 985 - 996. doi: 10.1109/JAS.2023.123393.en_US
dc.identifier.issn2329-9266-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/26612-
dc.description.abstractThis paper is concerned with the problem of finite-horizon energy-to-peak state estimation for a class of networked linear time-varying systems. Due to the inherent vulnerability of network-based communication, the measurement signals transmitted over a communication network might be intercepted by potential eavesdroppers. To avoid information leakage, by resorting to an artificial-noise-assisted method, we develop a novel encryption-decryption scheme to ensure that the transmitted signal is composed of the raw measurement and an artificial-noise term. A special evaluation index named secrecy capacity is employed to assess the information security of signal transmissions under the developed encryption-decryption scheme. The purpose of the addressed problem is to design an encryption-decryption scheme and a state estimator such that: 1) the desired secrecy capacity is ensured; and 2) the required finite-horizon $l_{2}-l_{\infty}$ performance is achieved. Sufficient conditions are established on the existence of the encryption-decryption mechanism and the finite-horizon state estimator. Finally, simulation results are proposed to show the effectiveness of our proposed encryption-decryption-based state estimation scheme.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62273087,61933007,62273088,U21A2019,62073180).en_US
dc.format.extent985 - 996-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCopyright © 2023 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works by sending a request to pubs-permissions@ieee.org. For more information, see https://www.ieee.org/publications/rights/rights-policies.html-
dc.rights.urihttps://www.ieee.org/publications/rights/rights-policies.html-
dc.subjecteavesdroppingen_US
dc.subjectencryption-decryption schemeen_US
dc.subjectenergy-to-peak state estimationen_US
dc.subjectartificial-noise-assisted techniqueen_US
dc.subjectfinite-horizon state estimationen_US
dc.titleEncrypted Finite-Horizon Energy-to-Peak State Estimation for Time-Varying Systems Under Eavesdropping Attacks: Tackling Secrecy Capacityen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/JAS.2023.123393-
dc.relation.isPartOfIEEE/CAA Journal of Automatica Sinica-
pubs.issue4-
pubs.publication-statusPublished-
pubs.volume10-
dc.identifier.eissn2329-9274-
dc.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2023 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works by sending a request to pubs-permissions@ieee.org. For more information, see https://www.ieee.org/publications/rights/rights-policies.html1.12 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.