scientific article; zbMATH DE number 5009196
From MaRDI portal
Publication:3374904
Recommendations
- Information Security and Privacy
- Automata, Languages and Programming
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Verifiable single-server private information retrieval
- A novel tamper evident single database information-theoretic private information retrieval for user privacy applications
- One-way functions are essential for single-server private information retrieval
- scientific article; zbMATH DE number 2090941
- Private information retrieval from coded databases with colluding servers
- A t-private k-database information retrieval scheme
- Single-server private information retrieval with sublinear amortized time
Cited in
(31)- Private multiparty sampling and approximation of vector combinations
- Protecting data privacy in private information retrieval schemes
- Providing accurate models across private partitioned data: secure maximum likelihood estimation
- Flexible quantum oblivious transfer
- Information hiding using matroid theory
- Private information retrieval with sublinear online time
- Privacy-enhanced attribute-based private information retrieval
- Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol
- On basing private information retrieval on NP-hardness
- One-way functions are essential for single-server private information retrieval
- On the Security Loss in Cryptographic Reductions
- Another Look at Extended Private Information Retrieval Protocols
- Quantum oblivious transfer with relaxed constraints on the receiver
- Homomorphic encryption
- Information Security and Privacy
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- Automata, Languages and Programming
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Programmable distributed point functions
- Lower bounds for (batch) PIR with private preprocessing
- A proposal for device independent probabilistic quantum oblivious transfer
- Improved and formal proposal for device-independent quantum private query *
- Combinatorially homomorphic encryption
- Near-optimal private information retrieval with preprocessing
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Lower-bounds on public-key operations in PIR
- Efficient pre-processing PIR without public-key cryptography
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Black box crypto is useless for doubly efficient PIR
- Plinko: single-server PIR with efficient updates via invertible PRFs
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 Q3374904)
