Title :
Secrecy for Bounded Security Protocols without Freshness Check
Author :
Bîrjoveanu, Catalin V.
Author_Institution :
Dept. of Comput. Sci., Al.I.Cuza Univ. of Iasi, Iasi, Romania
Abstract :
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. The complexity of the secrecy problem for bounded security protocols without freshness check remained open. In this paper, we prove DEXPTIME-completeness of the secrecy problem for bounded security protocols without freshness check, solving the problem left open.
Keywords :
cryptographic protocols; DEXPTIME-completeness; bounded security protocol; encryption; freshness check; secrecy problem; Computer science; Computer security; Cryptographic protocols; Cryptography; Data security; Helium; Information security; Polynomials; Public key; Terminology;
Conference_Titel :
Emerging Security Information, Systems and Technologies, 2009. SECURWARE '09. Third International Conference on
Conference_Location :
Athens, Glyfada
Print_ISBN :
978-0-7695-3668-2
DOI :
10.1109/SECURWARE.2009.13
