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

An ID-based efficient signcryption key encapsulation 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
$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

3 Author(s)
Xin Lai ; Inf. Security & Nat. Comput. Grid Lab., South West Jiao Tong Univ., Chengdu ; Xiaofang Huang ; Dake He

Based on bilinear maps and associated groups hard problems a scheme of ID-based signcryption key encapsulation is proposed. Security properties of proposed scheme are proven in random oracle model. The proposed scheme is ID-IND-CCA secure in confidentiality and ID-UF-CMA secure in unforgeability. Owing to Sakai-Kasahara identity based keys contracture no paring computing and no MapTo- Point hash function are required in the encapsulation phase of proposed scheme. According to the recent advances in pairings optimized computing and point reduction, our scheme is not only security but also have advantage on performance.

Published in:

Biometrics and Security Technologies, 2008. ISBAST 2008. International Symposium on

Date of Conference:

23-24 April 2008

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.