Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be signed with the new signature key. A digital signature scheme is said to be vulnerable to destructive exclusive ownership property (DEO) If it is computationaly feasible for an intruder, given a public verification key and a pair of message and its valid signature relatively to the given public key, to compute a pair of signature and verification keys and a new message such that the given signature appears to be valid for the new message relatively to the new verification key. ,  prove decidability of the insecurity problem of cryptographic protocols where the signature schemes employed in the concrete realisation have this two properties.
['Yannick Chevalier', 'Mounira Kourjieh']
I am writing a research paper on a idea Key Substitution in the Symbolic Analysis of Cryptographic Protocols (extended version)
[{"from": "human", "value": "I am writing a research paper on a idea Key Substitution in the Symbolic Analysis of Cryptographic Protocols (extended version)"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be signed with the new signature key. A digital signature scheme is said to be vulnerable to destructive exclusive ownership property (DEO) If it is computationaly feasible for an intruder, given a public verification key and a pair of message and its valid signature relatively to the given public key, to compute a pair of signature and verification keys and a new message such that the given signature appears to be valid for the new message relatively to the new verification key. ,  prove decidability of the insecurity problem of cryptographic protocols where the signature schemes employed in the concrete realisation have this two properties."}]