2010/03/28 by Sreekanth Malladi, Malladi, Sreekanth
Computer Science · Engineering · #Advanced Authentication Protocols Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #RFID technology advancements #Symbolic Computation (cs.SC) #cs.CR #cs.SC
paper · pdf · doi:10.48550/arxiv.1003.5384
22 pages, In Proceedings, Foundations of Security and Privacy (FCS-PrivMod 2010).
openalex publication_date 2010/03/28 · arxiv created 2010/05/09 · arxiv updated 2010/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Multi-protocol attacks due to protocol interaction has been a notorious problem for security. Gutman-Thayer proved that they can be prevented by ensuring that encrypted messages are distinguishable across protocols, under a free algebra. In this paper, we prove that a similar suggestion prevents these attacks under commonly used operators such as Exclusive-OR, that induce equational theories, breaking the free algebra assumption.