Preprint
Aug 2026
Decidability of Parameterised Dolev-Yao Secrecy
A cut-off theorem is obtained: secrecy violations in systems with arbitrarily many sessions are always witnessed in systems of bounded size, so secrecy also reduces to a coverability problem in WSTS.
Ioana Boureanu, R. Ramanujam, Srinibas Swain
· 0 citations