ACM Home Page
Please provide us with feedback. Feedback
Dynamic authenticated index structures for outsourced databases
Full text PdfPdf (360 KB)
Source International Conference on Management of Data archive
Proceedings of the 2006 ACM SIGMOD international conference on Management of data table of contents
Chicago, IL, USA
SESSION: Authentication table of contents
Pages: 121 - 132  
Year of Publication: 2006
ISBN:1-59593-434-0
Authors
Feifei Li  Boston University
Marios Hadjieleftheriou  AT&T Labs-Research
George Kollios  Boston University
Leonid Reyzin  Boston University
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 147,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142473.1142488
What is a DOI?

ABSTRACT

In outsourced database (ODB)systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to access and query the data more efficiently. As servers might be untrusted or can be compromised, query authentication becomes an essential component of ODB systems. Existing solutions for this problem concentrate mostly on static scenarios and are based on idealistic properties for certain cryptographic primitives. In this work, first we define a variety of essential and practical cost metrics associated with ODB systems. Then, we analytically evaluate a number of different approaches, in search for a solution that best leverages all metrics. Most importantly, we look at solutions that can handle dynamic scenarios, where owners periodically update the data residing at the servers. Finally, we discuss query freshness, a new dimension in data authentication that has not been explored before. A comprehensive experimental evaluation of the proposed and existing approaches is used to validate the analytical models and verify our claims. Our findings exhibit that the proposed solutions improve performance substantially over existing approaches, both for static and dynamic environments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
[2] Authenticated Index Structures Library. http://cs-people.bu.edu/lifeifei/aisl/.
 
3
4
 
5
[5] L. Bouganim, F. D. Ngoc, P. Pucheral, and L. Wu. Chip-secured data access: Reconciling access rights with data encryption. In Proc. of Very Large Data Bases (VLDB), pages 1133-1136, 2003.
6
 
7
[7] Crypto++ Library. http://www.eskimo.com/~weidai/cryptlib.html.
 
8
 
9
10
 
11
12
 
13
 
14
[14] B. Hore, S. Mehrotra, and G. Tsudik. A privacy-preserving index for range queries. In Proc. of Very Large Data Bases (VLDB), pages 720-731, 2004.
 
15
[15] F. Li, M. Hadjieleftheriou, G. Kollios, and L. Reyzin. Authenticated Index Structures for Outsourced Database Systems. Technical Report BUCS-TR_2006-004, CS Department, Boston University, 2006.
 
16
 
17
[17] K. McCurley. The discrete logarithm problem. In Proc. of the Symposium in Applied Mathematics, pages 49-74. American Mathematical Society, 1990.
 
18
 
19
 
20
[20] G. Miklau and D. Suciu. Controlling access to published data using cryptography. In Proc. of Very Large Data Bases (VLDB), pages 898-909, 2003.
 
21
[21] E. Mykletun, M. Narasimha, and G. Tsudik. Authentication and integrity in outsourced databases. In Symposium on Network and Distributed Systems Security (NDSS), 2004.
 
22
[22] E. Mykletun, M. Narasimha, and G. Tsudik. Signature bouquets: Immutability for aggregated/condensed signatures. In European Symposium on Research in Computer Security (ESORICS), pages 160-176, 2004.
23
 
24
[24] National Institute of Standards and Technology. FIPS PUB 180-1: Secure Hash Standard. National Institute of Standards and Technology, 1995.
 
25
[25] OpenSSL. http://www.openssl.org.
26
 
27
28
29
 
30
 
31
[31] R. Tamassia and N. Triandopoulos. Efficient Content Authentication over Distributed Hash Tables. Technical report, CS Department, Brown University, 2005.

CITED BY  13

Collaborative Colleagues:
Feifei Li: colleagues
Marios Hadjieleftheriou: colleagues
George Kollios: colleagues
Leonid Reyzin: colleagues