Submit Manuscript

Information Technology Journal

Year: 2009 | Volume: 8 | Issue: 3 | Page No.: 302-309
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 289

Search

Authors

Bo Meng

Keywords

Research Article

A Secure Non-Interactive Deniable Authentication Protocol with Strong Deniability Based on Discrete Logarithm Problem and its Application on Internet Voting Protocol

Bo Meng
In this study, firstly the status and security properties of deniable authentication protocol are discussed and then a secure non-interactive deniable authentication protocol based on discrete logarithm problem is developed. At the same time we prove that the proposed protocol has properties: completeness, strong deniability, weak deniability, security of forgery attack, security of impersonate attack, security of compromising session secret attack and security of man-in-the-middle attack. The security properties of several typical protocols and proposed protocol are compared. Lastly, an application of the proposed protocol, an internet voting protocol with receipt-freeness without strong physical assumption, is provided.
PDF Fulltext XML References Citation

Leave a Comment

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