Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
Proceedings of CRYPTO 84 on Advances in cryptology
Introduction to algorithms
An explication of secret sharing schemes
Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Theoretical Computer Science
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Communications of the ACM
Perfect hash families: probabilistic methods and explicit constructions
Journal of Combinatorial Theory Series A
Explicit constructions of perfect hash families from algebraic curves over finite fields
Journal of Combinatorial Theory Series A
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Cumulative Arrays and Geometric Secret Sharing Schemes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Distributing the Encryption and Decryption of a Block Cipher
Designs, Codes and Cryptography
Efficient multiplicative sharing schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Robust information-theoretic private information retrieval
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Shared generation of pseudo-random functions with cumulative maps
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Hi-index | 0.00 |
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.