2000 character limit reached
Disabling equational theories in unification for cryptographic protocol analysis through tagging (1003.5406v2)
Published 28 Mar 2010 in cs.CR, cs.DM, cs.LO, and cs.SC
Abstract: In this paper, we show a new tagging scheme for cryptographic protocol messages. Under this tagging, equational theories of operators such as exclusive-or, binary addition etc. are effectively disabled, when terms are unified. We believe that this result has a significant impact on protocol analysis and security, since unification is at the heart of symbolic protocol analysis. Hence, disabling equational theories in unification implies disabling them altogether in protocol analysis for most operators and theories.