RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS (Q5401562): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes from three classes of linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Utility dependence in correct and fair rational secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank

Latest revision as of 10:21, 7 July 2024

scientific article; zbMATH DE number 6266671
Language Label Description Also known as
English
RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS
scientific article; zbMATH DE number 6266671

    Statements

    RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS (English)
    0 references
    0 references
    0 references
    10 March 2014
    0 references
    cryptography
    0 references
    game theory
    0 references
    rational secret sharing
    0 references
    point-to-point
    0 references
    authenticated
    0 references
    Byzantine agreement
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references