LEADER 02943nam  2200589 a 450 
001 9910781756303321
005 20230725051419.0
010   $a6613289612
010   $a1-283-28961-X
010   $a9786613289612
010   $a1-60750-714-5
035   $a(CKB)2550000000050095
035   $a(EBL)784604
035   $a(OCoLC)756484738
035   $a(SSID)ssj0000590482
035   $a(PQKBManifestationID)12179840
035   $a(PQKBTitleCode)TC0000590482
035   $a(PQKBWorkID)10671611
035   $a(PQKB)10192034
035   $a(MiAaPQ)EBC784604
035   $a(Au-PeEL)EBL784604
035   $a(CaPaEBR)ebr10506344
035   $a(CaONFJC)MIL328961
035   $a(EXLCZ)992550000000050095
100   $a20110222d2011      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 00$aFormal models and techniques for analyzing security protocols$b[electronic resource] /$fedited by Ve?ronique Cortier and Steve Kremer
210   $aWashington, D.C. $cIOS Press$d2011
215   $a1 online resource (312 p.)
225 1 $aCryptology and information security series,$x1871-6431 ;$vv. 5
300   $aDescription based upon print version of record.
311   $a1-60750-713-7 
320   $aIncludes bibliographical references and index.
327   $aTitle page; Preface; Contents; Introduction; Verifying a Bounded Number of Sessions and Its Complexity; Constraint Solving Techniques and Enriching the Model with Equational Theories; Analysing Security Protocols Using CSP; Using Horn Clauses for Analyzing Security Protocols; Applied pi Calculus; Types for Security Protocols; Protocol Composition Logic; Shapes: Surveying Crypto Protocol Runs; Security Analysis Using Rank Functions in CSP; Computational Soundness - The Case of Diffie-Hellman Keys; Author Index
330   $aSecurity protocols are the small distributed programs which are omnipresent in our daily lives in areas such as online banking and commerce and mobile phones. Their purpose is to keep our transactions and personal data secure. Because these protocols are generally implemented on potentially insecure networks like the internet, they are notoriously difficult to devise. The field of symbolic analysis of security protocols has seen significant advances during the last few years. There is now a better understanding of decidability and complexity questions and successful automated tools for the pro
410  0$aCryptology and information security series ;$vv. 5.
606   $aComputer security
615  0$aComputer security.
676   $a005.8
701   $aCortier$b Ve?ronique$0606143
701   $aKremer$b Steve$01482535
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910781756303321
996   $aFormal models and techniques for analyzing security protocols$93700215
997   $aUNINA