Improved Bounds on the Threshold Gap in Ramp Secret Sharing

Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano

Research output: Contribution to journalJournal articleResearchpeer-review

2 Citations (Scopus)
87 Downloads (Pure)

Abstract

In this paper, we consider linear secret sharing schemes over a finite field \mathbb {F}-{q} , where the secret is a vector in \mathbb {F}-{q}^\ell and each of the n shares is a single element of \mathbb {F}-{q}. We obtain lower bounds on the so-called threshold gap g of such schemes, defined as the quantity r-T where r is the smallest number such that any subset of r shares uniquely determines the secret and t is the largest number such that any subset of t shares provides no information about the secret. Our main result establishes a family of bounds which are tighter than previously known bounds for \ell \geq 2. Furthermore, we also provide bounds, in terms of n and q , on the partial reconstruction and privacy thresholds, a more fine-grained notion that considers the amount of information about the secret that can be contained in a set of shares of a given size. Finally, we compare our lower bounds with known upper bounds in the asymptotic setting.

Original languageEnglish
Article number8654006
JournalI E E E Transactions on Information Theory
Volume65
Issue number7
Pages (from-to)4620-4633
Number of pages14
ISSN0018-9448
DOIs
Publication statusPublished - 1 Jul 2019

Keywords

  • Cryptography
  • linear codes
  • secret sharing
  • threshold gap

Fingerprint Dive into the research topics of 'Improved Bounds on the Threshold Gap in Ramp Secret Sharing'. Together they form a unique fingerprint.

Cite this