scientific article; zbMATH DE number 1559546
From MaRDI portal
Publication:4526995
Recommendations
Cited in
(54)- Protecting data privacy in private information retrieval schemes
- A novel tamper evident single database information-theoretic private information retrieval for user privacy applications
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- On the privacy of a code-based single-server computational PIR scheme
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Single-server private information retrieval with sublinear amortized time
- General constructions for information-theoretic private information retrieval
- scientific article; zbMATH DE number 1583948 (Why is no real title available?)
- On basing private information retrieval on NP-hardness
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- Breaking the circuit size barrier for secure computation under DDH
- A new multi-server scheme for private information retrieval
- Private information retrieval
- The order of communication complexity of PIR-protocols
- Hypercubes and private information retrieval
- Nearly Private Information Retrieval
- An Efficient PIR Construction Using Trusted Hardware
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- Another Look at Extended Private Information Retrieval Protocols
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- scientific article; zbMATH DE number 1754646 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- A t-private k-database information retrieval scheme
- scientific article; zbMATH DE number 2090941 (Why is no real title available?)
- scientific article; zbMATH DE number 2090942 (Why is no real title available?)
- Foundations of homomorphic secret sharing
- Similarity Based Interactive Private Information Retrieval
- Протокол конфиденциального получения информации
- Information Security and Privacy
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
- Sublinear-communication secure multiparty computation does not require FHE
- Sublinear secure computation from new assumptions
- Optimal single-server private information retrieval
- Lower bounds for (batch) PIR with private preprocessing
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Private join and compute from PIR with default
- On Private Information Retrieval Supporting Range Queries
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- Near-optimal private information retrieval with preprocessing
- Non-interactive anonymous router with quasi-linear router computation
- 10-party sublinear secure computation from standard assumptions
- Single-server client preprocessing PIR with tight space-time trade-off
- On the definition of malicious private information retrieval
- Two-server private information retrieval in sublinear time and quasilinear space
- Selling multiple secrets to a single buyer
- Extended results on privacy against coalitions of users in user-private information retrieval protocols
- Dividing secrets to secure data outsourcing
- Optimal configurations for peer-to-peer user-private information retrieval
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526995)
