Generalised cumulative arrays in secret sharing

DOI10.1007/S10623-006-0007-5zbMATH Open1261.94032DBLPjournals/dcc/LongPWW06OpenAlexW1990769071WikidataQ59485057 ScholiaQ59485057MaRDI QIDQ851749FDOQ851749

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

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

zbMATH Keywords

secret sharingperfect hash familycumulative array

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

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

Cited In (5)

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

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)