Pages that link to "Item:Q5172696"
From MaRDI portal
The following pages link to 3-query locally decodable codes of subexponential length (Q5172696):
Displayed 34 items.
- Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
- A novel elementary construction of matching vectors (Q436582) (← links)
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- On the geometry of projective tensor products (Q529372) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- A general theory of tensor products of convex sets in Euclidean spaces (Q830342) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- Convex Bodies Associated to Tensor Norms (Q5208228) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
- Locally Decodable Codes (Q5892557) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)