Étienne André, Marie Duflot, Laetitia Laversa, Engel Lefaucheux
{"title":"定时自动机的执行时间不透明控制","authors":"Étienne André, Marie Duflot, Laetitia Laversa, Engel Lefaucheux","doi":"arxiv-2409.10336","DOIUrl":null,"url":null,"abstract":"Timing leaks in timed automata (TA) can occur whenever an attacker is able to\ndeduce a secret by observing some timed behavior. In execution-time opacity,\nthe attacker aims at deducing whether a private location was visited, by\nobserving only the execution time. It can be decided whether a TA is opaque in\nthis setting. In this work, we tackle control, and show that we are able to\ndecide whether a TA can be controlled at runtime to ensure opacity. Our method\nis constructive, in the sense that we can exhibit such a controller. We also\naddress the case when the attacker cannot have an infinite precision in its\nobservations.","PeriodicalId":501332,"journal":{"name":"arXiv - CS - Cryptography and Security","volume":"89 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Execution-time opacity control for timed automata\",\"authors\":\"Étienne André, Marie Duflot, Laetitia Laversa, Engel Lefaucheux\",\"doi\":\"arxiv-2409.10336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Timing leaks in timed automata (TA) can occur whenever an attacker is able to\\ndeduce a secret by observing some timed behavior. In execution-time opacity,\\nthe attacker aims at deducing whether a private location was visited, by\\nobserving only the execution time. It can be decided whether a TA is opaque in\\nthis setting. In this work, we tackle control, and show that we are able to\\ndecide whether a TA can be controlled at runtime to ensure opacity. Our method\\nis constructive, in the sense that we can exhibit such a controller. We also\\naddress the case when the attacker cannot have an infinite precision in its\\nobservations.\",\"PeriodicalId\":501332,\"journal\":{\"name\":\"arXiv - CS - Cryptography and Security\",\"volume\":\"89 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Cryptography and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.10336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Cryptography and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.10336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
定时自动机(TA)中的定时泄露可能发生在攻击者能够通过观察某些定时行为来推测秘密的时候。在执行时间不透明的情况下,攻击者的目的是通过只观察执行时间来推断某个私人位置是否被访问过。在这种情况下,可以判定 TA 是否不透明。在这项工作中,我们解决了控制问题,并证明我们能够判定 TA 是否能在运行时被控制以确保不透明。我们的方法是建设性的,因为我们可以展示这样一个控制器。我们还解决了攻击者无法无限精确观测的情况。
Timing leaks in timed automata (TA) can occur whenever an attacker is able to
deduce a secret by observing some timed behavior. In execution-time opacity,
the attacker aims at deducing whether a private location was visited, by
observing only the execution time. It can be decided whether a TA is opaque in
this setting. In this work, we tackle control, and show that we are able to
decide whether a TA can be controlled at runtime to ensure opacity. Our method
is constructive, in the sense that we can exhibit such a controller. We also
address the case when the attacker cannot have an infinite precision in its
observations.