{"title":"Sufficient Conditions for Secrecy under Any Equational Theories","authors":"H. Houmani, M. Mejri","doi":"10.1109/ISA.2008.102","DOIUrl":null,"url":null,"abstract":"This paper gives sufficient conditions that guarantee the secrecy property for cryptographic protocols. Intuitively, these conditions state that agents should not decrease the security level of components when they send them in the network. Moreover, the verification of this condition can be performed using the standard description of cryptographic protocols and the verification process can be made automatic.","PeriodicalId":212375,"journal":{"name":"2008 International Conference on Information Security and Assurance (isa 2008)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Information Security and Assurance (isa 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISA.2008.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This paper gives sufficient conditions that guarantee the secrecy property for cryptographic protocols. Intuitively, these conditions state that agents should not decrease the security level of components when they send them in the network. Moreover, the verification of this condition can be performed using the standard description of cryptographic protocols and the verification process can be made automatic.