Nearly optimal robust secret sharing against rushing adversaries (Q2102061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2982521367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local leakage resilience of linear secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret-Sharing Schemes: A Survey / 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: 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: Q4934735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / 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: Nearly optimal robust secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from untrusted data / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a function securely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for semirandom graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust secret sharing with almost optimal share size and security against rushing adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal robust secret sharing with security against a rushing adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleable secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient robust secret sharing from expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the Robust Semi-random Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank

Latest revision as of 01:14, 31 July 2024

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

    Statements

    Nearly optimal robust secret sharing against rushing adversaries (English)
    0 references
    7 December 2022
    0 references
    local authentication of shares
    0 references
    robust secret sharing scheme
    0 references
    0 references
    0 references
    0 references

    Identifiers