Secret sharing schemes with partial broadcast channels
From MaRDI portal
Publication:851779
DOI10.1007/s10623-006-0027-1zbMath1205.94110OpenAlexW2009273835MaRDI QIDQ851779
Huaxiong Wang, Reihaneh Safavi-Naini
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-0027-1
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- 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
- New hash functions and their use in authentication and set equality
- An explication of secret sharing schemes
- Universal classes of hash functions
- Optimal linear perfect hash families
- On the size of shares for secret sharing schemes
- On the upper bound of the size of the \(r\)-cover-free families
- Universal hashing and geometric codes
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Graph decompositions and secret sharing schemes
- Some new bounds for cover-free families
- Security of Ramp Schemes
- On the Size of Separating Systems and Families of Perfect Hash Functions
- How to share a secret
- Strongly universal hashing and identification codes via channels
- Constructions of authentication codes from algebraic curves over finite fields
- Secret Sharing With Public Reconstruction
- On secret sharing systems
- Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures
This page was built for publication: Secret sharing schemes with partial broadcast channels
