Computationally private information retrieval with polylogarithmic communication
From MaRDI portal
Recommendations
Cited in
(78)- Private multiparty sampling and approximation of vector combinations
- Protecting data privacy in private information retrieval schemes
- SQL on structurally-encrypted databases
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Privacy-preserving inverse distance weighted interpolation
- The hunting of the SNARK
- Simple and efficient two-server ORAM
- Homomorphic secret sharing for low degree polynomials
- On the tightness of forward-secure signature reductions
- Optimal security proofs for full domain hash. Revisited
- Oblivious keyword search
- More constructions of lossy and correlation-secure trapdoor functions
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- More efficient digital signatures with tight multi-user security
- 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
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Single-server private information retrieval with sublinear amortized time
- Privacy-enhanced attribute-based private information retrieval
- Instantiability of RSA-OAEP under chosen-plaintext attack
- General constructions for information-theoretic private information retrieval
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- On basing private information retrieval on NP-hardness
- Cryptographic assumptions: a position paper
- Practical techniques building on encryption for protecting and managing data in the cloud
- Private information retrieval with preprocessing based on the approximate GCD problem
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Improved cryptanalysis of the multi-prime -hiding assumption
- Public key locally decodable codes with short keys
- General construction of chameleon all-but-one trapdoor functions
- A Storage Efficient Redactable Signature in the Standard Model
- Succinct NP Proofs from an Extractability Assumption
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- Tighter Reductions for Forward-Secure Signature Schemes
- scientific article; zbMATH DE number 7376033 (Why is no real title available?)
- Homomorphic encryption
- Lossy identification schemes from decisional RSA
- Some open problems in information-theoretic cryptography
- Протокол конфиденциального получения информации
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Fast Private Norm Estimation and Heavy Hitters
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- Asymptotically tight bounds for composing ORAM with PIR
- A simpler rate-optimal CPIR protocol
- Privacy-preserving queries on encrypted data
- Minicrypt primitives with algebraic structure and applications
- Secure computation of the median (and other elements of specified ranks)
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Locally verifiable signature and key aggregation
- Sublinear secure computation from new assumptions
- Inner product functional commitments with constant-size public parameters and openings
- Optimal single-server private information retrieval
- Lower bounds for (batch) PIR with private preprocessing
- A proposal for device independent probabilistic quantum oblivious transfer
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Improved and formal proposal for device-independent quantum private query *
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- Lower-bounds on public-key operations in PIR
- Efficient pre-processing PIR without public-key cryptography
- Fully malicious authenticated PIR
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Hintless single-server private information retrieval
- New results on the -hiding assumption and factoring related RSA moduli
- Single-server client preprocessing PIR with tight space-time trade-off
- Plinko: single-server PIR with efficient updates via invertible PRFs
- How (not) to hash into class groups of imaginary quadratic fields?
- Information-theoretic multi-server private information retrieval with client preprocessing
- Anamorphic signatures with dictator and recipient unforgeability for long messages
- Scalable multi-server private information retrieval
- 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
- Dividing secrets to secure data outsourcing
- Pipelined algorithms to detect cheating in long-term grid computations
This page was built for publication: Computationally private information retrieval with polylogarithmic communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250776)
