Decidability of opacity with nonatomic keys

IFIP Advances in Information and Communication Technology

Volumn 173, Issue , 2005, Pages 71-84

  Mazaré, Laurent ^a  

^a VERIMAG   (France)

Author keywords

Decidability; Dolev Yao Constraints; Formal Verification; Opacity; Rewriting Systems; Security

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORMAL VERIFICATION; SYNTACTICS;

ATOMIC KEYS; DOLEV-YAO CONSTRAINTS; LOGICAL CONSTRAINTS; NON-ATOMIC KEYS; OTHER PROPERTIES; REWRITING SYSTEMS; SATISFIABILITY; SECURITY;

OPACITY;

EID: 78649476961     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-387-24098-5_6     Document Type: Conference Paper

References (15)

1. Abadi, M. and Rogaway, P. (2000). Reconciling two views of cryptography (the computational soundness of formal encryption). In IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan. Springer-Verlag, Berlin Germany.
2. Avispa (1999). The Avispa Project, http://www.avispa-project.org/.
3. Boisseau, A. (2003). Abstractions pour la verification de propriétés de sécurité de protocoles cryptographiques. PhD thesis, Laboratoire Specification et Verification (LSV), ENS de Cachan.
4. Bozga, L., Lakhnech, Y., and Périn, M. (2002). Abstract interpretation for secrecy using patterns. Technical report, EVA: http://www-eva.imag.fr/.
5. Clarke, E., Jha, S., and Marrero, W. (1998). Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In IFIP Working Conference on Programming Concepts and Methods.
6. Comon-Lundh., H. and Cortier, V. (2002). Security properties: Two agents are sufficient. Technical report, LSV.
7. Comon-Lundh, H. and Cortier, V. (2003). New decidability results for fragments of first-order logic and application to cryptographic protocols. In 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), volume 2706 of LNCS.
8. Delaune, S. (2003). Intruder deduction problem in presence of guessing attacks. Workshop on Security Protocols Verification (SPV'03), co-located with the 14th International Conference on Concurrency Theory (CONCUR'03).
9. Dolev, D. and Yao, A. C. (1983). On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208.
10. Gong, L., Lomas, M. A., Needham, R. M., and Saltzer, J. H. (1993). Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications, 11(5):648-656.
11. Goubault-Larrecq, J. (2000). A method for automatic cryptographic protocol verification. In International Workshop on Formal Methods for Parallel Programming: Theory and Applications, volume 1800 of LNCS.
12. Hughes, D. and Shmatikov, V. (2004). Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security, 12(1):3-36.
13. Lowe, G. (2002). Analysing protocols subject to guessing attacks. In Proc. of the Workshop on Issues in the Theory of Security (WITS'02).
14. Mazaré, L. (2004). Using unification for opacity properties. In Proc. of the Workshop on Issues in the Theory of Security (WITS'04). To appear.
15. Schneider, S. and Sidiropoulos, A. (1996). CSP and anonymity. In ESORICS, pages 198-218.