Title :
A strong ramp secret sharing scheme using matrix projection
Author_Institution :
Dept. of Electr. & Comput. Eng., Temple Univ., Philadelphia, PA
Abstract :
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
Keywords :
matrix algebra; telecommunication security; matrix projection technique; ramp secret sharing scheme; square matrix representation; Collaboration; Costs; Cryptography; Degradation; Information entropy; Pervasive computing; Protection; Time sharing computer systems; Ubiquitous computing; Uncertainty;
Conference_Titel :
World of Wireless, Mobile and Multimedia Networks, 2006. WoWMoM 2006. International Symposium on a
Conference_Location :
Buffalo-Niagara Falls, NY
Print_ISBN :
0-7695-2593-8
DOI :
10.1109/WOWMOM.2006.17
