## Symbolic protocol analysis with products and Diffie-Hellman exponentiation (2003)

### Cached

### Download Links

- [www.csl.sri.com]
- [www.csl.sri.com]
- [www.csl.sri.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 36 - 0 self |

### BibTeX

@INPROCEEDINGS{Millen03symbolicprotocol,

author = {Jonathan Millen and Vitaly Shmatikov},

title = {Symbolic protocol analysis with products and Diffie-Hellman exponentiation},

booktitle = {},

year = {2003},

pages = {47--61},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### 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, andxor, with a bounded number of role instances, but without imposing any bounds on the size of terms created by the attacker. 1