Pages that link to "Item:Q2941552"
From MaRDI portal
The following pages link to 2-Server PIR with Sub-Polynomial Communication (Q2941552):
Displayed 25 items.
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Improved user-private information retrieval via finite geometry (Q1727378) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← 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)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- A general private information retrieval scheme for MDS coded databases with colluding servers (Q2329401) (← links)
- (Q3177815) (redirect page) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002633) (← links)
- (Q5090413) (← links)
- (Q5090982) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Optimal single-server private information retrieval (Q6138096) (← links)
- Lower bounds for (batch) PIR with private preprocessing (Q6138100) (← links)
- A survey on single server private information retrieval in a coding theory perspective (Q6157852) (← links)
- On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)
- Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions (Q6169552) (← links)
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH (Q6186714) (← links)