DocumentCode
3371781
Title
Sufficient Conditions for Secrecy under Any Equational Theories
Author
Houmani, Hanane ; Mejri, Mohamed
Author_Institution
LSFM Res. Group, Laval Univ., Quebec City, QC
fYear
2008
fDate
24-26 April 2008
Firstpage
380
Lastpage
383
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.
Keywords
cryptographic protocols; formal verification; cryptographic protocol; equational theory; formal verification; secrecy property; Algebra; Computer science; Concrete; Cryptographic protocols; Cryptography; Equations; Information security; Sufficient conditions; Cryptographic protocols; Formal Analysis; Formal methods; Secrecy property.;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Security and Assurance, 2008. ISA 2008. International Conference on
Conference_Location
Busan
Print_ISBN
978-0-7695-3126-7
Type
conf
DOI
10.1109/ISA.2008.102
Filename
4511596
Link To Document