Secret sharing schemes with partial broadcast channels

DOI10.1007/S10623-006-0027-1zbMATH Open1205.94110OpenAlexW2009273835MaRDI QIDQ851779FDOQ851779

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

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

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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Secure Hypergraphs: Privacy from Partial Broadcast
• On Secret Reconstruction in Secret Sharing Schemes
• Title not available (Why is that?)

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)