{"title":"乒乓协议安全检测算法的反例生成","authors":"Erwin Eko Wahyudi, Reza Pulungan","doi":"10.1109/ICOICT.2018.8528754","DOIUrl":null,"url":null,"abstract":"An improperly designed protocol for sending a message could be vulnerable to an active attacker. A protocol for sending a message is called secure if any attacker cannot obtain the original message. If a protocol is unsecure, an attacker may perform some operations to obtain the original message. Dolev et al. proposed an algorithm to check the security of ping-pong protocols using nondeterministic finite automata. In this paper, we propose an algorithm for generating counterexamples of unsecure protocols by storing the counterexamples using dynamic programming technique.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Counterexample Generation for Ping-Pong Protocols Security Checking Algorithm\",\"authors\":\"Erwin Eko Wahyudi, Reza Pulungan\",\"doi\":\"10.1109/ICOICT.2018.8528754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improperly designed protocol for sending a message could be vulnerable to an active attacker. A protocol for sending a message is called secure if any attacker cannot obtain the original message. If a protocol is unsecure, an attacker may perform some operations to obtain the original message. Dolev et al. proposed an algorithm to check the security of ping-pong protocols using nondeterministic finite automata. In this paper, we propose an algorithm for generating counterexamples of unsecure protocols by storing the counterexamples using dynamic programming technique.\",\"PeriodicalId\":266335,\"journal\":{\"name\":\"2018 6th International Conference on Information and Communication Technology (ICoICT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 6th International Conference on Information and Communication Technology (ICoICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOICT.2018.8528754\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 6th International Conference on Information and Communication Technology (ICoICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOICT.2018.8528754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Counterexample Generation for Ping-Pong Protocols Security Checking Algorithm
An improperly designed protocol for sending a message could be vulnerable to an active attacker. A protocol for sending a message is called secure if any attacker cannot obtain the original message. If a protocol is unsecure, an attacker may perform some operations to obtain the original message. Dolev et al. proposed an algorithm to check the security of ping-pong protocols using nondeterministic finite automata. In this paper, we propose an algorithm for generating counterexamples of unsecure protocols by storing the counterexamples using dynamic programming technique.