The following pages link to (Q4526995):
Displaying 22 items.
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Dividing secrets to secure data outsourcing (Q903651) (← links)
- Optimal configurations for peer-to-peer user-private information retrieval (Q980206) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- On the privacy of a code-based single-server computational PIR scheme (Q2120986) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Hypercubes and Private Information Retrieval (Q3297525) (← links)
- An Efficient PIR Construction Using Trusted Hardware (Q3540144) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Similarity Based Interactive Private Information Retrieval (Q5055967) (← links)
- Протокол конфиденциального получения информации (Q5152403) (← links)
- Multi-key homomorphic secret sharing from LWE without multi-key HE (Q6535488) (← links)
- Near-optimal private information retrieval with preprocessing (Q6582182) (← links)
- Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
