: Kim-Kwang Raymond Choo
: Secure Key Establishment
: Springer-Verlag
: 9780387879697
: Advances in Information Security
: 1
: CHF 85.50
:
: Informatik
: English
: 216
: Wasserzeichen/DRM
: PC/MAC/eReader/Tablet
: PDF

Research on Secure Key Establishment has become very active within the last few years. Secure Key Establishment discusses the problems encountered in this field. This book also introduces several improved protocols with new proofs of security.

Secure Key Establishment identifies several variants of the key sharing requirement. Several variants of the widely accepted Bellare and Rogaway (1993) model are covered. A comparative study of the relative strengths of security notions between these variants of the Bellare-Rogaway model and the Canetti-Krawczyk model is included. An integrative framework is proposed that allows protocols to be analyzed in a modified version of the Bellare-Rogaway model using the automated model checker tool.

Secure Key Establishment is designed for advanced level students in computer science and mathematics, as a secondary text or reference book. This book is also suitable for practitioners and researchers working for defense agencies or security companies.

Foreword6
Preface8
Comments and Errata9
Acknowledgements10
Contents12
List of Protocols18
List of Attacks20
List of Figures21
List of Tables22
Introduction23
1.1 The Key Distribution Problem23
1.2 Solution: Key Establishment Protocols25
1.2.1 Computer Security Approach26
1.2.2 Computational Complexity Approach27
1.2.3 Research Objectives and Deliverables28
1.3 Structure of Book and Contributions to Knowledge28
References32
Background Materials41
2.1 Mathematical Background41
2.1.1 Abstract Algebra and the Main Groups41
2.1.2 Bilinear Maps from Elliptic Curve Pairings42
2.1.3 Computational Problems and Assumptions43
2.1.4 Cryptographic Tools45
2.2 Key Establishment Protocols and their Basis51
2.2.1 Protocol Architectures52
2.2.2 Protocol Goals and Attacks55
2.3 The Computational Complexity Approach60
2.3.1 Adversarial Powers61
2.3.2 Definition of Freshness63
2.3.3 Definition of Security63
2.3.4 The BellareÒRogaway Models64
2.3.5 The CanettiÒKrawczyk Model68
2.3.6 Protocol Security70
2.4 Summary71
References71
A Flawed BR95 Partnership Function78
3.1 A Flaw in the Security Proof for 3PKD Protocol79
3.1.1 The 3PKD Protocol79
3.1.2 Key Replicating Attack on 3PKD Protocol80
3.1.3 The Partner Function used in the BR95 Proof81
3.2 A Revised 3PKD Protocol in Bellare Rogaway Model83
3.2.1 Defining SIDs in the 3PKD Protocol83
3.2.2 An Improved Provably Secure 3PKD Protocol83
3.2.3 Security Proof for the Improved 3PKD Protocol84
3.3 Summary91
References91
On The Key Sharing Requirement92
4.1 Bellare Rogaway 3PKD Protocol in CK2001 Model93
4.1.1 The 3PKD Protocol93
4.1.2 New Attack on 3PKD Protocol94
4.1.3 A New Provably-Secure 3PKD Protocol in CK2001 Model95
4.2 Jeong Katz Lee ProtocolT S297
4.2.1 ProtocolT S297
4.2.2 New Attack on ProtocolT S298
4.2.3 An Improved ProtocolT S298
4.3 The Key Sharing Requirement99
4.4 Summary101
References101
Comparison of Bellare Rogaway and Canetti Krawczyk Models104
5.1 Relating The Notions of Security107
5.1.1 Proving BR93 (EA+KE) . BPR2000 ( EA+ KE)109
5.1.2 Proving CK2001 . BPR2000 ( KE)111
5.1.3 Proving CK2001 . BR93 ( KE)112
5.1.4 BR93 (KE) . BR95 and BR93 ( KE), CK2001 BR95113
5.1.5 BR93 (KE) / CK2001 BPR2000 (KE)114
5.1.6 CK2001 BR93 (EA+KE)114
5.1.7 BR93 (KE) CK2001115
5.1.8 BPR2000 (KE) BR95117
5.2 A Drawback in the BPR2000 Model117
5.2.1 Case Study: AbdallaÒPointcheval 3PAKE117
5.2.2 Unknown Key Share Attack on 3PAKE118
5.3 Summary120
References120
An Extension to the Bellare Rogaway Model122
6.1 A Provably-Secure Revised Protocol of Boyd123
6.1.1 Secure Authenticated Encryption Schemes123
6.1.2 Revised Protocol of Boyd124
6.1.3 Security Proof125
6.2 An Extension to the BR93 Model129
6.3 An Efficient Protocol in Extended Model131
6.3.1 An Efficient Protocol131
6.3.2 Security Proof132
6.4 Comparative Security and Efficiency135
6.5 Summary136
References137
A Proof of Revised Yahalom Protocol138
7.1 The Yahalom Protocol and its Simplified Version139
7.2 A New Provably-Secure Protocol140
7.2.1 Proof for Protocol 7.2141
7.2.2 An Extension to Protocol 7.2144
7.3 Partnering Mechanism: A Brief Discussion145
7.4 Summary147
References148
Errors in Computational Complexity Proofs for Protocols150
8.1 Boyd Gonz ´ alez Nieto Protocol151
8.1.1 Unknown Key Share Attack on Protocol152