Secret sharing schemes with partial broadcast channels

DOI10.1007/S10623-006-0027-1MaRDI QIDQ851779zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Secret sharingCover-free familyPartial broadcastPerfect hash-family

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 7706042
• Broadcast encryption scheme based on secret sharing
• Secret sharing schemes with applications in security protocols
• On secret sharing schemes
• Secret-Sharing Schemes: A Survey
• scientific article; zbMATH DE number 1759657
• scientific article; zbMATH DE number 5657623
• Broadcast (and round) efficient verifiable secret sharing
• scientific article; zbMATH DE number 1303145
• Secret sharing schemes with bipartite access structure

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 1263179 (Why is no real title available?)
• scientific article; zbMATH DE number 1462939 (Why is no real title available?)
• An explication of secret sharing schemes
• Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures
• Constructions of authentication codes from algebraic curves over finite fields
• Explicit construction of exponential sized families of k-independent sets
• Families of finite sets in which no set is covered by the union of \(r\) others
• Graph decompositions and secret sharing schemes
• How to share a secret
• New hash functions and their use in authentication and set equality
• On secret sharing systems
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the size of shares for secret sharing schemes
• On the upper bound of the size of the \(r\)-cover-free families
• Optimal linear perfect hash families
• Perfect hashing
• Secret Sharing With Public Reconstruction
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Security of Ramp Schemes
• Some new bounds for cover-free families
• Strongly universal hashing and identification codes via channels
• Universal classes of hash functions
• Universal hashing and geometric codes

Cited in

(4)

• scientific article; zbMATH DE number 7706042 (Why is no real title available?)
• Secure Hypergraphs: Privacy from Partial Broadcast
• On Secret Reconstruction in Secret Sharing Schemes
• scientific article; zbMATH DE number 177621 (Why is no real title available?)

This page was built for publication: Secret sharing schemes with partial broadcast channels

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