|
|
|
|
LEADER |
03405nam a22005535i 4500 |
001 |
978-3-540-68136-6 |
003 |
DE-He213 |
005 |
20151204180449.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540681366
|9 978-3-540-68136-6
|
024 |
7 |
|
|a 10.1007/978-3-540-68136-6
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a TK5105.5-5105.9
|
072 |
|
7 |
|a UKN
|2 bicssc
|
072 |
|
7 |
|a COM075000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.6
|2 23
|
100 |
1 |
|
|a Bella, Giampaolo.
|e author.
|
245 |
1 |
0 |
|a Formal Correctness of Security Protocols
|h [electronic resource] :
|b With 62 Figures and 4 Tables /
|c by Giampaolo Bella.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
300 |
|
|
|a XX, 274 p. 64 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Information Security and Cryptography, Texts and Monographs,
|x 1619-7100
|
505 |
0 |
|
|a The Analysis of Security Protocols -- The Inductive Method -- Verifying the Protocol Goals -- The Principle of Goal Availability -- Modelling Timestamping and Verifying a Classical Protocol -- Verifying a Deployed Protocol -- Modelling Agents’ Knowledge of Messages -- Verifying Another Deployed Protocol -- Modelling Smartcards -- Verifying a Smartcard Protocol -- Modelling Accountability -- Verifying Two Accountability Protocols -- Conclusions.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computer communication systems.
|
650 |
|
0 |
|a Computer security.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Electrical engineering.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
650 |
2 |
4 |
|a Systems and Data Security.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Communications Engineering, Networks.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540681342
|
830 |
|
0 |
|a Information Security and Cryptography, Texts and Monographs,
|x 1619-7100
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-68136-6
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
950 |
|
|
|a Computer Science (Springer-11645)
|