all InfoSec news
Solving the insecurity problem for assertions. (arXiv:2308.13773v2 [cs.LO] UPDATED)
cs.CR updates on arXiv.org arxiv.org
In the symbolic verification of cryptographic protocols, a central problem is
deciding whether a protocol admits an execution which leaks a designated secret
to the malicious intruder. Rusinowitch & Turuani (2003) show that, when
considering finitely many sessions, this ``insecurity problem'' is NP-complete.
Central to their proof strategy is the observation that any execution of a
protocol can be simulated by one where the intruder only communicates terms of
bounded size. However, when we consider models where, in addition to …
amp arxiv cryptographic insecurity intruder leaks malicious problem proof protocol protocols secret sessions strategy verification