메뉴 건너뛰기




Volumn 3444, Issue , 2005, Pages 157-171

Computationally sound, automated proofs for security protocols

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY;

EID: 24644437051     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_12     Document Type: Conference Paper
Times cited : (98)

References (22)
  • 3
    • 85083027758 scopus 로고    scopus 로고
    • Reconciling two views of cryptography (the computational soundness of formal encryption)
    • M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2): 103-127, 2002.
    • (2002) Journal of Cryptology , vol.15 , Issue.2 , pp. 103-127
    • Abadi, M.1    Rogaway, P.2
  • 4
    • 24644440198 scopus 로고    scopus 로고
    • Personal communication
    • M. Backes. Personal communication.
    • Backes, M.1
  • 6
    • 84948957152 scopus 로고    scopus 로고
    • Public-key encryption in a multi-user setting: Security proofs and improvements
    • Proc. of Eurocrypt'00
    • M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multi-user setting: Security proofs and improvements. In Proc. of Eurocrypt'00, volume 1807 of LNCS, pages 259-274, 2000.
    • (2000) LNCS , vol.1807 , pp. 259-274
    • Bellare, M.1    Boldyreva, A.2    Micali, S.3
  • 7
    • 0034822279 scopus 로고    scopus 로고
    • An efficient cryptographic protocol verifier based on prolog rules
    • June
    • B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Proc. of the 14th CSFW, June 2001.
    • (2001) Proc. of the 14th CSFW
    • Blanchet, B.1
  • 8
    • 35248837934 scopus 로고    scopus 로고
    • An automatic tool for the verification of secrecy in security protocols
    • 15th Int. Conference on Computer Aided Verification (CAV 2003), Springer, July
    • L. Bozga, Y. Lakhnech, and M. Perin. An automatic tool for the verification of secrecy in security protocols. In 15th Int. Conference on Computer Aided Verification (CAV 2003), volume 2725 of LNCS, pages 219-222. Springer, July 2003.
    • (2003) LNCS , vol.2725 , pp. 219-222
    • Bozga, L.1    Lakhnech, Y.2    Perin, M.3
  • 10
    • 24644519551 scopus 로고    scopus 로고
    • RNTL EVA project, Report n. 13, December
    • V. Cortier. A guide for Securify. RNTL EVA project, Report n. 13, December 2003.
    • (2003) A Guide for Securify
    • Cortier, V.1
  • 11
    • 24644518682 scopus 로고    scopus 로고
    • Computationally sound, automated proofs for security protocols
    • INRIA, October
    • V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. Research Report RR-5341, INRIA, October 2004.
    • (2004) Research Report , vol.RR-5341
    • Cortier, V.1    Warinschi, B.2
  • 12
    • 24644445273 scopus 로고    scopus 로고
    • Une comparaison entre deux méthodes de preuve de sécurité
    • In French
    • D.H.Phan and D. Pointcheval. Une comparaison entre deux méthodes de preuve de sécurité. In Proc. of RIVF, pages 105-110, 2003. In French.
    • (2003) Proc. of RIVF , pp. 105-110
    • Phan, D.H.1    Pointcheval, D.2
  • 13
    • 0023985465 scopus 로고
    • A digital signature scheme secure against adaptive chosen-message attacks
    • April
    • S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
    • (1988) SIAM Journal of Computing , vol.17 , Issue.2 , pp. 281-308
    • Goldwasser, S.1    Micali, S.2    Rivest, R.3
  • 14
    • 3543052976 scopus 로고    scopus 로고
    • Symmetric encryption in automatic analyses for confidentiality against active adversaries
    • P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. of 2004 IEEE Symposium on Security and Privacy, pages 71-85, 2004.
    • (2004) Proc. of 2004 IEEE Symposium on Security and Privacy , pp. 71-85
    • Laud, P.1
  • 15
    • 0342658605 scopus 로고    scopus 로고
    • Breaking and fixing the Needham-Schroeder public-key protocol using FDR
    • Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), Springer-Verlag, March
    • G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), volume 1055 of LNCS, pages 147-166. Springer-Verlag, March 1996.
    • (1996) LNCS , vol.1055 , pp. 147-166
    • Lowe, G.1
  • 16
    • 0030678388 scopus 로고    scopus 로고
    • Casper: A compiler for the analysis of security protocols
    • IEEE Computer Society Press
    • G. Lowe. Casper: A compiler for the analysis of security protocols. In Proc. of 10th CSFW'97. IEEE Computer Society Press, 1997.
    • (1997) Proc. of 10th CSFW'97
    • Lowe, G.1
  • 17
    • 35048899313 scopus 로고    scopus 로고
    • Soundness of formal encryption in the presence of active adversaries
    • Cambridge, MA, USA, February Springer-Verlag
    • D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Theory of Cryptography Conference (TCC 2004), pages 133-151, Cambridge, MA, USA, February 2004. Springer-Verlag.
    • (2004) Theory of Cryptography Conference (TCC 2004) , pp. 133-151
    • Micciancio, D.1    Warinschi, B.2
  • 19
    • 0030696539 scopus 로고    scopus 로고
    • Mechanized proofs for a recursive authentication protocol
    • IEEE Computer Society Press
    • L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. of the 10th CSFW'97, pages 84-95. IEEE Computer Society Press, 1997.
    • (1997) Proc. of the 10th CSFW'97 , pp. 84-95
    • Paulson, L.1
  • 20
    • 84974554584 scopus 로고
    • Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack
    • C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, pages 433-444, 1992.
    • (1992) CRYPTO'91 , pp. 433-444
    • Rackoff, C.1    Simon, D.2
  • 21
    • 0034822801 scopus 로고    scopus 로고
    • Protocol insecurity with finite number of sessions is NP-complete
    • IEEE Computer Society Press
    • M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. of the 14th CSFW'01, pages 174-190. IEEE Computer Society Press, 2001.
    • (2001) Proc. of the 14th CSFW'01 , pp. 174-190
    • Rusinowitch, M.1    Turuani, M.2
  • 22
    • 6744240283 scopus 로고
    • The design and implementation of an authentication system for the wide area distributed environment
    • November
    • S. Yamaguchi, K. Okayama, and H. Miyahara. The design and implementation of an authentication system for the wide area distributed environment. IEICE Transactions on Information and Systems, November 1991.
    • (1991) IEICE Transactions on Information and Systems
    • Yamaguchi, S.1    Okayama, K.2    Miyahara, H.3


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