Open AccessJournal Article
A practical solution to supporting oblivious basic operations on dynamic outsourced search trees
TL;DR: This work states that despite the untrusted server at the provider’s side, the final goal that clients want is to use the outsourced database service as an in-house one, so there is a requirement that clients can operate on their outsourced data without worrying about leak of their sensitive information.
read more
Abstract: Outsourcing database services is a recent trend thanks to advances in the networking technologies and continued growth of the Internet. In the outsourced database service (ODBS) model, clients rely on the premises of the provider, which include hardware, software and manpower, for the storage, maintenance, and retrieval of their data. This ODBS model brings in a variety of conveniences as well as introduces numerous research challenges, and thus has rapidly become one of the hot topics in the research community [1–6]. Because a client stores its private data at an external service provider, who is typically not fully trusted, making outsourced data confidential is one of the foremost challenges in this model. Basically, despite the untrusted server at the provider’s side, the final goal that clients want is to use the outsourced database service as an in-house one. This includes a requirement that clients can operate on their outsourced data without worrying about leak of their sensitive information. This in turn poses several additional challenges related to privacy-preserving for client’s queries as well as the outsourced data during the execution of operations at the untrusted server. Overall, with an assumption that clients are trusted (cf. section 7), the following security requirements must be met:
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Protecting Data Privacy in Private Information Retrieval Schemes.
Yuval Ishai,Eyal Kushilevitz +1 more
TL;DR: This paper shows how to transform PIR schemes into SPIR schemes (with information-theoretic privacy), paying a constant factor in communication complexity, and introduces a new cryptographic primitive, called conditional disclosure of secrets, which it is believed may be a useful building block for the design of other cryptographic protocols.
519
Ensuring Correctness, Completeness, and Freshness for Outsourced Tree-Indexed Data
TL;DR: Wang et al. as discussed by the authors proposed a vanguard solution to provide query assurance for outsourced tree-indexed data on untrusted servers with high query assurance and at reasonable costs.
25
A Novel Solution to Query Assurance Verification for Dynamic Outsourced XML Databases
Viet Hung Nguyen,Tran Khanh Dang +1 more
TL;DR: A novel index structure is proposed, named Nested Merkle B-Tree, combining the advantages of B+-tree and MerKle Hash Tree to completely deal with three issues of query assurance known as correctness, completeness and freshness in dynamic outsourced XML databases.
Privacy preserving biometric-based remote authentication with secure processing unit on untrusted server
TL;DR: This work proposes a novel biometric-based remote authentication framework to deal with malicious attacks over the transmission channel and at the untrusted server, which is not only resistant against attacks on the network but also protects biometric templates stored in the untRusted server's database, thanks to the combination of fuzzy commitment protocol and non-invertible transformation techniques.
15
Security Issues in Outsourced XML Databases
Tran Khanh Dang
- 01 Jan 2010
TL;DR: secure and efficient storage model in outsourced XML databases, which introduces numerous interesting research challenges to data confidentiality, user.
12
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
Practical techniques for searches on encrypted data
Dawn Song,David Wagner,Adrian Perrig +2 more
- 14 May 2000
TL;DR: This work describes the cryptographic schemes for the problem of searching on encrypted data and provides proofs of security for the resulting crypto systems, and presents simple, fast, and practical algorithms that are practical to use today.
Private information retrieval
Benny Chor,Oded Goldreich,Eyal Kushilevitz,M. Sudan +3 more
- 23 Oct 1995
TL;DR: Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described.
2.3K
Software protection and simulation on oblivious RAMs
Oded Goldreich,Rafail Ostrovsky +1 more
TL;DR: This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
Timos Sellis,Nick Roussopoulos,Christos Faloutsos +2 more
- 01 Sep 1987
TL;DR: A variation to Guttman’s Rtrees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced and analytical results indicate that R+-Trees achieve up to 50% savings in disk accesses compared to an R-tree when searching files of thousands of rectangles.