Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
Property / DOI
 
Property / DOI: 10.22108/toc.2021.123661.1739 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doaj.org/article/3d0d0b1c9770463e9ed508c1b1af60e6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3136711570 / rank
 
Normal rank
Property / title
 
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (English)
Property / title: Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal information ratio of secret sharing schemes on Dutch windmill graphs / 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: 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: Optimal Information Rate of Secret Sharing Schemes on Trees / 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: Secret sharing schemes with three or four minimal qualified subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on secret sharing schemes with three homogeneous access structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal secret sharing schemes whose minimal qualified subsets have at most three participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes on access structures with intersection number equal to one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes on sparse homogeneous access structures with rank three / 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: Lower bounds on the information rate of secret sharing schemes with homogeneous 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: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipartite secret sharing by bivariate interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical threshold secret sharing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.22108/TOC.2021.123661.1739 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:25, 30 December 2024

scientific article; zbMATH DE number 7391653
Language Label Description Also known as
English
Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
scientific article; zbMATH DE number 7391653

    Statements

    0 references
    0 references
    0 references
    6 September 2021
    0 references
    cryptography
    0 references
    secret sharing
    0 references
    ideal access structures
    0 references
    graph-based access structures
    0 references
    3-homogeneous access structures
    0 references
    Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (English)
    0 references

    Identifiers