Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Najah Chridi, Mathieu Turuani, MichaÃ«l Rusinowitch. Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. In Proceedings of the 22nd IEEE Computer Security Foundations Symposium, CSF 2009, Port Jefferson, New York, USA, July 8-10, 2009. pages 277-289, IEEE Computer Society, 2009. [doi]

This author has not been identified. Look up 'Najah Chridi' in GoogleThis author has not been identified. Look up 'Mathieu Turuani' in GoogleThis author has not been identified. Look up 'MichaÃ«l Rusinowitch' in Google

runs on WebDSL