{"title":"Kerberos协议PEPA模型的简化解","authors":"Yishi Zhao, N. Thomas","doi":"10.1109/CyberC.2011.50","DOIUrl":null,"url":null,"abstract":"In this paper an authentication protocol, Kerberos, is investigated. To consider the scenario where there are multiple realms, a simplification is applied. The simplified model is equivalent to original model in terms of the steady state distribution. It is analysed numerically using a fluid flow approximation and is verified by stochastic simulation.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Simplified Solution of a PEPA Model of Kerberos Protocol\",\"authors\":\"Yishi Zhao, N. Thomas\",\"doi\":\"10.1109/CyberC.2011.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an authentication protocol, Kerberos, is investigated. To consider the scenario where there are multiple realms, a simplification is applied. The simplified model is equivalent to original model in terms of the steady state distribution. It is analysed numerically using a fluid flow approximation and is verified by stochastic simulation.\",\"PeriodicalId\":227472,\"journal\":{\"name\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2011.50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Simplified Solution of a PEPA Model of Kerberos Protocol
In this paper an authentication protocol, Kerberos, is investigated. To consider the scenario where there are multiple realms, a simplification is applied. The simplified model is equivalent to original model in terms of the steady state distribution. It is analysed numerically using a fluid flow approximation and is verified by stochastic simulation.