Cryptology ePrint Archive: Report 2002/050

Secret sharing schemes with three or four minimal qualified subsets

Jaume Martí-Farré and Carles Padró

Abstract: In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.

Category / Keywords: cryptographic protocols / secret sharing schemes, information rate, ideal secret sharing schemes, linear secret sharing schemes

Date: received 19 Apr 2002

Contact author: matcpl at mat upc es

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20020419:185712 (All versions of this report)

Short URL: ia.cr/2002/050

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]