Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Information Technology Journal
  Year: 2009 | Volume: 8 | Issue: 3 | Page No.: 302-309
DOI: 10.3923/itj.2009.302.309
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

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

Bo Meng

Abstract:
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 Report Citation
 RELATED ARTICLES:
  •    Automatic Formal Framework of Coercion-resistance in Internet Voting Protocols with CryptoVerif in Computational Model
  •    Automatic Formal Framework of Coercion-resistance in Internet Voting Protocols with CryptoVerif in Computational Model
  •    Formalizing Deniability
  •    A Critical Review of Receipt-Freeness and Coercion-Resistance
How to cite this article:

Bo Meng , 2009. A Secure Non-Interactive Deniable Authentication Protocol with Strong Deniability Based on Discrete Logarithm Problem and its Application on Internet Voting Protocol. Information Technology Journal, 8: 302-309.

DOI: 10.3923/itj.2009.302.309

URL: https://scialert.net/abstract/?doi=itj.2009.302.309

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 

Curve Bottom