The Feasibility of Outsourced Database Search in the Plain Model
From MaRDI portal
Publication:2827726
DOI10.1007/978-3-319-44618-9_17zbMath1478.68075OpenAlexW2400431757MaRDI QIDQ2827726
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_17
computational complexitylower boundcommunication complexityoutsourced computationdatabase search functionalitiesminimal interaction
Database theory (68P15) Distributed systems (68M14) Network protocols (68M12) Computer security (68M25)
Related Items (2)
Cryptographic pseudorandom generators can make cryptosystems problematic ⋮ The Feasibility of Outsourced Database Search in the Plain Model
Cites Work
- Unnamed Item
- Unnamed Item
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- The Feasibility of Outsourced Database Search in the Plain Model
- Secure Two-Party Computation with Low Communication
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Structured Encryption and Controlled Disclosure
- Round-Optimal Black-Box Two-Party Computation
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Multi-Client Non-interactive Verifiable Computation
- Advances in Cryptology – CRYPTO 2004
- Outsourced Pattern Matching
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Theory of Cryptography
- The Exact Round Complexity of Secure Computation
This page was built for publication: The Feasibility of Outsourced Database Search in the Plain Model
