메뉴 건너뛰기




Volumn 1, Issue , 2000, Pages 237-250

Open issues in formal methods for cryptographic protocol analysis

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

EID: 84961720022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DISCEX.2000.824984     Document Type: Conference Paper
Times cited : (69)

References (54)
  • 10
    • 0020720357 scopus 로고
    • On the Security of Public Key Protocols
    • March
    • D. Dolev and A. Yao. On the Security of Public Key Protocols. IEEE Transactions on Information Theory, 29(2):198-208, March 1983.
    • (1983) IEEE Transactions on Information Theory , vol.29 , Issue.2 , pp. 198-208
    • Dolev, D.1    Yao, A.2
  • 12
    • 30344457160 scopus 로고    scopus 로고
    • Using a PVS embedding of CSP to verify authentication protocols
    • B. Dutertre and S. Schneider. Using a PVS embedding of CSP to verify authentication protocols. In TPHOLS'97, 1997.
    • (1997) TPHOLS'97
    • Dutertre, B.1    Schneider, S.2
  • 15
    • 0012796639 scopus 로고    scopus 로고
    • A security evaluation of IPSec
    • M. Blaze, J. Ioannides, A. Keromytis, and J. Smith, editors, Addison-Wesley, to appear
    • N. Ferguson and B. Schneier. A security evaluation of IPSec. In M. Blaze, J. Ioannides, A. Keromytis, and J. Smith, editors, The IPSec Papers. Addison-Wesley, to appear.
    • The IPSec Papers
    • Ferguson, N.1    Schneier, B.2
  • 16
    • 0005063385 scopus 로고    scopus 로고
    • Onion routing for anonymous and private internet connections
    • February
    • D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM, 42(2), February 1999.
    • (1999) Communications of the ACM , vol.42 , Issue.2
    • Goldschlag, D.1    Reed, M.2    Syverson, P.3
  • 17
    • 0003161603 scopus 로고    scopus 로고
    • Fail-stop protocols: An approach to designing secure protocols
    • R. K. Iyer, M. Morganti, Fuchs W. K, and V. Gligor, editors, IEEE Computer Society
    • Li Gong and Paul Syverson. Fail-stop protocols: An approach to designing secure protocols. In R. K. Iyer, M. Morganti, Fuchs W. K, and V. Gligor, editors, Dependable Computing for Critical Applications 5, pages 79-100. IEEE Computer Society, 1998.
    • (1998) Dependable Computing for Critical Applications , vol.5 , pp. 79-100
    • Gong, L.1    Syverson, P.2
  • 20
    • 0024665744 scopus 로고
    • Using Formal Methods to Analyze Encryption Protocols
    • Richard Kemmerer. Using Formal Methods to Analyze Encryption Protocols. IEEE Journal on Selected Areas in Communication, 7(4):448-457, 1989.
    • (1989) IEEE Journal on Selected Areas in Communication , vol.7 , Issue.4 , pp. 448-457
    • Kemmerer, R.1
  • 22
    • 84958052989 scopus 로고    scopus 로고
    • Probabilistic polynomial-time equivalence and security analysis
    • J. Wing, J. Woodcock, and J. Davies, editors, FM'99 - Formal Methods, Springer- Verlag September
    • P. Lincoln, J. MItchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In J. Wing, J. Woodcock, and J. Davies, editors, FM'99 - Formal Methods, pages 776-793. Springer- Verlag LLNCS 1709, September 1999.
    • (1999) LLNCS , vol.1709 , pp. 776-793
    • Lincoln, P.1    Mitchell, J.2    Mitchell, M.3    Scedrov, A.4
  • 23
    • 0026837069 scopus 로고
    • An Automatic Search for Security Flaws in Key Management Schemes
    • D. Longley and S. Rigby. An Automatic Search for Security Flaws in Key Management Schemes. Computers and Security, 11(1):75-90, 1992.
    • (1992) Computers and Security , vol.11 , Issue.1 , pp. 75-90
    • Longley, D.1    Rigby, S.2
  • 24
    • 26444574191 scopus 로고    scopus 로고
    • Breaking and fixing the Needham-Schroeder public-key protocol using FDR
    • G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Software - Concepts and Tools, 17:93-102, 1996.
    • (1996) Software - Concepts and Tools , vol.17 , pp. 93-102
    • Lowe, G.1
  • 27
    • 0342880800 scopus 로고
    • Applying Formal Methods to the Analysis of a Key Management Protocol
    • C. Meadows. Applying Formal Methods to the Analysis of a Key Management Protocol. Journal of Computer Security, 1:5-53, 1992.
    • (1992) Journal of Computer Security , vol.1 , pp. 5-53
    • Meadows, C.1
  • 28
    • 12744257762 scopus 로고    scopus 로고
    • Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches
    • Springer-Verlag, September
    • C. Meadows. Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. In Computer Security - ESORICS 96, pages 355-364. Springer- Verlag, September 1996.
    • (1996) Computer Security - ESORICS 96 , pp. 355-364
    • Meadows, C.1
  • 29
    • 84940106630 scopus 로고    scopus 로고
    • Analysis of the Internet Key Exchange protocol using the NRL Protocol Analyzer
    • IEEE Computer Society Press, May
    • C. Meadows. Analysis of the Internet Key Exchange protocol using the NRL Protocol Analyzer. In Proceedings of the 1999 Symposium on Security and Privacy. IEEE Computer Society Press, May 1999.
    • (1999) Proceedings of the 1999 Symposium on Security and Privacy
    • Meadows, C.1
  • 30
    • 0032664157 scopus 로고    scopus 로고
    • A formal framework and evaluation method for network denial of service
    • IEEE Computer Society Press, June
    • C. Meadows. A formal framework and evaluation method for network denial of service. In Proceedings of the 12th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, June 1999.
    • (1999) Proceedings of the 12th IEEE Computer Security Foundations Workshop
    • Meadows, C.1
  • 31
    • 84958035071 scopus 로고    scopus 로고
    • A formal specification of requirements for payment in the SET protocol
    • Proceedings of Financial Cryptography ' 98. Springer-Verlag
    • C. Meadows and P. Syverson. A formal specification of requirements for payment in the SET protocol. In Proceedings of Financial Cryptography ' 98. Springer- Verlag LLNCS, 1998.
    • (1998) LLNCS
    • Meadows, C.1    Syverson, P.2
  • 33
    • 0030084918 scopus 로고    scopus 로고
    • The NRL Protocol Analyzer: An overview
    • Catherine Meadows. The NRL Protocol Analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
    • (1996) Journal of Logic Programming , vol.26 , Issue.2 , pp. 113-131
    • Meadows, C.1
  • 37
    • 0018048246 scopus 로고
    • Using Encryption for Authentication in Large Networks of Computers
    • December
    • R. M. Needham and M. D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Communications of the ACM, 21(12):993-999, December 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.12 , pp. 993-999
    • Needham, R.M.1    Schroeder, M.D.2
  • 38
    • 0003892370 scopus 로고    scopus 로고
    • Request for Comments 2412, Network Working Group, November
    • H. Orman. The OAKLEY key determination protocol. Request for Comments 2412, Network Working Group, November 1998. Available at http://www.ietf.org/html.charters/ipsec-charter.html.
    • (1998) The OAKLEY Key Determination Protocol
    • Orman, H.1
  • 40
    • 0030696539 scopus 로고    scopus 로고
    • Mechanized proofs for a recursive authentication protocol
    • IEEE Computer Society Press, June
    • L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proceedings of the 10th Computer Security Foundations Workshop, pages 84-95. IEEE Computer Society Press, June 1997.
    • (1997) Proceedings of the 10th Computer Security Foundations Workshop , pp. 84-95
    • Paulson, L.1
  • 41
    • 0031643297 scopus 로고    scopus 로고
    • The inductive approach to verifying cryptographic protocols
    • Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
    • (1998) Journal of Computer Security , vol.6 , pp. 85-128
    • Paulson, L.C.1
  • 42
    • 0002054934 scopus 로고    scopus 로고
    • Crowds: Anonymity for web transactions
    • June
    • M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM TISSEC, June 1999.
    • (1999) ACM TISSEC
    • Reiter, M.1    Rubin, A.2
  • 43
    • 0003007912 scopus 로고    scopus 로고
    • Athena: An automatic checker for security protocol analysis
    • IEEE Computer Society Press, June
    • D. Song. Athena: An automatic checker for security protocol analysis. In Proceedings of 12th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, June 1999.
    • (1999) Proceedings of 12th IEEE Computer Security Foundations Workshop
    • Song, D.1
  • 44
    • 84963600485 scopus 로고    scopus 로고
    • A bound on attacks on authentication protocols
    • July
    • S. Stoller. A bound on attacks on authentication protocols. presented at 1999 Workshop on Formal Methods and Security Protocols, available at http://www.cs.indiana.edu/hyplan/stoller/, July 1999.
    • (1999) 1999 Workshop on Formal Methods and Security Protocols
    • Stoller, S.1
  • 47
    • 84924758404 scopus 로고    scopus 로고
    • Group principals and the formalization of anonymity
    • J. Wing, J.Woodcock, and J. Davies, editors, FM'99 - Formal Methods, Springer- Verlag
    • P. Syverson and S. Stubblebine. Group principals and the formalization of anonymity. In J. Wing, J.Woodcock, and J. Davies, editors, FM'99 - Formal Methods, pages 814-833. Springer- Verlag LLNCS 1708, 1999.
    • (1999) LLNCS , vol.1708 , pp. 814-833
    • Syverson, P.1    Stubblebine, S.2
  • 54
    • 0032669524 scopus 로고    scopus 로고
    • Fixing a security flaw in IKE protocols
    • June
    • J. Zhou. Fixing a security flaw in IKE protocols. Electronics Letters, 35(13):1072-1073, June 1999.
    • (1999) Electronics Letters , vol.35 , Issue.13 , pp. 1072-1073
    • Zhou, J.1


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