Towards breaking the exponential barrier for general secret sharing (Q1648814): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794870184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing Boolean functions as polynomials modulo composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Matching Vector Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret-Sharing Schemes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superpolynomial lower bounds for monotone span programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Nonlinear Secret-Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Complexity of the Worst Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / 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: 2-Server PIR with Sub-Polynomial Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Vector Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Query Locally Decodable Codes of Subexponential Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal model for secure computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protecting data privacy in private information retrieval schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Garbling Schemes and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional disclosure of secrets via non-linear reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret Sharing and Statistical Zero Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of GGH Map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Non-interactive Secure Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomies in the complexity of solving systems of equations over finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of squares lower bounds for refuting any CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ε‐biased generators in NC<sup>0</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly refuting random CSPs below the spectral threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to use indistinguishability obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank

Latest revision as of 01:52, 16 July 2024

scientific article
Language Label Description Also known as
English
Towards breaking the exponential barrier for general secret sharing
scientific article

    Statements

    Towards breaking the exponential barrier for general secret sharing (English)
    0 references
    0 references
    0 references
    0 references
    9 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers