Ítem
Solo Metadatos
Enforcing full-stack memory-safety in cyber-physical systems
| dc.creator | Chekole E.G. | spa |
| dc.creator | Chattopadhyay S. | spa |
| dc.creator | Ochoa M. | spa |
| dc.creator | Huaqun G. | spa |
| dc.date.accessioned | 2020-05-25T23:56:48Z | |
| dc.date.available | 2020-05-25T23:56:48Z | |
| dc.date.created | 2018 | spa |
| dc.description.abstract | Memory-safety attacks are one of the most critical threats against Cyber-Physical Systems (CPS). As opposed to mainstream systems, CPS often impose stringent timing constraints. Given such timing constraints, how can we protect CPS from memory-safety attacks? In this paper, we propose a full-stack memory-safety attack detection method to address this challenge. We also quantify the notion of tolerability of memory-safety overheads (MSO) in terms of the expected real-time constraints of a typical CPS. We implemented and evaluated our proposed solution on a real-world Secure Water Treatment (SWaT) testbed. Concretely, we show that our proposed solution incurs a memory-safety overhead of 419.91Â µs, which is tolerable for the real-time constraints imposed by the SWaT system. Additionally, We also discuss how different parameters of a typical CPS will impact the execution time of the CPS computational logic and memory safety overhead. © Springer International Publishing AG, part of Springer Nature 2018. | eng |
| dc.format.mimetype | application/pdf | |
| dc.identifier.doi | https://doi.org/10.1007/978-3-319-94496-8_2 | |
| dc.identifier.uri | https://repository.urosario.edu.co/handle/10336/22524 | |
| dc.language.iso | eng | spa |
| dc.publisher | Springer Verlag | spa |
| dc.relation.citationEndPage | 26 | |
| dc.relation.citationStartPage | 9 | |
| dc.relation.citationTitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
| dc.relation.citationVolume | Vol. 10953 LNCS | |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.10953 LNCS,(2018); pp. 9-26 | spa |
| dc.relation.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049363880&doi=10.1007%2f978-3-319-94496-8_2&partnerID=40&md5=c31e7be59f7e7a9b84575267eae2567b | spa |
| dc.rights.accesRights | info:eu-repo/semantics/openAccess | |
| dc.rights.acceso | Abierto (Texto Completo) | spa |
| dc.source.instname | instname:Universidad del Rosario | spa |
| dc.source.reponame | reponame:Repositorio Institucional EdocUR | spa |
| dc.subject.keyword | Computation theory | spa |
| dc.subject.keyword | Cyber Physical System | spa |
| dc.subject.keyword | Embedded systems | spa |
| dc.subject.keyword | Logic programming | spa |
| dc.subject.keyword | Real time systems | spa |
| dc.subject.keyword | Water treatment | spa |
| dc.subject.keyword | Attack detection | spa |
| dc.subject.keyword | Computational logic | spa |
| dc.subject.keyword | Cyber-Physical System (CPS) | spa |
| dc.subject.keyword | Execution time | spa |
| dc.subject.keyword | Memory safety | spa |
| dc.subject.keyword | Real time constraints | spa |
| dc.subject.keyword | Stack memory | spa |
| dc.subject.keyword | Timing constraints | spa |
| dc.subject.keyword | Safety engineering | spa |
| dc.title | Enforcing full-stack memory-safety in cyber-physical systems | spa |
| dc.type | conferenceObject | eng |
| dc.type.hasVersion | info:eu-repo/semantics/publishedVersion | |
| dc.type.spa | Documento de conferencia | spa |



