Interestingly this thesis models the security protocols in terms of
automata .

"Foundations of Security Protocol Analysis"
http://www.imsc.res.in/xmlui/handle/123456789/105

Their key results being "the secrecy problem, whether a protocol leaks
secrets or not is Undecidable ! ". This could be dangerous in practice.
They prove that only few sub class of protocols are decidable .

And this thesis appeared in 2003 much before lang sec formed :) i believed !


Regards,
Sashank
http://lnkd.in/88sgfr
_______________________________________________
langsec-discuss mailing list
[email protected]
https://mail.langsec.org/cgi-bin/mailman/listinfo/langsec-discuss

Reply via email to