Editing Malleability (cryptography) (section)

== Complete non-malleability ==
Fischlin, in 2005, defined the notion of complete non-malleability as the ability of the system to remain [[Non-Malleable Codes|non-malleable]] while giving the adversary additional power to choose a new public key which could be a function of the original public key.<ref>{{Cite book|last=Fischlin|first=Marc|title=Automata, Languages and Programming |date=2005-07-11|chapter=Completely Non-malleable Schemes|volume=3580|series=Lecture Notes in Computer Science|language=en|publisher=Springer, Berlin, Heidelberg|pages=[https://archive.org/details/automatalanguage2005inte/page/779 779–790]|doi=10.1007/11523468_63|isbn=9783540275800|citeseerx=10.1.1.501.6445|chapter-url=https://archive.org/details/automatalanguage2005inte/page/779}}</ref> In other words, the adversary shouldn't be able to come up with a ciphertext whose underlying plaintext is related to the original message through a relation that also takes public keys into account.