Protocol indepedence through disjoint encryption under Exclusive-OR
Cryptography and Security
2010-05-11 v2 Symbolic Computation
Abstract
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.
Cite
@article{arxiv.1003.5384,
title = {Protocol indepedence through disjoint encryption under Exclusive-OR},
author = {Sreekanth Malladi},
journal= {arXiv preprint arXiv:1003.5384},
year = {2010}
}
Comments
22 pages, In Proceedings, Foundations of Security and Privacy (FCS-PrivMod 2010).