Zobrazeno 1 - 10
of 35
pro vyhledávání: '"cryptographic protocol analysis"'
Autor:
Aparicio Sánchez, Damián
Tesis por compendio
[ES] La herramienta criptográfica Maude-NPA es un verificador de modelos especializado para protocolos de seguridad criptográficos que tienen en cuenta las propiedades algebraicas de un sistema criptográfico. En la literat
[ES] La herramienta criptográfica Maude-NPA es un verificador de modelos especializado para protocolos de seguridad criptográficos que tienen en cuenta las propiedades algebraicas de un sistema criptográfico. En la literat
Externí odkaz:
http://hdl.handle.net/10251/190915
Autor:
DO, MINH CANH
Supervisor:緒方 和博
先端科学技術研究科
博士
先端科学技術研究科
博士
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::0be78d40198c12139fbfd606f3c32bc3
http://hdl.handle.net/10119/18129
http://hdl.handle.net/10119/18129
Publikováno v:
21st International Conference on Cryptology in India, 2020
21st International Conference on Cryptology in India, 2020, Dec 2020, Bangalore, India
CCSW@CCS
Progress in Cryptology – INDOCRYPT 2020 ISBN: 9783030652760
INDOCRYPT
HAL
21st International Conference on Cryptology in India, 2020, Dec 2020, Bangalore, India
CCSW@CCS
Progress in Cryptology – INDOCRYPT 2020 ISBN: 9783030652760
INDOCRYPT
HAL
International audience; Verifpal is a new automated modeling framework and verifier for cryptographic protocols, optimized with heuristics for common-case protocol specifications, that aims to work better for real-world practitioners, students and en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c648021351c634f0eb56c64739c39219
https://hal.archives-ouvertes.fr/hal-03325360/file/2019-971.pdf
https://hal.archives-ouvertes.fr/hal-03325360/file/2019-971.pdf
Autor:
Jonathan K. Millen, Grit Denker
Publikováno v:
Journal of Telecommunications and Information Technology, Iss 4 (2002)
Secure communication generally begins with a~connection establishment phase in which messages are exchanged by client and server protocol software to generate, share, and use secret data or keys. This message exchange is referred to as an authenticat
Externí odkaz:
https://doaj.org/article/cb6e7ef74cc64b0ea58aafe170f2ac8f
Publikováno v:
Journal of Software. 20:3060-3076
Autor:
Santiago Pinazo, Sonia
The area of formal analysis of cryptographic protocols has been an active one since the mid 80’s. The idea is to verify communication protocols that use encryption to guarantee secrecy and that use authentication of data to ensure security. Formal
Externí odkaz:
http://hdl.handle.net/10251/48527
Autor:
Catherine Meadows
Publikováno v:
IEEE Journal on Selected Areas in Communications. 21:44-54
The history of the application of formal methods to cryptographic protocol analysis spans over 20 years and has been showing signs of new maturity and consolidation. Not only have a number of specialized tools been developed, and general-purpose ones
Autor:
Sonia Santiago Pinazo
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
The area of formal analysis of cryptographic protocols has been an active one since the mid 80’s. The idea is to verify communication protocols that use encryption to guarantee secrecy and that use authentication of data to ensure security. Formal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3e39738c1afae3e2ca4cbc2b0eba5a3
http://hdl.handle.net/10251/48527
http://hdl.handle.net/10251/48527
Autor:
Catherine Meadows
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319231648
Logic, Rewriting, and Concurrency
Logic, Rewriting, and Concurrency
In 2003 I published a paper “Formal Methods in Cryptographic Protocol Analysis: Emerging Issues and Trends”, in which I identified the various open problems related to applying formal methods to the analysis of cryptographic protocols as we saw t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d03acb60a7fef6848befea2f5a817ce0
https://doi.org/10.1007/978-3-319-23165-5_22
https://doi.org/10.1007/978-3-319-23165-5_22
Autor:
Deepak Kapur, Paliath Narendran, Serdar Erbatur, Andrew M. Marshall, Catherine Meadows, Christophe Ringeissen
Publikováno v:
Foundations of Software Science and Computation Structures-17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS
Foundations of Software Science and Computation Structures-17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS, Apr 2014, Grenoble, France. pp.15, ⟨10.1007/978-3-642-54830-7_18⟩
Lecture Notes in Computer Science ISBN: 9783642548291
FoSSaCS
Foundations of Software Science and Computation Structures-17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS, Apr 2014, Grenoble, France. pp.15, ⟨10.1007/978-3-642-54830-7_18⟩
Lecture Notes in Computer Science ISBN: 9783642548291
FoSSaCS
International audience; Asymmetric unification is a new paradigm for unification modulo theories that introduces irreducibility constraintson one side of a unification problem. It has important applications in symbolic cryptographic protocol analysis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb136cc8e1ded3607529332508926078
https://hal.inria.fr/hal-01087065
https://hal.inria.fr/hal-01087065