• [email protected]
  • +971 507 888 742
Submit Manuscript
SciAlert
  • Home
  • Journals
  • Information
    • For Authors
    • For Referees
    • For Librarian
    • For Societies
  • Contact
  1. Information Technology Journal
  2. Vol 8 (3), 2009
  3. 302-309
  • Online First
  • Current Issue
  • Previous Issues
  • More Information
    Aims and Scope Editorial Board Guide to Authors Article Processing Charges
    Submit a Manuscript

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

Article Trend



Total views 289

Search


Authors


Bo Meng

Country: China

Keywords


  • strong physical assumption
  • receipt-freeness
  • cryptography
  • mutual authentication
  • Security protocol
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

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

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
Automatic Verification of Security Properties of Remote Internet Voting Protocol in Symbolic Model

Leave a Comment


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

Useful Links

  • Journals
  • For Authors
  • For Referees
  • For Librarian
  • For Socities

Contact Us

Office Number 1128,
Tamani Arts Building,
Business Bay,
Deira, Dubai, UAE

Phone: +971 507 888 742
Email: [email protected]

About Science Alert

Science Alert is a technology platform and service provider for scholarly publishers, helping them to publish and distribute their content online. We provide a range of services, including hosting, design, and digital marketing, as well as analytics and other tools to help publishers understand their audience and optimize their content. Science Alert works with a wide variety of publishers, including academic societies, universities, and commercial publishers.

Follow Us
© Copyright Science Alert. All Rights Reserved