Verifying Secrecy by Abstract Interpretation(4)

Verifying Secrecy by Abstract Interpretation

Bozga,Lakhnech,P´e rin

[19]R.M.Needham and ing encryption for authentication in large networks of computers.

CACM,21(12):993–999,1978.

[20]L.Paulson.Proving properties of security protocols by induction.In10th IEEE Computer Security

Foundations Workshop(CSFW’97),pages70–83,June1997.IEEE.

[21]M.Rusinowitch and M.Turuani.Protocol insecurity withfinite number of sessions is np-complete.In

14th IEEE Computer Security Foundations Workshop(2001),pp.174–190.,2001.

[22]S.Schneider.Verifying authentication protocols with CSP.In10th IEEE Computer Security Foundations

Workshop(CSFW’97),pages3–17,June1997.IEEE.

118