Protecting data privacy in private information retrieval schemes
From MaRDI portal
Publication:1577014
DOI10.1006/jcss.1999.1689zbMath0958.68059OpenAlexW2951483008MaRDI QIDQ1577014
Tal Malkin, Yuval Ishai, Yael Gertner, Eyal Kushilevitz
Publication date: 27 August 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1999.1689
Related Items
Quantum private query with perfect user privacy against a joint-measurement attack, Quadratic secret sharing and conditional disclosure of secrets, Effective agent quantum private data query against malicious joint attack with blind quantum computing, Selling multiple secrets to a single buyer, On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate, Measuring, simulating and exploiting the head concavity phenomenon in BKZ, Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption, Novel classical post-processing for quantum key distribution-based quantum private query, Quantum private query based on single-photon interference, Towards breaking the exponential barrier for general secret sharing, Quantum symmetrically-private information retrieval, A theory of composition for differential obliviousness, Multi-user quantum private query, Enhancing user privacy in SARG04-based private database query protocols, Private join and compute from PIR with default, Semi-quantum private query protocol without invoking the measurement capability of classical user, From private simultaneous messages to zero-information Arthur-Merlin protocols and back, Nearest private query based on quantum oblivious key distribution, Quantum private query with authentication, Inner-product functional encryption with fine-grained access control, Multi-user quantum private query protocol, Practical quantum database private query protocol with classical database owner, Low-Leakage Secure Search for Boolean Expressions, Optimal linear multiparty conditional disclosure of secrets protocols, Restricted adaptive oblivious transfer, New Communication-Efficient Oblivious Transfer Protocols Based on Pairings, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, Robust high capability QKD-based database private query, Privacy-enhanced multi-user quantum private data query using partial quantum homomorphic encryption, Cryptanalysis of multi-user quantum private query protocol, Minimizing locality of one-way functions via semi-private randomized encodings, Robust quantum private queries, A novel quantum solution to secure two-party distance computation, Private database queries using one quantum state, Unnamed Item, Quantum private query based on stable error correcting code in the case of noise, The communication complexity of private simultaneous messages, revisited, Quantum private query based on Bell state and single photons, On the exact round complexity of secure three-party computation, From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back, Placing conditional disclosure of secrets in the communication complexity universe, Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity, Oblivious signature-based envelope, Private multiparty sampling and approximation of vector combinations, PRIVATE DATABASE QUERIES USING QUANTUM STATES WITH LIMITED COHERENCE TIMES, Non-interactive anonymous router, Secret Sharing Schemes for Dense Forbidden Graphs, Practical quantum private query based on Bell state, Quantum Private Queries, Practical two-way QKD-based quantum private query with better performance in user privacy, A new protocol for quantum private query against joint-measurement attack, Practical decoy-state quantum private queries against joint-measurement attack under weak coherent pulse sources, Relativistic quantum private database queries, Garbled Circuits as Randomized Encodings of Functions: a Primer, Some Open Problems in Information-Theoretic Cryptography, Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimal model for secure computation (extended abstract)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- One-way functions are essential for single-server private information retrieval
- Oblivious transfer and polynomial evaluation
- How to share a secret
- Oblivious transfers and intersecting codes
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Privacy and Communication Complexity
- Upper bound on the communication complexity of private information retrieval
- A Zero-One Law for Boolean Privacy
