Abstract
For many data providers, the “crown jewels” of their business are the data that they have organized. If someone could copy their entire database, it would be a competitive catastrophe. Yet, a data provider is in the business of providing data, so access to the database cannot be restricted entirely. How is the data provider to permit legitimate access to users who request access to small portions of the database while protecting the database from wholesale copying?
We suggest that delay can be used for this purpose. We show, under reasonable assumptions, that it is possible to slow down the copying of the entire dataset by an arbitrary amount ensuring that queries that return a significant portion of the database introduce a delay that is orders of magnitude higher than that for legitimate user queries. We then consider issues of change, and show, under reasonable assumptions of rates of change, how to limit access so that the voyeur is guaranteed never to have a complete up-to-date dataset. We also present several extensions of these two major results.
We have implemented our technique on a commercial relational database, and we present numbers showing that the analytically expected delays are indeed observed experimentally, and also that the overheads of implementing our scheme are small.
Supported in part by NSF under grants IIS-0219513 and CCR-0208740
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Kiernan, J.: Watermarking relational databases. In: Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 2002, pp. 155–166 (2002)
Arlitt, M.F., Williamson, C.L.: Web server workload characterization: the search for invariants. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Philadelphia, PA, May 1996, pp. 126–137 (1996)
Bart, P. (ed.): Variety. Reed Business Information, New York, NY (1905)
Bhatti, N., Bouch, A., Kuchinsky, A.: Integrating user-perceived quality into Web server design. In: Proceedings of the Ninth International World Wide Web Conference, Amsterdam, Netherlands, May 2000, pp. 1–16 (2000)
Bobrow, D.G., Burchfiel, J.D., Murphy, D.L., Tomlinson, R.S.: TENEX: a paged time-sharing system for the PDP-10. Communications of the ACM 15(3), 135–143 (1972)
Boney, L., Tewfik, A.H., Hamdy, K.N.: Digital watermarks for audio signals. In: Proceedings of the International Conference on Multimedia Computing and Systems, Hiroshima, Japan, June 1996, pp. 473–480 (1996)
Brassil, J., O’Gorman, L.: Watermarking document images with bounding box expansion. In: Information Hiding First International Workshop, Cambridge, UK, May 1996, pp. 227–235 (1996)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: IEEE INFOCOM 1999: Conference on Computer Communications, New York, NY, March 1999, vol. 1, pp. 126–134 (1999)
Brewington, B.E., Cybenko, G.: Keeping up with the changing Web. Computer 33(5), 52–58 (2000)
Chase, J.S., Anderson, D.C., Thakar, P.N., Vahdat, A.M., Doyle, R.P.: Managing energy and server resources in hosting centers. In: Proceedings of the ACM Symposium on Operating System Principles, Banff, AB, Canada, October 2001, pp. 103–116 (2001)
Chesire, M., Wolman, A., Voelker, G.M., Levy, H.M.: Measurement and analysis of a streaming-media workload. In: Proceedings fo teh 3rd USENIX Symposium on Internet Technologies and Systems, San Francisco, CA, March 2001, pp. 1–12 (2001)
Cho, J., Garcia-Molina, H.: The evolution of the Web and implications for an incremental crawler. In: Proceedings of the 26th International Conference on Very Large Data Bases, Cairo, Egypt, September 2000, pp. 200–209 (2000)
Douceur, J.R.: The Sybil attack. In: Proceedings of the First International Workshop on Peer-to-Peer Systems, Cambridge, MA, March 2002, pp. 251–260 (2002)
Gibbons, P.B., Matias, Y.: New sampling-based summary statistics for improving approximate query answers. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA, June 1998, pp. 331–342 (1998)
Heydon, A., Najork, M.: Mercator: a scalable, extensible Web crawler. World Wide Web 2(4), 219–229 (1999)
Kim, M., Noble, B.D.: Mobile network estimation. In: 7th ACM Conference on Mobile Computing and Networking, Rome, Italy, July 2001, pp. 298–309 (2001)
Macq, B.M., Quisquater, J.-J.: Cryptology for digital TV broadcasting. Proceedings of the IEEE 83(6), 944–957 (1995)
Maniatis, P., Rosenthal, D.S.H., Roussopoulos, M., Baker, M., Giuli, T.J., Muliadi, Y.: Preserving peer replicas by rate-limited sampled voting. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, Bolton Landing, NY, October 2003, pp. 44–59 (2003)
Morris, R., Thompson, K.: Password security: A case history. Communications of the AC 22(11), 594–597 (1979)
Strunk, J.D., Goodson, G.R., Scheinholtz, M.L., Soules, C.A.N., Ganger, G.R.: Self-securing storage: Protecting data in compromised systems. In: Proceedings of the 4th Symposium on Operating Systems Design and Implementation, San Diego, CA, October 2000, pp. 165–179 (2000)
Tirkel, Z., Rankin, G.A., van Schyndel, R.M., Ho, W.J., Mee, N.R.A., Osborne, C.F.: Electronic water mark. In: Proceedings, Digital Image Computing: Techniques and Applications, Sydney, Australia, December 1993, vol. 2, pp. 666–673 (1993)
Zipf, G.: Selective Studies and the Principle of Relative Frequency in Language. Harvard University Press, Cambridge (1932)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jayapandian, M., Noble, B., Mickens, J., Jagadish, H.V. (2004). Using Delay to Defend Against Database Extraction. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2004. Lecture Notes in Computer Science, vol 3178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30073-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30073-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22983-4
Online ISBN: 978-3-540-30073-1
eBook Packages: Springer Book Archive