A client puzzle based public-key authentication and key establishment protocol.

Fung Chun-Kan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2002.Includes bibliographical references (leaves 105-114).Abstracts in English and Chinese.Abstract --- p.iAcknowledgements --- p.ivList of Figures --- p.viiiList of Tables --- p.xChapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivations and Objectives --- p.1Chapter 1.2 --- Authentication Protocol --- p.3Chapter 1.3 --- Security Technologies --- p.5Chapter 1.3.1 --- Cryptography --- p.5Chapter 1.3.2 --- Digital Certificate --- p.7Chapter 1.3.3 --- One-way Hash Function --- p.8Chapter 1.3.4 --- Digital Signature --- p.9Chapter 1.4 --- Thesis Organization --- p.9Chapter 2 --- Related Work --- p.11Chapter 2.1 --- Introduction --- p.11Chapter 2.2 --- Authentication and Key Establishment Protocols --- p.11Chapter 2.3 --- Denial-of-Service Attack Handling Methods --- p.15Chapter 2.4 --- Attacks on Authentication and Key Establishment Protocol --- p.18Chapter 2.4.1 --- Denial-of-Service Attack --- p.19Chapter 2.4.2 --- Replay Attack --- p.19Chapter 2.4.3 --- Man-in-the middle Attack --- p.21Chapter 2.4.4 --- Chosen-text Attack --- p.22Chapter 2.4.5 --- Interleaving Attack --- p.23Chapter 2.4.6 --- Reflection Attack --- p.25Chapter 2.5 --- Summary --- p.27Chapter 3 --- A DoS-resistant Authentication and Key Establishment Protocol --- p.29Chapter 3.1 --- Introduction --- p.29Chapter 3.2 --- Protocol Notations --- p.30Chapter 3.3 --- Protocol Descriptions --- p.30Chapter 3.4 --- An Improved Client Puzzle Protocol --- p.37Chapter 3.4.1 --- Review of Juels-Brainard Protocol --- p.37Chapter 3.4.2 --- Weaknesses of Juels-Brainard Protocol and Proposed Improvements --- p.39Chapter 3.4.3 --- Improved Client Puzzle Protocol --- p.42Chapter 3.5 --- Authentication Framework --- p.43Chapter 3.5.1 --- Client Architecture --- p.44Chapter 3.5.2 --- Server Architecture --- p.47Chapter 3.6 --- Implementations --- p.49Chapter 3.6.1 --- Software and Programming Tools --- p.49Chapter 3.6.2 --- The Message Formats --- p.50Chapter 3.5.3 --- Browser Interface --- p.51Chapter 3.6.4 --- Calculation of the Difficulty Level --- p.53Chapter 3.6.5 --- "(C, t) Non-Existence Verification" --- p.56Chapter 3.7 --- Summary --- p.57Chapter 4 --- Security Analysis and Formal Proof --- p.58Chapter 4.1 --- Introduction --- p.58Chapter 4.2 --- Security Analysis --- p.59Chapter 4.2.1 --- Denial-of-Service Attacks --- p.59Chapter 4.2.2 --- Replay Attacks.........； --- p.60Chapter 4.2.3 --- Chosen-text Attacks --- p.60Chapter 4.2.4 --- Interleaving Attacks --- p.61Chapter 4.2.5 --- Others --- p.62Chapter 4.3 --- Formal Proof Methods --- p.62Chapter 4.3.1 --- General-purpose Specification Languages and Verification Tools --- p.62Chapter 4.3.2 --- Expert System Approach --- p.63Chapter 4.3.3 --- Modal Logic Approach --- p.64Chapter 4.3.4 --- Algebraic Term-Rewriting Approach --- p.66Chapter 4.4 --- Formal Proof of the Proposed Protocol --- p.66Chapter 4.4.1 --- Notations --- p.67Chapter 4.4.2 --- The Proof --- p.68Chapter 4.5 --- Summary --- p.73Chapter 5 --- Experimental Results and Analysis --- p.75Chapter 5.1 --- Introduction --- p.75Chapter 5.2 --- Experimental Environment --- p.75Chapter 5.3 --- Experiments --- p.77Chapter 5.3.1 --- Computational Performance of the Puzzle Solving Operation at different Difficulty Levels --- p.77Chapter 5.3.2 --- Computational Performance of the Puzzle Generation and Puzzle Solution Verification --- p.79Chapter 5.3.3 --- Computational Performance of the Protocol Cryptographic Operations --- p.82Chapter 5.3.4 --- Computational Performance of the Overall Protocol Session --- p.84Chapter 5.3.5 --- Impact on the Server Load without Client Puzzles --- p.85Chapter 5.3.6 --- Impact on the Server Load with Client Puzzles --- p.88Chapter 5.3.7 --- Impact on the Server Response Time from the Puzzles --- p.97Chapter 5.4 --- Summary --- p.100Chapter 6 --- Conclusion and Future Work --- p.101Chapter 6.1 --- Concluding Remarks --- p.101Chapter 6.2 --- Contributions --- p.103Chapter 6.3 --- Future Work --- p.104Bibliography --- p.10