Cart (Loading....) | Create Account
Close category search window
 

An Efficient Verifiable Implicit Asking Protocol for Diffie-Hellman Key Exchange

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
$31 $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

2 Author(s)
Oishi, K. ; Grad. Sch. of Environ. & Inf. Sci., Yokohama Nat. Univ., Yokohama, Japan ; Matsumoto, T.

An efficient verifiable implicit asking (VIA) protocol for Diffie-Hellman key exchange and its improvement are proposed. The proposed protocol utilizes an existing efficient implicit asking protocol for secret computation of RSA cryptosystem. The structure of the proposed protocol makes it resistant to both active and passive attacks. An known passive attack that decreases efficiency is not applied to the proposed protocol and the efficiency of the existing protocol is not sacrificed. When the required security is determined as the complexity in exhaustive searching of 2112, the proposed protocol can execute Diffie-Hellman key exchange with 108 modular multiplications.

Published in:

Lightweight Security & Privacy: Devices, Protocols and Applications (LightSec), 2011 Workshop on

Date of Conference:

14-15 March 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.