
Formal Correctness of Security Protocols
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
Computer network security is critical to fraud prevention and accountability. Network participants are required to observe predefined steps called security protocols, whose proof of correctness is evidence that each protocol step preserves some desired properties.
The author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerberos versions, smartcard protocols, non-repudiation protocols, and certified email protocols. The method of analysis, the Inductive Method in the theorem prover Isabelle, turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the protocols analysed are novel and illuminating.
This book will benefit researchers and graduate students in the fields of formal methods, information security, inductive methods, and networking.
Reviews / Votes
From the reviews:
"This book is about the Inductive Method technique for proving the correctness of security protocols. It is very well suited for the reader who wants to know the state of the art of proving protocol security using the Inductive Method and the interactive theorem prover Isabelle. . The book could be used as a textbook on the advanced topics in protocol security. It is highly recommended to the newcomer in the field who wants technical information, and to the researcher in the area . ." (Yongge Wang, Mathematical Reviews, Issue 2008 f)
"In summary, my opinion is that this is a great book in the field of computer security, for the practitioner and theoretician alike, since it provides an ideal mixture of theoretical results and applications of them in real protocol analysis scenarios. The book combines, in an ideal way, the features of a rigorous book and a "cookbook". ... In conclusion, I would strongly recommend this book to people involved in formally proving properties about security protocols as well as students making their first steps in studying such protocols." (Yannis C. Stamatiou, Univ. of Ioannina, Greece, ACM SIGACT News Book Review 41(1) 2010)
"The book addresses the software development theorists interested in both modelling and automatic verification of security protocols. . The present text . includes a valuable contribution devoted to apply the inductive method for verifying properties of real-world communication protocols. . The interested computer scientist . find here valuable hints for future important developments in specifying and verifying secure network communication protocols." (Tudor Balanescu, Zentralblatt MATH, Vol. 1176, 2010)More details
Other editions
Additional editions


Content
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.