Optimal assignment schemes for general access structures based on linear programming (Q2260793): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-013-9879-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-013-9879-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033171033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / 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: Q4288075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret sharing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of shares for secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of a share must be large / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security of Ramp Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202940 / 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: Graph decompositions and 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: On the information rate of perfect secret sharing schemes / 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: A general decomposition construction for incomplete secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q4281571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4853712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally ideal secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids Can Be Far from Ideal Secret Sharing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-013-9879-3 / rank
 
Normal rank

Latest revision as of 17:46, 17 December 2024

scientific article
Language Label Description Also known as
English
Optimal assignment schemes for general access structures based on linear programming
scientific article

    Statements

    Optimal assignment schemes for general access structures based on linear programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 March 2015
    0 references
    secret sharing
    0 references
    ramp assignment scheme
    0 references
    multiple assignment scheme
    0 references
    information rate
    0 references
    linear programming
    0 references
    integer programming
    0 references

    Identifiers