Submit Manuscript

Information Technology Journal

Year: 2011 | Volume: 10 | Issue: 6 | Page No.: 1068-1091
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 618

Search

Authors

Bo Meng

Keywords

Review Article

A Survey on Analysis of Selected Cryptographic Primitives and Security Protocols in Symbolic Model and Computational Model

Bo Meng
Security protocols and cryptographic primitive play a very important role in information security world. People have paid a serious attention to the methods to verify security properties in security protocols and cryptographic primitives. From 1980's two distinct approaches: Symbolic approach and computational approach have been proposedd for it. Recently, significant advances have been made in verification on security properties in security protocols and cryptographic primitives and these two approaches. In this study we survey the existing results on the fields including symmetric encryption, public key encryption, digital signature, hush function, secrecy, key cycles, information flow, secrecy, automatic proof, deniable authentication protocol, electronic payment protocol and internet voting protocol in symbolic model and computational model. The survey processes in two lines: One line follows the trace of emergence and developments of verification on security properties in security protocols and cryptographic primitives. The other line is to discuss what methods are usedd and how to verify these security properties during the developments. Finally we give the existing results on verification on security properties in security protocols and cryptographic primitives in symbolic model and computational model.
PDF Fulltext XML References Citation

Related Articles

Mechanized Verification of Security Properties of Transport Layer Security 1.2 Protocol with Crypto Verif in Computational Model
Automatic Verification of Security Properties of OAuth 2.0 Protocol with Cryptoverif in Computational Model
UC Secure Network Coding Against Pollution Attacks
Two-layer Cellular Automata Based Cryptography
Automated Proof of Resistance of Denial of Service Attacks in Remote Internet Voting Protocol with Extended Applied Pi Calculus
Formalizing Deniability
A Critical Review of Receipt-Freeness and Coercion-Resistance
Automatic Verification of Security Properties of Remote Internet Voting Protocol in Symbolic Model
Refinement of Mechanized Proof of Security Properties of Remote Internet Voting Protocol in Applied PI Calculus with Proverif
Computationally Sound Mechanized Proofs for Deniable Authentication Protocols with a Probabilistic Polynomial Calculus in Computational Model

Leave a Comment

Your email address will not be published. Required fields are marked *