Cryptology ePrint Archive: Report 2016/348

A Note on Non-Perfect Secret Sharing

Oriol Farrās and Sebastiā Martín and Carles Padrķ

Abstract: By using a recently introduced framework for non-perfect secret sharing, several known results on perfect secret sharing are generalized to non-perfect secret sharing schemes with constant increment, in which the amount of information provided by adding a single share to a set is either zero or some constant value. Specifically, we discuss ideal secret sharing schemes, constructions of efficient linear secret sharing schemes, and the search for lower bounds on the length of the shares. Similarly to perfect secret sharing, matroids and polymatroids are very useful to analyze these questions.

Category / Keywords: cryptographic protocols / Secret sharing, Non-perfect secret sharing, Information Ratio, Polymatroid

Date: received 1 Apr 2016, last revised 4 Feb 2017

Contact author: oriol farras at urv cat

Available format(s): PDF | BibTeX Citation

Version: 20170204:220056 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]