On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme (Q2198255): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A modular approach to key safeguarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4379555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive weighted threshold secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chinese remaindering with errors / 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: How to Share a Secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme / rank
 
Normal rank

Revision as of 13:40, 23 July 2024

scientific article
Language Label Description Also known as
English
On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
scientific article

    Statements

    On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme (English)
    0 references
    9 September 2020
    0 references
    secret sharing scheme
    0 references
    Chinese remainder theorem
    0 references
    entropy
    0 references
    asymptotic perfectness
    0 references
    asymptotic idealness
    0 references

    Identifiers