ACM Home Page
Please provide us with feedback. Feedback
Simultaneous scalability and security for data-intensive web applications
Full text PdfPdf (275 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: Data privacy and security table of contents
Pages: 241 - 252  
Year of Publication: 2006
ISBN:1-59593-434-0
Authors
Amit Manjhi  Carnegie Mellon University, Pittsburgh, PA
Anastassia Ailamaki  Carnegie Mellon University, Pittsburgh, PA
Bruce M. Maggs  Akamai Technologies
Todd C. Mowry  Intel Research Pittsburgh
Christopher Olston  Carnegie Mellon University, Pittsburgh, PA
Anthony Tomasic  Carnegie Mellon University, Pittsburgh, PA
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): 31,   Downloads (12 Months): 173,   Citation Count: 3
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.1142501
What is a DOI?

ABSTRACT

For Web applications in which the database component is the bottleneck, scalability can be provided by a third-party Database Scalability Service Provider (DSSP) that caches application data and supplies query answers on behalf of the application. Cost-effective DSSPs will need to cache data from many applications, inevitably raising concerns about security. However, if all data passing through a DSSP is encrypted to enhance security, then data updates trigger invalidation of large regions of cache. Consequently, achieving good scalability becomes virtually impossible. There is a tradeoff between security and scalability, which requires careful consideration.In this paper we study the security-scalability tradeoff, both formally and empirically. We begin by providing a method for statically identifying segments of the database that can be encrypted without impacting scalability. Experiments over a prototype DSSP system show the effectiveness of our static analysis method--for all three realistic bench-mark applications that we study, our method enables a significant fraction of the database to be encrypted without impacting scalability. Moreover, most of the data that can be encrypted without impacting scalability is of the type that application designers will want to encrypt, all other things being equal. Based on our static analysis method, we propose a new scalability-conscious security design methodology that features: (a) compulsory encryption of highly sensitive data like credit card information, and (b) encryption of data for which encryption does not impair scalability. As a result, the security-scalability tradeoff needs to be considered only over data for which encryption impacts scalability, thus greatly simplifying the task of managing the tradeoff.


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
[1] G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, R. Motwani, U. Srivastava, D. Thomas, and Y. Xu. Two can keep a secret: A distributed architecture for secure database services. In Proc. CIDR, 2005.
2
 
3
[3] M. Altinel, C. Bornhvd, S. Krishnamurthy, C. Mohan, H. Pirahesh, and B. Reinwald. Cache tables: Paving the way for an adaptive database cache. In Proc. VLDB, 2003.
 
4
[4] K. Amiri, S. Park, R. Tewari, and S. Padmanabhan. DBProxy: A dynamic data cache for Web applications. In Proc. ICDE, 2003.
5
 
6
[6] E. Brynojolfsson, M. Smith, and Y. Hu. Consumer surplus in the digital economy: Estimating the value of increased product variety. 2002. http://www.heinz.cmu.edu/~mds/cs.pdf.
 
7
[7] California Senate. Bill SB 1386. http://info.sen.ca. gov/pub/01-02/bill/sen/sb_1351-1400/sb_1386_ bill_200%20926_chaptered.html, 2002.
 
8
[8] K. Candan, D. Agrawal, W. Li, O. Po, and W. Hsiung. View invalidation for dynamic content caching in multitiered architectures. In Proc. VLDB, 2002.
 
9
 
10
11
 
12
 
13
[13] H. Hacigumus, B. Iyer, and S. Mehrotra. Efficient execution of aggregation queries over encrypted relational databases. In 9th International Conference on Database Systems for Advanced Applications, 2004.
 
14
[14] Jakarta Project. Apache Tomcat.
 
15
[15] M. Kantarcioglu and C. Clifton. Security issues in querying encrypted data. Technical Report TR-04-013, Purdue University, 2004.
 
16
 
17
[17] W. Li, O. Po, W. Hsiung, K. S. Candan, D. Agrawal, Y. Akca, and K. Taniguchi. CachePortal II: Acceleration of very large scale data center-hosted database-driven web applications. In Proc. VLDB, 2003.
18
 
19
[19] A. Manjhi, A. Ailamaki, B. M. Maggs, T. C. Mowry, C. Olston, and A. Tomasic. Simultaneous scalability and security for data-intensive Web applications. Technical Report CMU-CS-06-116, Carnegie Mellon University, March 2006, http://www.cs.cmu.edu/ ~manjhi/scalabilitySecurity.pdf.
 
20
[20] MySQL AB. MySQL database server.
 
21
[21] ObjectWeb Consortium. Rice University bidding system. http://rubis.objectweb.org/.
 
22
[22] Object Web Consortium. Rice University bulletin board system. http://rubbos.objectweb.org/.
 
23
[23] C. Olston, A. Manjhi, C. Garrod, A. Ailamaki, B. M. Maggs, and T. C. Mowry. A scalability service for dynamic web applications. In Proc. CIDR, 2005.
 
24
 
25
[25] The Washington Post. Advertiser charged in massive database theft. http://www.washingtonpost.com/ wp-dyn/articles/A4364-2004Jul21.html, July, 2004.
 
26
[26] Transaction Processing Council. TPC-W, version 1.7.
27


Collaborative Colleagues:
Amit Manjhi: colleagues
Anastassia Ailamaki: colleagues
Bruce M. Maggs: colleagues
Todd C. Mowry: colleagues
Christopher Olston: colleagues
Anthony Tomasic: colleagues