Generalised cumulative arrays in secret sharing
From MaRDI portal
Publication:851749
DOI10.1007/s10623-006-0007-5zbMath1261.94032DBLPjournals/dcc/LongPWW06OpenAlexW1990769071WikidataQ59485057 ScholiaQ59485057MaRDI QIDQ851749
Shoulun Long, Huaxiong Wang, Duncan S. Wong, Josef Pieprzyk
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
Related Items (3)
Anonymity in shared symmetric key primitives ⋮ Cheating-immune secret sharing schemes from codes and cumulative arrays ⋮ An unequal probability scheme for improving anonymity in shared key operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- Explicit construction of exponential sized families of k-independent sets
- An explication of secret sharing schemes
- Multiple assignment scheme for sharing secret
- Geometric secret sharing schemes and their duals
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Perfect hash families: Probabilistic methods and explicit constructions
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Some new bounds for cover-free families
- Distributing the encryption and decryption of a block cipher
- Robust information-theoretic private information retrieval
- On the Size of Separating Systems and Families of Perfect Hash Functions
- How to share a secret
- A Proof of the Arithmetic Mean-Geometric Mean Inequality
- Nonrandom binary superimposed codes
- Explicit constructions of perfect hash families from algebraic curves over finite fields
This page was built for publication: Generalised cumulative arrays in secret sharing
