Private Database Search With Sublinear Query Time

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22348-8_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Constant Rate PCPs for Circuit-Sat With Sublinear Query Complexity

2013English

Sublinear Time Algorithms

English

Private Database Access With HE-over-ORAM Architecture

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Private Web Search With Constant Round Efficiency

2015English

Use of Daily Internet Search Query Data Improves Real-Time Projections of Influenza Epidemics

Journal of the Royal Society Interface
BiochemistryBiophysicsBiomaterialsBiotechnologyBioengineeringBiomedical Engineering
2018English

Multi-Dimensional Range Query on Outsourced Database With Strong Privacy Guarantee

International Journal of Computer Network and Information Security
2017English

Query Load Balancing in Parallel Database Systems

2018English

Automatic Categorization of Web Database Query Results

Advances in Data Mining and Database Management
English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy