Title :
Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests
Author :
Catalin V. Birjoveanu
Author_Institution :
Dept. of Comput. Sci., Al.I.Cuza Univ. of Iasi, Iasi, Romania
Abstract :
In this paper, we extend some complexity results on thesecrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
Keywords :
"Protocols","Testing","Data security","Cryptography","Scientific computing","Computer security","Computer science","Electronic mail","Helium"
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC ´08. 10th International Symposium on
Print_ISBN :
978-0-7695-3523-4
DOI :
10.1109/SYNASC.2008.18
