A problem solving mechanism for formal analysis of cryptographic protocols

Authors:
Jihong Han;Yu Zhao;Yadi Wang;Zhiyong Zhou
Affiliations:
; ; ;
Venue:
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Year:
2007

Citing 6
Cited 1

The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Finite-State Analysis of Security Protocols

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Hierarchy of Authentication Specifications

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Cryptographically Sound Theorem Proving

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations

An improved nested partitions algorithm based on simulated annealing in complex decision problem optimization

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes the cryptographic protocol insecurity problem, gives an accurate formal specifications for cryptographic protocols, defines the security properties precisely and reasonably, presents some pivotal concepts and propositions in the deduction of the problem solving. The method has provable semantics which is reasonable and sound, and it is easy to realize automatic deductions.