Generalised cumulative arrays in secret sharing

DOI10.1007/S10623-006-0007-5MaRDI QIDQ851749zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 22 November 2006

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-006-0007-5

zbMATH Keywords

secret sharingperfect hash familycumulative array

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1023998
• scientific article; zbMATH DE number 1189397
• Cheating-immune secret sharing schemes from codes and cumulative arrays
• Secret sharing schemes with general access structures
• A generalization of Mignotte's secret sharing scheme
• Secret-sharing schemes for general and uniform access structures
• Secret sharing schemes on general access structures.
• Several Generalizations of Shamir's Secret Sharing Scheme
• scientific article; zbMATH DE number 2108154
• scientific article; zbMATH DE number 2020870

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 1284201 (Why is no real title available?)
• scientific article; zbMATH DE number 1962157 (Why is no real title available?)
• A Proof of the Arithmetic Mean-Geometric Mean Inequality
• An explication of secret sharing schemes
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Distributing the encryption and decryption of a block cipher
• Explicit construction of exponential sized families of k-independent sets
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Families of finite sets in which no set is covered by the union of \(r\) others
• Geometric secret sharing schemes and their duals
• How to share a secret
• Introduction to algorithms.
• Multiple assignment scheme for sharing secret
• Nonrandom binary superimposed codes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect hashing
• Robust information-theoretic private information retrieval
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some new bounds for cover-free families

Cited in

(5)

• Anonymity in shared symmetric key primitives
• The combinatorics of generalised cumulative arrays
• Cheating-immune secret sharing schemes from codes and cumulative arrays
• Shared generation of pseudo-random functions
• An unequal probability scheme for improving anonymity in shared key operations

This page was built for publication: Generalised cumulative arrays in secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851749)