A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions
This work addresses security issues in cryptographic protocols for researchers and practitioners, but it appears incremental as it builds on existing tagging and witness-function theories.
The paper tackles the problem of ensuring secrecy in cryptographic protocols by presenting a theorem based on witness-functions and applies it to analyze a new tagged version of the Needham-Schroeder public-key protocol, demonstrating its effectiveness in enhancing security.
In this paper, we enunciate the theorem of secrecy in tagged protocols using the theory of witness-functions and we run a formal analysis on a new tagged version of the Needham-Schroeder public-key protocol using this theorem. We discuss the significance of tagging in securing cryptographic protocols as well.