By Topic

A strong ramp secret sharing scheme using matrix projection

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

1 Author(s)
Li Bai ; Dept. of Electr. & Comput. Eng., Temple Univ., Philadelphia, PA

This paper presents a strong (k,n) threshold-based ramp secret sharing scheme with k access levels. The secrets are the elements represented in a square matrix S. The secret matrix S can be shared among n different participants using a matrix projection technique where: i) any subset of k participants can collaborate together to reconstruct the secret, and ii) any subset of (k-1) or fewer participants cannot partially discover the secret matrix. The primary advantages are its large compression rate on the size of the shares and its strong protection of the secrets

Published in:

World of Wireless, Mobile and Multimedia Networks, 2006. WoWMoM 2006. International Symposium on a

Date of Conference:

0-0 0