{"title":"加密协议逻辑的形式语义","authors":"P. Syverson","doi":"10.1109/CSFW.1990.128183","DOIUrl":null,"url":null,"abstract":"A logic and associated formal semantics specifically designed to represent and analyze cryptographic protocols are presented. A language is given with distinct means to represent knowledge of an individual word (e.g., the ability to recognize or produce a decryption key) and propositional knowledge. A sample analysis of a protocol is given to demonstrate the potential usefulness of the system.<<ETX>>","PeriodicalId":185508,"journal":{"name":"[1990] Proceedings. The Computer Security Foundations Workshop III","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Formal semantics for logics of cryptographic protocols\",\"authors\":\"P. Syverson\",\"doi\":\"10.1109/CSFW.1990.128183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A logic and associated formal semantics specifically designed to represent and analyze cryptographic protocols are presented. A language is given with distinct means to represent knowledge of an individual word (e.g., the ability to recognize or produce a decryption key) and propositional knowledge. A sample analysis of a protocol is given to demonstrate the potential usefulness of the system.<<ETX>>\",\"PeriodicalId\":185508,\"journal\":{\"name\":\"[1990] Proceedings. The Computer Security Foundations Workshop III\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. The Computer Security Foundations Workshop III\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSFW.1990.128183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. The Computer Security Foundations Workshop III","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSFW.1990.128183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal semantics for logics of cryptographic protocols
A logic and associated formal semantics specifically designed to represent and analyze cryptographic protocols are presented. A language is given with distinct means to represent knowledge of an individual word (e.g., the ability to recognize or produce a decryption key) and propositional knowledge. A sample analysis of a protocol is given to demonstrate the potential usefulness of the system.<>