Back to Search Start Over

Generalised Cumulative Arrays in Secret Sharing

Authors :
Long, Shoulun
Pieprzyk, Josef
Wang, Huaxiong
Wong, Duncan
Source :
Designs, Codes and Cryptography; August 2006, Vol. 40 Issue: 2 p191-209, 19p
Publication Year :
2006

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.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.

Details

Language :
English
ISSN :
09251022 and 15737586
Volume :
40
Issue :
2
Database :
Supplemental Index
Journal :
Designs, Codes and Cryptography
Publication Type :
Periodical
Accession number :
ejs11201392
Full Text :
https://doi.org/10.1007/s10623-006-0007-5