Tagging makes secrecy decidable with unbounded nonces as well
| Author(s) : | S. P. Suresh R. Ramanujam, |
| Publisher : | N/A |
| Publication Date : | 2003 |
| ISSN : | N/A |
| Abstract : | 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. 1, |