Cryptology ePrint Archive: Report 2012/534

A Simple Combinatorial Treatment of Constructions and Threshold Gaps of Ramp Schemes

Maura B. Paterson and Douglas R. Stinson

Abstract: We give easy proofs of some recent results concerning threshold gaps in ramp schemes. We then generalise a construction method for ramp schemes employing error-correcting codes so that it can be applied using nonlinear (as well as linear) codes. Finally, as an immediate consequence of these results, we provide a new explicit bound on the the minimum length of a code having a specified distance and dual distance.

Category / Keywords: foundations / secret sharing

Publication Info: submitted for publication

Date: received 10 Sep 2012, last revised 7 Nov 2012

Contact author: dstinson at uwaterloo ca

Available format(s): PDF | BibTeX Citation

Note: In this version, we have added some additional references and discussion to clarify various aspects of the paper.

Version: 20121107:154436 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]