Author:
Amadio Roberto M.,Lugiez Denis,Vanackère Vincent
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. R. Amadio, W. Charatonik, On name generation and set-based analysis in Dolev–Yao model, RR-INRIA, January 2002.
2. R. Amadio, D. Lugiez, On the reachability problem in cryptographic protocols, in: Proc. CONCUR00, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000, also RR-INRIA 3915.
3. R. Amadio, S. Prasad, The game of the name in cryptographic tables, in: Proc. ASIAN99, Lecture Notes in Computer Science, Vol. 1742, Springer, Berlin, 1999.
4. R. Amadio, D. Lugiez, V. Vanackère, On the reachability problem in cryptographic protocols, Workshop on Issues in the Theory of Security, Geneve, 2000, Short presentation of results in [2] and in Vanackere's DEA.
5. R. Amadio, D. Lugiez, V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Research Report INRIA-Sophia, March 2001.
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献