TEST - Catálogo BURRF
   

Formal Correctness of Security Protocols : With 62 Figures and 4 Tables / by Giampaolo Bella.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Information Security and Cryptography, Texts and MonographsEditor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Descripción: xIx, 274 páginas 62 ilustraciones recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9783540681366
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA8.9-QA10.3
Recursos en línea:
Contenidos:
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.
Resumen: 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.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

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.

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha