Nearly optimal robust secret sharing (Q1999899): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129006427, #quickstatements; #temporary_batch_1723941302328
 
(3 intermediate revisions by 3 users not shown)
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-018-0578-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2898633823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Secret Sharing Schemes Against Local Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essentially Optimal Robust Secret Sharing with Maximal Corruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic Security for the Wiretap Channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation and Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally-Secure Robust Secret Sharing with Compact Shares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast channels with confidential messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes for list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Results in List Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Cheaters without an Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a special class of wiretap channels (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explication of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Function Fields and Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wire-Tap Channel / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129006427 / rank
 
Normal rank

Latest revision as of 01:41, 18 August 2024

scientific article
Language Label Description Also known as
English
Nearly optimal robust secret sharing
scientific article

    Statements

    Nearly optimal robust secret sharing (English)
    0 references
    0 references
    27 June 2019
    0 references
    coding and information theory
    0 references
    cryptography
    0 references
    algebraic coding theory
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers