By Topic

Automated security proof of the ElGamal encryption scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chen Nan ; Zhengzhou Institute of Information Science and Technology, Zhengzhou 450002, China ; Li Anle ; Gu Chunxiang ; Zhu Yuefei

Provable security is one of the important techniques for analyzing the security of the cryptographic protocols, while manual proof is difficult and hard to estimate. Automatical proof with the help of the computers is a hot spot. We designed a tool which can satisfy much more cryptographic protocols for the automatical proof. This paper introduced the framework of the attack game and then two examples was given. We used our tool to prove the semantic security of the encryption scheme ElGamal and its hashed version.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

21-24 May 2010