2000 character limit reached
A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions (1803.08151v1)
Published 21 Mar 2018 in cs.CR
Abstract: 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.