Computer Science – Cryptography and Security
Scientific paper
2010-03-28
Computer Science
Cryptography and Security
22 pages, In Proceedings, Foundations of Security and Privacy (FCS-PrivMod 2010).
Scientific paper
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.
No associations
LandOfFree
Protocol indepedence through disjoint encryption under Exclusive-OR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Protocol indepedence through disjoint encryption under Exclusive-OR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protocol indepedence through disjoint encryption under Exclusive-OR will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-127794