Abstract
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this leads to decidability of secrecy. In this paper, we show that tagging schemes can be used to obtain decidability of secrecy even in the presence of unboundedly many nonces. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Ramanujam, R., & Suresh, S. P. (2003). Tagging makes secrecy decidable with unbounded nonces as well. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2914, 363–374. https://doi.org/10.1007/978-3-540-24597-1_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
