New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2013.03.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092529344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret-Sharing Schemes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the information rate of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the information rate of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions and secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of ideal secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some improved bounds on the information rate of perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An impossibility result on graph secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New efficient and practical verifiable multi-secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the information rate of perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong \((n, t, n)\) verifiable secret sharing scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ideal multi-secret sharing scheme based on MSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect secret sharing schemes on five participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold cryptography based on Asmuth-Bloom secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted threshold secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes with bipartite access structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visual multiple secret sharing based upon turning and flipping / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explication of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic visual secret sharing schemes for grey-scale images and color images / rank
 
Normal rank

Latest revision as of 19:05, 10 July 2024

scientific article
Language Label Description Also known as
English
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
scientific article

    Statements

    New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (English)
    0 references
    0 references
    0 references
    23 September 2015
    0 references
    secret-sharing scheme
    0 references
    access structure
    0 references
    optimal information rate
    0 references
    optimal average information rate
    0 references
    weighted threshold access structure
    0 references
    complete multipartite covering
    0 references

    Identifiers