Pages that link to "Item:Q2485285"
From MaRDI portal
The following pages link to General constructions for information-theoretic private information retrieval (Q2485285):
Displaying 28 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Private information and the `Information function': A survey of possible uses (Q928753) (← links)
- Optimal configurations for peer-to-peer user-private information retrieval (Q980206) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Improved user-private information retrieval via finite geometry (Q1727378) (← links)
- Reducing the servers' computation in private information retrieval: PIR with preprocessing (Q1880406) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Information hiding using matroid theory (Q2040985) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- A general private information retrieval scheme for MDS coded databases with colluding servers (Q2329401) (← links)
- A tight lower bound for restricted PIR protocols (Q2506166) (← links)
- Robust information-theoretic private information retrieval (Q2642258) (← links)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract) (Q2819536) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- Iterative Constructions and Private Data Release (Q2891493) (← links)
- Private Information Retrieval Over Gaussian MAC (Q4958239) (← links)
- Similarity Based Interactive Private Information Retrieval (Q5055967) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Протокол конфиденциального получения информации (Q5152403) (← links)
- Some results on query processes and reconstruction functions for unconditionally secure 2-server 1-round binary private information retrieval protocols (Q5443561) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)
- OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks (Q6487221) (← links)
- Private information retrieval with result verification for more servers (Q6535117) (← links)
- Improved polynomial secret-sharing schemes (Q6582181) (← links)
