Submit Manuscript

Information Technology Journal

Year: 2009 | Volume: 8 | Issue: 5 | Page No.: 625-642
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 400

Search

Authors

Bo Meng

Keywords

Research Article

Formalizing Deniability

Bo Meng
A formal framework of deniability in the deniable authentication protocol is presented. By introducing Kessler and Neumann logic as a tool, the proposed framework formalizes the strong deniability and weak deniability, which are the key properties in the deniable authentication protocol. The formal framework establishes what can construct an evidence of deniability. Based on the construction, the simple and easy to be applied framework enables the identification of deniability and provides a heuristic to take evidence of deniability into consideration in the early stages of designing a deniable authentication protocol. Two typical deniable authentication protocols, including a interactive and a non-interactive one are analyzed by both informal method and the proposed formal framework.
PDF Fulltext XML References Citation

Related Articles

Computationally Sound Mechanized Proofs for Deniable Authentication Protocols with a Probabilistic Polynomial Calculus in Computational Model
Automatic Verification of Deniable Authentication Protocol in a Probabilistic Polynomial Calculus with Cryptoverif
Impact of Data Privacy and Confidentiality on Developing Telemedicine Applications: A Review Participates Opinion and Expert Concerns
A Survey on Analysis of Selected Cryptographic Primitives and Security Protocols in Symbolic Model and Computational Model
A Secure Non-Interactive Deniable Authentication Protocol with Strong Deniability Based on Discrete Logarithm Problem and its Application on Internet Voting Protocol
Formal Analysis of Key Properties in the Internet Voting Protocol Using Applied Pi Calculus

Leave a Comment

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