R. Gorrieri, F. Martinelli, M. Petrocchi, A. Vaccarelli
{"title":"数字流签名协议完整性的组合验证","authors":"R. Gorrieri, F. Martinelli, M. Petrocchi, A. Vaccarelli","doi":"10.1109/CSD.2003.1207708","DOIUrl":null,"url":null,"abstract":"We investigate the application of concurrency theory notions as simulation relations and compositional proof rules for verifying digital stream signature protocols. In particular, we formally prove the integrity of the Gennaro-Rohatgi protocols in (R. Gennaro et al., 2001). As a peculiarity, our technique is able to check a protocol with an unbounded number of parallel processes. We argue also that our approach may be applied to a wider class of stream signature protocols.","PeriodicalId":228530,"journal":{"name":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Compositional verification of integrity for digital stream signature protocols\",\"authors\":\"R. Gorrieri, F. Martinelli, M. Petrocchi, A. Vaccarelli\",\"doi\":\"10.1109/CSD.2003.1207708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the application of concurrency theory notions as simulation relations and compositional proof rules for verifying digital stream signature protocols. In particular, we formally prove the integrity of the Gennaro-Rohatgi protocols in (R. Gennaro et al., 2001). As a peculiarity, our technique is able to check a protocol with an unbounded number of parallel processes. We argue also that our approach may be applied to a wider class of stream signature protocols.\",\"PeriodicalId\":228530,\"journal\":{\"name\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSD.2003.1207708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSD.2003.1207708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
摘要
我们研究了并发理论概念作为仿真关系和组合证明规则在验证数字流签名协议中的应用。特别是,我们在(R. Gennaro et al., 2001)中正式证明了Gennaro- rohatgi协议的完整性。作为一个特点,我们的技术能够检查具有无限数量的并行进程的协议。我们还认为,我们的方法可以应用于更广泛的流签名协议。
Compositional verification of integrity for digital stream signature protocols
We investigate the application of concurrency theory notions as simulation relations and compositional proof rules for verifying digital stream signature protocols. In particular, we formally prove the integrity of the Gennaro-Rohatgi protocols in (R. Gennaro et al., 2001). As a peculiarity, our technique is able to check a protocol with an unbounded number of parallel processes. We argue also that our approach may be applied to a wider class of stream signature protocols.