By Topic

MDS secret-sharing scheme secure against cheaters

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)
Okada, K. ; Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan ; Kurosawa, K.

For the problem of cheaters in secret-sharing schemes, we introduce dcheat which is more appropriate than the minimum Hamming distance dmin of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d min⩽dcheat=n-max/B∉Γ|B| where Γ denotes the access structure

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )