Security properties: two agents are sufficient
作者： Hubert Comon-Lundh , Véronique Cortier
DOI: 10.1016/J.SCICO.2003.12.002
关键词: Bounded function 、 Challenge–response authentication 、 Security properties 、 Computer science 、 Cryptographic primitive 、 Secrecy 、 Authentication 、 Authentication protocol 、 Cryptographic protocol 、 Computer security
摘要: We consider arbitrary cryptographic protocols and security properties. show that it is always sufficient to a bounded number of agents b (actually = 2 in most the cases): if there an attack involving n agents, then at agents.
springer.com
archives-ouvertes.fr
loria.fr
elsevier.com参考文章(30)
Jean-Louis Lassez, Gordon Plotkin, JA Robinson, Computational logic: essays in honor of Alan Robinson MIT Press. ,(1991)
Hubert Comon, Véronique Cortier, John Mitchell, Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols international colloquium on automata languages and programming. pp. 682- 693 ,(2001) , 10.1007/3-540-48224-5_56
Roberto M. Amadio, Denis Lugiez, On the Reachability Problem in Cryptographic Protocols international conference on concurrency theory. pp. 380- 394 ,(2000) , 10.1007/3-540-44618-4_28
S. Schneider, P. Ryan, The Modelling and Analysis of Security Protocols: The Csp Approach ,(2000)
H. Comon, Tree automata techniques and applications ,(1997)
Hubert Comon, Disunification: A Survey. Computational Logic - Essays in Honor of Alan Robinson. pp. 322- 359 ,(1991)
James Heather, Gavin Lowe, Steve Schneider, How to prevent type flaw attacks on security protocols Journal of Computer Security. ,vol. 11, pp. 217- 244 ,(2003) , 10.3233/JCS-2003-11204
G. Denker, J. Millen, CAPSL integrated protocol environment darpa information survivability conference and exposition. ,vol. 1, pp. 207- 221 ,(2000) , 10.1109/DISCEX.2000.824980
David A. McAllester, Automatic recognition of tractability in inference relations Journal of the ACM. ,vol. 40, pp. 284- 303 ,(1993) , 10.1145/151261.151265
Martín Abadi, Andrew D. Gordon, A calculus for cryptographic protocols: the spi calculus computer and communications security. pp. 36- 47 ,(1997) , 10.1145/266420.266432