Considering non-malleability in formal models for cryptographic protocols

Properties of different encryption schemes can be distinguished in a formal model for cryptographic protocols on a high level of abstraction. We demonstrate this using non-malleability, a goal that is not provided by many encryption schemes. Two example protocols motivate the consideration of non-malleability on a high level of abstraction.