Handbook of Formal Analysis and Verification in Cryptography

1. Auflage 2024
ISBN: 978-0-367-54666-3
Verlag: Taylor & Francis Ltd (Sales)

Buch, Englisch, 444 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 621 g

Reihe: Prospects in Pure and Applied Mathematics

This handbook of formal analysis in cryptography is very important for secure communication and processing of information. It introduces readers to several formal verification methods and software used to analyse cryptographic protocols. The chapters give readers general knowledge and formal methods focusing on cryptographic protocols.

Handbook of Formal Analysis and Verification in Cryptography includes major formalisms and tools used for formal verification of cryptography, with a spotlight on new-generation cryptosystems such as post-quantum, and presents a connection between formal analysis and cryptographic schemes. The text offers formal methods to show whether security assumptions are valid and compares the most prominent formalism and tools as they outline common challenges and future research directions.

Graduate students, researchers, and engineers worldwide will find this an exciting read.

Zielgruppe

Professional and Undergraduate Advanced

Autoren/Hrsg.

Akleylek, Sedat

Dundua, Besik

Fachgebiete

• Mathematik | Informatik Mathematik Mathematische Analysis
• Technische Wissenschaften Technik Allgemein Industrial Engineering
• Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung
• Technische Wissenschaften Maschinenbau | Werkstoffkunde Produktionstechnik Fertigungstechnik

Inhaltsverzeichnis

1. Development of Cryptography since Shannon. 2. Introduction to Formal Methods for the Analysis and Design of Protocols. 3. An Introduction to Tools for Formal Analysis of Cryptographic Protocols. 4. Formal Verification of Cryptographic Protocols with Isabelle/HOL. 5. Formal Modelling and Security Analysis of Security Protocols. 6. Cryptographic Web Applications: from Security Engineering to Formal Analysis. 7. Formal Methods for Quantum Algorithms.

Über Autor(innen)

Sedat Akleylek received the B.Sc. degree in Mathematics majored in Computer Science from Ege University in 2004 in Izmir, Turkey, M.Sc. and Ph.D. degrees in Cryptography from Middle East Technical University in 2008 and 2010, in Ankara, Turkey, respectively. He is currently employed as an associate professor at the Department of Computer Engineering, Ondokuz Mayis University, Samsun, Turkey since 2016. His research interests include in the areas of post-quantum cryptography, algorithms, cryptographic protocols, and architectures for computations in finite fields. He has published more than 20 papers on those topics and presented his work at more than 45 conference papers. He is involved in several nationally and internationally funded research projects on cryptography focusing post-quantum ones.

Besik Dundua is an expert in formal methods. He received his PhD degree from the University of Porto in computer science. Afterwards, he worked as a postdoc and visiting researcher in Brazil (University of Brasilia), Austria (Johannes Kepler University Linz), and Germany (The University of Stuttgart). His work concerns various aspects of verification, computational logic, and formal languages: foundational formalisms, computational mechanisms, and implementation ideas. He has published more than 20 papers on those topics and presented his work at more than 30 conference.