메뉴 건너뛰기




Volumn , Issue , 2009, Pages 157-171

Using proverif to analyze protocols with diffie-hellman exponentiation

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC PROPERTIES; AUTOMATIC ANALYSIS; CRYPTOGRAPHIC PROTOCOLS; DIFFIE HELLMAN; EXCLUSIVE-OR; EXPONENTIATIONS; HORN THEORY; LARGE CLASS; SOUNDNESS AND COMPLETENESS;

EID: 70350539549     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2009.17     Document Type: Conference Paper
Times cited : (90)

References (33)
  • 1
    • 35048861871 scopus 로고    scopus 로고
    • Just Fast Keying in the Pi Calculus
    • D. Schmidt, editor, Programming Languages and Systems: Proceedings of the 13th European Symposium on Programming ESOP'04, of, Springer Verlag
    • M. Abadi, B. Blanchet, and C. Fournet. Just Fast Keying in the Pi Calculus. In D. Schmidt, editor, Programming Languages and Systems: Proceedings of the 13th European Symposium on Programming (ESOP'04), volume 2986 of Lecture Notes on Computer Science, pages 340-354. Springer Verlag, 2004.
    • (2004) Lecture Notes on Computer Science , vol.2986 , pp. 340-354
    • Abadi, M.1    Blanchet, B.2    Fournet, C.3
  • 3
    • 26444497860 scopus 로고    scopus 로고
    • A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Com-pagna, J. Cuéllar, P. Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinow-itch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron. The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In K. Etessami and S. Rajamani, editors, Computer Aided Verification, 17th International Conference (CAV 2005), 3576 of Lecture Notes in Computer Science, pages 281-285. Springer-Verlag, 2005.
    • A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Com-pagna, J. Cuéllar, P. Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinow-itch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron. The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In K. Etessami and S. Rajamani, editors, Computer Aided Verification, 17th International Conference (CAV 2005), volume 3576 of Lecture Notes in Computer Science, pages 281-285. Springer-Verlag, 2005.
  • 4
    • 70350548284 scopus 로고    scopus 로고
    • The AVISPA Library of Protocols
    • The AVISPA Library of Protocols. http://avispa-project.org/library/.
  • 9
    • 35248897641 scopus 로고    scopus 로고
    • Symbolic analysis of crypto-protocols based on modular exponentiation
    • B. Rovan and P. Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium MFCS 2003, of, Springer
    • M. Boreale and M. G. Buscemi. Symbolic analysis of crypto-protocols based on modular exponentiation. In B. Rovan and P. Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium (MFCS 2003), volume 2747 of Lecture Notes in Computer Science, pages 269-278. Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2747 , pp. 269-278
    • Boreale, M.1    Buscemi, M.G.2
  • 10
    • 35248865266 scopus 로고    scopus 로고
    • Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In P. Pandya and J. Radhakrishnan, editors, FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2914 of Lecture Notes in Computer Science, pages 124-135. Springer, 2003. A full version of this paper was published in ACM Transactions on Computational Logic (TOCL), 9(4), 2008.
    • Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In P. Pandya and J. Radhakrishnan, editors, FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, volume 2914 of Lecture Notes in Computer Science, pages 124-135. Springer, 2003. A full version of this paper was published in ACM Transactions on Computational Logic (TOCL), 9(4), 2008.
  • 11
    • 33749446224 scopus 로고    scopus 로고
    • Hierarchical Combination of Intruder Theories
    • F. Pfenning, editor, Term Rewriting and Applications, 17th International Conference, RTA 2006, Proceedings, of, Springer
    • Y. Chevalier and M. Rusinowitch. Hierarchical Combination of Intruder Theories. In F. Pfenning, editor, Term Rewriting and Applications, 17th International Conference, RTA 2006, Proceedings, volume 4098 of Lecture Notes in Computer Science, pages 108-122. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4098 , pp. 108-122
    • Chevalier, Y.1    Rusinowitch, M.2
  • 12
    • 1442311384 scopus 로고    scopus 로고
    • Security properties: Two agents are sufficient
    • H. Comon-Lundh and V. Cortier. Security properties: two agents are sufficient. Sci. Comput. Program., 50(1-3):51-71, 2004.
    • (2004) Sci. Comput. Program , vol.50 , Issue.1-3 , pp. 51-71
    • Comon-Lundh, H.1    Cortier, V.2
  • 14
    • 57049108197 scopus 로고    scopus 로고
    • State Space Reduction in the Maude-NRL Protocol Analyzer
    • S. Jajodia and J. López, editors, Computer Security, ESORICS 2008, 13th European Symposium on Research in Computer Security, Proceedings, of, Springer
    • S. Escobar, C. Meadows, and J. Meseguer. State Space Reduction in the Maude-NRL Protocol Analyzer. In S. Jajodia and J. López, editors, Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Proceedings, volume 5283 of Lecture Notes in Computer Science, pages 548-562. Springer, 2008.
    • (2008) Lecture Notes in Computer Science , vol.5283 , pp. 548-562
    • Escobar, S.1    Meadows, C.2    Meseguer, J.3
  • 15
    • 20144373910 scopus 로고    scopus 로고
    • Abstraction and Resolution Modulo AC: How to Verify Diffie-Hellman-like Protocols Automatically
    • J. Goubault-Larrecq, M. Roger, and K. Verma. Abstraction and Resolution Modulo AC: How to Verify Diffie-Hellman-like Protocols Automatically. Journal of Logic and Algebraic Programming, 64(2):219-251, 2005.
    • (2005) Journal of Logic and Algebraic Programming , vol.64 , Issue.2 , pp. 219-251
    • Goubault-Larrecq, J.1    Roger, M.2    Verma, K.3
  • 16
    • 0038629629 scopus 로고
    • Entity authentication mechanisms-Part 3: Entity authentication using assymetric techniques,
    • ISO/IEC IS 9798-3
    • ISO/IEC IS 9798-3, Entity authentication mechanisms-Part 3: Entity authentication using assymetric techniques, 1993.
    • (1993)
  • 17
    • 51149098006 scopus 로고    scopus 로고
    • Analyzing protocols that use modular exponentiation: Semantic unification techniques
    • R. Nieuwenhuis, editor, Proceedings of the 14th International Conference on Rewriting Techniques and Applications RTA 2003, of, Springer
    • D. Kapur, P. Narendran, and L. Wang. Analyzing protocols that use modular exponentiation: Semantic unification techniques. In R. Nieuwenhuis, editor, Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA 2003), volume 2706 of Lecture Notes in Computer Science, pages 165-179. Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2706 , pp. 165-179
    • Kapur, D.1    Narendran, P.2    Wang, L.3
  • 18
    • 1442292341 scopus 로고    scopus 로고
    • C. Kaufman Editor, draft-ietf-ipsec-ikev2-17.txt
    • C. Kaufman (Editor). Internet Key Exchange (IKEv2) Protocol. draft-ietf-ipsec-ikev2-17.txt, 2004. http://tools.ietf.org/html/draft-ietf- ipsec-ikev2-17.
    • (2004) Internet Key Exchange (IKEv2) Protocol
  • 19
    • 35248816546 scopus 로고    scopus 로고
    • SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols
    • D. Boneh, editor, Advances in Cryptology, CRYPTO 2003, 23rd Annual International Cryptology Conference, of, Springer
    • H. Krawczyk. SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, volume 2729 of Lecture Notes in Computer Science, pages 400-425. Springer, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2729 , pp. 400-425
    • Krawczyk, H.1
  • 21
    • 70349286236 scopus 로고    scopus 로고
    • Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach
    • P. Syverson, S. Jha, and X. Zhang, editors, ACM Press
    • R. Küsters and T. Truderung. Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach. In P. Syverson, S. Jha, and X. Zhang, editors, Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS 2008), pages 129-138. ACM Press, 2008.
    • (2008) Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS 2008) , pp. 129-138
    • Küsters, R.1    Truderung, T.2
  • 22
    • 35048852126 scopus 로고    scopus 로고
    • Sound Approximations to Diffie-Hellman Using Rewrite Rules
    • J. Lopez, S. Qing, and E. Okamoto, editors, Information and Communications Security, 6th International Conference ICICS 2004, of, Springer
    • C. Lynch and C. Meadows. Sound Approximations to Diffie-Hellman Using Rewrite Rules. In J. Lopez, S. Qing, and E. Okamoto, editors, Information and Communications Security, 6th International Conference (ICICS 2004), volume 3269 of Lecture Notes in Computer Science, pages 262-277. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3269 , pp. 262-277
    • Lynch, C.1    Meadows, C.2
  • 23
    • 0012795935 scopus 로고    scopus 로고
    • Extending formal cryptographic protocol analysis techniques for group protocols and low-level cryptographic primitives
    • P. Degano, editor
    • C. Meadows. Extending formal cryptographic protocol analysis techniques for group protocols and low-level cryptographic primitives. In P. Degano, editor, Proceedings of the First Workshop on Issues in the Theory of Security (WITS'00), pages 87-92, 2000.
    • (2000) Proceedings of the First Workshop on Issues in the Theory of Security (WITS'00) , pp. 87-92
    • Meadows, C.1
  • 26
    • 0028514601 scopus 로고
    • Kerberos: An Authentication Service for Computer Networks
    • B. C. Neuman and T. Ts'o. Kerberos: An Authentication Service for Computer Networks. IEEE Communications, 32(9):33-38, 1994.
    • (1994) IEEE Communications , vol.32 , Issue.9 , pp. 33-38
    • Neuman, B.C.1    Ts'o, T.2
  • 28
    • 41549086014 scopus 로고    scopus 로고
    • Formal Proofs of Cryptographic Security of Diffie-Hellman-Based Protocols
    • G. Barthe and C. Fournet, editors, Trustworthy Global Computing, of, Springer
    • A. Roy, A. Datta, and J. C. Mitchell. Formal Proofs of Cryptographic Security of Diffie-Hellman-Based Protocols. In G. Barthe and C. Fournet, editors, Trustworthy Global Computing, volume 4912 of Lecture Notes in Computer Science, pages 312-329. Springer, 2007.
    • (2007) Lecture Notes in Computer Science , vol.4912 , pp. 312-329
    • Roy, A.1    Datta, A.2    Mitchell, J.C.3
  • 29
    • 35048827395 scopus 로고    scopus 로고
    • Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation
    • D. Schmidt, editor, 13th European Symposium on Programming ESOP 2004, of, Springer
    • V. Shmatikov. Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. In D. Schmidt, editor, 13th European Symposium on Programming (ESOP 2004), volume 2986 of Lecture Notes in Computer Science, pages 355-369. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.2986 , pp. 355-369
    • Shmatikov, V.1
  • 30
    • 33749413267 scopus 로고    scopus 로고
    • The CL-Atse Protocol Analyser
    • F. Pfenning, editor, Term Rewriting and Applications, 17th International Conference, RTA 2006, Proceedings, of, Springer
    • M. Turuani. The CL-Atse Protocol Analyser. In F. Pfenning, editor, Term Rewriting and Applications, 17th International Conference, RTA 2006, Proceedings, volume 4098 of Lecture Notes in Computer Science, pages 277-286. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4098 , pp. 277-286
    • Turuani, M.1
  • 31
    • 26944478183 scopus 로고    scopus 로고
    • On the complexity of equational horn clauses
    • Proceedings of the 20th International Conference on Automated Deduction CADE 2005, of, Springer-Verlag
    • K. Verma, H. Seidl, and T. Schwentick. On the complexity of equational horn clauses. In Proceedings of the 20th International Conference on Automated Deduction (CADE 2005), volume 3328 of Lecture Notes in Computer Science, pages 337-352. Springer-Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3328 , pp. 337-352
    • Verma, K.1    Seidl, H.2    Schwentick, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.