{"title":"小猪储蓄罐密码中各方的身份验证","authors":"Prashanth Busireddygari, S. Kak","doi":"10.1109/ACSSC.2017.8335582","DOIUrl":null,"url":null,"abstract":"This paper considers authentication issues and security analysis of a CA-based authentication of parties using the Piggy Bank model of cryptography. The PB model as originally described did not deal with the question of how Alice and Bob authenticate each other. This problem is considered in this paper and authentication using a certification authority (CA) is proposed. A formal proof of the protocol is modeled using input-output finite automata.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Authentication of parties in piggy bank cryptography\",\"authors\":\"Prashanth Busireddygari, S. Kak\",\"doi\":\"10.1109/ACSSC.2017.8335582\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers authentication issues and security analysis of a CA-based authentication of parties using the Piggy Bank model of cryptography. The PB model as originally described did not deal with the question of how Alice and Bob authenticate each other. This problem is considered in this paper and authentication using a certification authority (CA) is proposed. A formal proof of the protocol is modeled using input-output finite automata.\",\"PeriodicalId\":296208,\"journal\":{\"name\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2017.8335582\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335582","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Authentication of parties in piggy bank cryptography
This paper considers authentication issues and security analysis of a CA-based authentication of parties using the Piggy Bank model of cryptography. The PB model as originally described did not deal with the question of how Alice and Bob authenticate each other. This problem is considered in this paper and authentication using a certification authority (CA) is proposed. A formal proof of the protocol is modeled using input-output finite automata.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
