Generalised cumulative arrays in secret sharing

Shoulun Long, Josef Pieprzyk, Huaxiong Wang*, Duncan S. Wong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Cumulative arrays have played an important role in the early development of the secret sharing theory. They have not been subject to extensive study so far, as the secret sharing schemes built on them generally result in much larger sizes of shares, when compared with other conventional approaches. Recent works in threshold cryptography show that cumulative arrays may be the appropriate building blocks in non-homomorphic threshold cryptosystems where the conventional secret sharing methods are generally of no use. In this paper we study several extensions of cumulative arrays and show that some of these extensions significantly improve the performance of conventional cumulative arrays. In particular, we derive bounds on generalised cumulative arrays and show that the constructions based on perfect hash families are asymptotically optimal. We also introduce the concept of ramp perfect hash families as a generalisation of perfect hash families for the study of ramp secret sharing schemes and ramp cumulative arrays.

Original languageEnglish
Pages (from-to)191-209
Number of pages19
JournalDesigns, Codes and Cryptography
Volume40
Issue number2
DOIs
Publication statusPublished - Aug 2006

Fingerprint Dive into the research topics of 'Generalised cumulative arrays in secret sharing'. Together they form a unique fingerprint.

Cite this