Towards breaking the exponential barrier for general secret sharing
type: Item
instance of: scholarly article
title: Towards breaking the exponential barrier for general secret sharing
zbMATH Open document ID: 1423.94131
DOI: 10.1007/978-3-319-78381-9_21
author: Tianren Liu
author: Vinod Vaikuntanathan
author: Hoeteck Wee
publication date: 2018-07-09T00:00:00Z
full work available at URL: https://hdl.handle.net/1721.1/124959
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6900691
MaRDI profile type: Publication
OpenAlex ID: W2794870184
cites work: Representing Boolean functions as polynomials modulo composite numbers
cites work: New Bounds for Matching Vector Families
cites work: Secret-Sharing Schemes: A Survey
cites work: Q4252753
cites work: Superpolynomial lower bounds for monotone span programs
cites work: On the Power of Nonlinear Secret-Sharing
cites work: On the Cryptographic Complexity of the Worst Functions
cites work: Q3202940
cites work: Q4434901
cites work: Private information retrieval
cites work: The size of a share must be large
cites work: 2-Server PIR with Sub-Polynomial Communication
cites work: Matching Vector Codes
cites work: 3-Query Locally Decodable Codes of Subexponential Length
cites work: A minimal model for secure computation (extended abstract)
cites work: Protecting data privacy in private information retrieval schemes
cites work: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
cites work: Q4737161
cites work: Partial Garbling Schemes and Their Applications
cites work: Conditional disclosure of secrets via non-linear reconstruction
cites work: How to share a secret
cites work: Secret Sharing and Statistical Zero Knowledge
cites work: A Geometric Approach to Information-Theoretic Private Information Retrieval
cites work: Towards 3-query locally decodable codes of subexponential length
cites work: Candidate One-Way Functions Based on Expander Graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q2707439
cites work: Cryptanalysis of GGH Map
cites work: Efficient Non-interactive Secure Computation
cites work: Q2739458
cites work: Dichotomies in the complexity of solving systems of equations over finite semigroups
cites work: Sum of squares lower bounds for refuting any CSP
cites work: New positive semidefinite relaxations for nonconvex quadratic programs
cites work: Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
cites work: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
cites work: On ε‐biased generators in NC0
cites work: Analysis of Boolean Functions
cites work: Strongly refuting random CSPs below the spectral threshold
cites work: Q3002767
cites work: How to use indistinguishability obfuscation
cites work: Q3802887
description: scientific article; zbMATH DE number 6900691