Rudolph, C.C.Rudolph2022-03-092022-03-092000https://publica.fraunhofer.de/handle/publica/336978Properties 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.enformal modelcryptography005004Considering non-malleability in formal models for cryptographic protocolsconference paper