By Topic

Self-selecting Sub-secret Keys Sharing Scheme Based on Polynomials over Elliptic Curve

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)
Wang Caimei ; Key Lab. of Network & Intell. Inf. Process., Hefei Univ., Hefei, China ; Li Zhengmao

Traditional secret sharing scheme generally exists two shortages:each participant's sub-secret key is distributed by the certification center; the sub-secret keys can not be repeated to use. Both shortages brought to the practical application a lot of inconvenience, and n sub-secret keys can only be used to share a master key in terms of resources is a waste. This article based on the reference proposed a scheme with sub-secret keys be selected by participants, and those sub-secret keys can be reused. The scheme based on the security of elliptic curve discrete most of the difficult nature is more practical than the reference ,and the realization of the process can solve the problem about the authenticity of the sub-secret keys.

Published in:

Information Assurance and Security, 2009. IAS '09. Fifth International Conference on  (Volume:2 )

Date of Conference:

18-20 Aug. 2009