Weakening the perfect encryption assumption in Dolev–Yao adversaries-Reference-Cited by-同舟云学术

Weakening the perfect encryption assumption in Dolev–Yao adversaries

Published:2005-06 Issue:1 Volume:340 Page:154-178
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Zunino Roberto,Degano Pierpaolo

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference26 articles.

1. Secrecy by typing in security protocols;Abadi;J. ACM,1999

2. A calculus for cryptographic protocols: the Spi calculus;Abadi;J. Inform. Comput.,1999

3. M. Abadi, J. Jürjens, Formal eavesdropping and its computational interpretation, in: Proc. TACS 2001, Lecture Notes in Computer Science, Vol. 2215, 2001, p. 82.

4. M. Abadi, P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), in: Proc. IFIP TCS2000, Lecture Notes in Computer Science, Vol. 1872, 2000, pp. 3–22.

5. M. Backes, C. Jacobi. Cryptographically sound and machine-assisted verification of security protocols, in: Proc. 20th Internat. Symp. on Theoretical Aspects of Computer Science, STACS ’03, 2003, pp. 675–686.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sound approximate and asymptotic probabilistic bisimulations for PCTL;Logical Methods in Computer Science;2023-03-31

2. Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete;Theoretical Computer Science;2014-06

3. A UTP approach towards probabilistic protocol verification;Security and Communication Networks;2012-06-21

4. A symbolic framework for multi-faceted security protocol analysis;International Journal of Information Security;2007-09-04

5. Towards a Quantitative Analysis of Security Protocols;Electronic Notes in Theoretical Computer Science;2006-10