Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: CSFW16
Article type: Research Article
Authors: Millen, Jonathan | Shmatikov, Vitaly; *
Affiliations: Computer Science Laboratory, SRI International, USA. E-mail: millen@csl.sri.com, shmat@csl.sri.com
Note: [*] Partially supported by ONR Grants N00014-01-1-0837 and N00014-03-1-0961, and by DARPA contract N66001-00-C-8014.
Abstract: We demonstrate that for any well-defined cryptographic protocol, the symbolic trace reachability problem in the presence of an Abelian group operator (e.g., multiplication) can be reduced to solvability of a decidable system of quadratic Diophantine equations. This result enables complete, fully automated formal analysis of protocols that employ primitives such as Diffie–Hellman exponentiation, multiplication, and xor, with a bounded number of role instances, but without imposing any bounds on the size of terms created by the attacker.
DOI: 10.3233/JCS-2005-13306
Journal: Journal of Computer Security, vol. 13, no. 3, pp. 515-564, 2005
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl