Pages that link to "Item:Q3519387"
From MaRDI portal
The following pages link to A Geometric Approach to Information-Theoretic Private Information Retrieval (Q3519387):
Displaying 19 items.
- A novel elementary construction of matching vectors (Q436582) (← links)
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Протокол конфиденциального получения информации (Q5152403) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)
- Private information retrieval with result verification for more servers (Q6535117) (← links)
- Committed private information retrieval (Q6550636) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
