Encryption policies for regulating access to outsourced data

ACM Transactions on Database Systems

Volumn 35, Issue 2, 2010, Pages

  Di Vimercati, Sabrina De Capitani ^a   Foresti, Sara ^a   Jajodia, Sushil ^b   Paraboschi, Stefano ^c   Samarati, Pierangela ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b GEORGE MASON UNIVERSITY   (United States)

^c UNIVERSITY OF BERGAMO   (Italy)

Author keywords

Data outsourcing; Encryption policy; Privacy

Indexed keywords

ACCESS CONTROL MODELS; ACCESS CONTROL POLICIES; AUTHORIZATION POLICY; DATA CONTENTS; DATA OUTSOURCING; FORMAL MODEL; LEGITIMATE USERS; OUTSOURCE; SELECTIVE ENCRYPTION; SENSITIVE INFORMATIONS; THIRD PARTIES; TRUSTED PARTY; TWO LAYERS; WEB TECHNOLOGIES;

ACCESS CONTROL; DATA PRIVACY; OUTSOURCING; SECURITY SYSTEMS;

CRYPTOGRAPHY;

EID: 77952046953     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1735886.1735891     Document Type: Article

References (64)

1. ABITEBOUL, S., BUNEMAN, P., AND SUCIU, D. 1999. Data on the Web. Morgan Kaufmann Publishers.
2. AHONEN, H. 1996. Generating grammars for structured documents using grammatical inference methods. Ph.D. thesis, Report A-1996-2004 Department of Computer Science, University of Helsinki.
3. ANGLUIN, D. AND SMITH, C. H. 1983. Inductive inference: Theory and methods. ACM Comput. Surv. 15, 3, 237-269.
4. BARBOSA, D., MENDELZON, A. O., KEENLEYSIDE, J., AND LYONS, K. A. 2002. ToXgene: An extensible template-based data generator for XML. In Proceedings of the 5th International Workshop on the Web and Databases (WebDB 2002). 49-54.
5. BARBOSA, D.,MIGNET, L., AND VELTRI, P. 2006. Studying the XML web: Gathering statistics from an XML sample. World Wide Web 9, 2, 187-212.
6. BENEDIKT, M., FAN, W., AND GEERTS, F. 2008. XPath satisfiability in the presence of DTDs. J. ACM 55, 2, 1-79.
7. BERNSTEIN, P. A. 2003. Applying model management to classical meta data problems. In Online Proceedings of the 1st Biennal Conference on Innovative Data Systems Research (CIDR'03).
8. BEX, G. J., GELADE, W., NEVEN, F., AND VANSUMMEREN, S. Learning deterministic regular expressions for the inference of schemas from XML data. http://arxiv.org/abs/1004.2372.
9. BEX, G. J., GELADE, W., NEVEN, F., AND VANSUMMEREN, S. 2008. Learning deterministic regular expressions for the inference of schemas from XML data. In Proceeding of the 17th International Conference on World Wide Web (WWW'08). 825-834.
10. BEX, G. J.,NEVEN, F., AND DEN BUSSCHE, J. V. 2004. DTDs versus XML Schema: A practical study. In Proceedings of the International Workshop on Web and Database (WebDB). S. Amer-Yahia and L. Gravano, Eds. 79-84.
11. BEX, G. J., NEVEN, F., SCHWENTICK, T., AND TUYLS, K. 2006. Inference of concise DTDs from XML data. In Proceedings of the International Conference on Database Theory (VLDB). U. Dayal, K.-Y. Whang, D. B. Lomet, G. Alonso, G. M. Lohman, M. L. Kersten, S. K. Cha, and Y.-K. Kim, Eds. ACM, 115-126.
12. BEX, G. J., NEVEN, F., AND VANSUMMEREN, S. 2007. Inferring XML schema definitions from XML data. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07). 998-1009.
13. BRĀZMA, A. 1993. Efficient identification of regular expressions from representative examples. In Proceedings of the 6th Annual Conference on Computational Learning Theory (COLT'93). ACM Press, 236-242.
14. BRÜGGEMAN-KLEIN, A. 1993. Regular expressions into finite automata. Theor. Comput. Sci. 120, 2, 197-213.
15. BRÜGGEMANN-KLEIN, A. AND WOOD, D. 1998. One-Unambiguous regular languages. Inform. Comput. 140, 2, 229-253. (Pubitemid 128453342)
16. BUNEMAN, P., DAVIDSON, S. B., FERNANDEZ, M. F., AND SUCIU, D. 1997. Adding structure to unstructured data. In Proceedings of the International Conference on Database Theory (ICDT'97).
17. Lecture Notes in Computer Science, vol. 1186. Springer, 336-350.
18. CARON, P. AND ZIADI, D. 2000. Characterization of Glushkov automata. Theor. Comput. Sci. 233, 1- 2, 75-90.
19. Castor. The Castor project. www.castor.org.
20. CHIDLOVSKII, B. 2001. Schema extraction from XML: A grammatical inference approach. In Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB'01). CEUR Workshop Proceedings, vol. 45.
21. CLARK, J. Trang: Multi-Format schema converter based on RELAX NG. www.thaiopensource.com/relaxng/trang.html.
22. COVER, R. 2003. The Cover Pages. xml.coverpages.org.
23. DELGADO, M. AND MORAIS, J. 2004. Approximation to the smallest regular expression for a given regular language. In Proceedings of the, 9th International Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 3317. Springer, 312-314.
24. DEUTSCH, A., FERNANDEZ, M. F., AND SUCIU, D. 1999. Storing semistructured data with STORED. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 431-442.
25. EHRENFEUCHT, A. AND ZEIGER, P. 1976. Complexity measures for regular expressions. J. Comput. Syst. Sci. 12, 134-146.
26. FERNANDEZ, M. F. AND SUCIU, D. 1998. Optimizing regular path expressions using graph schemas. In Proceedings of the 14th International Conference on Data Engineering (ICDE'98). 14-23.
27. FERNAU, H. 2004. Extracting minimum length document type definitions is NP-hard. In Proceedings of the 7th International Colloquium onGrammatical Inference: Algorithms and Applications. Lecture Notes in Artificial Intelligence, vol. 3264. Springer, 277-278.
28. FERNAU, H. 2009. Algorithms for learning regular expressions from positive data. Inform. Comput. 207, 4, 521-541.
29. FLORESCU, D. 2005. Managing semi-structured data. ACMQueue 3, 8, 18-24.
30. GARĆIA, P. AND VIDAL, E. 1990. Inference of k-testable languages in the strict sense and application to syntactic pattern recognition. IEEE Trans. Patt. Anal. Mach. Intell. 12, 9, 920-925.
31. GAROFALAKIS, M., GIONIS, A., RASTOGI, R., SESHADRI, S., AND SHIM, K. 2003. XTRACT: Learning document type descriptors from XML document collections. Data Mining Knowl. Discov. 7, 23-56.
32. GELADE, W. AND NEVEN, F. 2008. Succinctness of the complement and intersection of regular expressions. In Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS'08). Dagstuhl Seminar Proceedings, vol. 08001. 325-336.
33. GOLD, E. 1967. Language identification in the limit. Inform. Control 10, 5, 447-474.
34. GOLDMAN, R. AND WIDOM, J. 1997. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB'97). 436-445.
35. GRUBER, H. AND HOLZER, M. 2008. Finite automata, digraph connectivity, and regular expression size. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 5126. Springer, 39-50.
36. HAN, Y.-S. ANDWOOD, D. 2007. Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. 370, 1-3, 110-120.
37. HEGEWALD, J., NAUMANN, F., AND WEIS, M. 2006. XStruct: Efficient schema extraction from multiple and large XML documents. In Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06). IEEE Computer Society, 81-97.
38. HINKELMAN, S. 2005. Business integration-Information conformance statements (BI-ICS). Tech. rep., IBM DeveloperWorks.
39. HOPCROFT, J. ANDULLMAN, J. 1979. Introduction to Automata Theory, Languages and computation. Addison-Wesley.
40. HUET, G. 1980. Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM 27, 4, 797-821.
41. KOCH, C., SCHERZINGER, S., SCHWEIKARDT, N., AND STEGMAIER, B. 2004. Schema-Based scheduling of event processors and buffer minimization for queries on structured data streams. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB'04). 228-239.
42. MANOLESCU, I., FLORESCU, D., AND KOSSMANN, D. 2001. Answering XML queries on heterogeneous data sources. In Proceedings of 27th International Conference on Very Large Data Bases (VLDB'01). 241-250.
43. MARTENS, W., NEVEN, F., AND SCHWENTICK, T. 2007. Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36, 3, 15-22.
44. MARTENS, W., NEVEN, F., SCHWENTICK, T., AND BEX, G. J. 2006. Expressiveness and complexity of XML schema. ACM Trans. Data. Syst. 31, 3.
45. MCHUGH, J., ABITEBOUL, S., GOLDMAN, R., QUASS, D., AND WIDOM, J. 1997. Lore: A database management system for semistructured data. SIGMOD Rec. 26, 3, 54-66.
46. MELNIK, S. 2004. Genericmodel management: Concepts and algorithms. Ph.D. thesis, University of Leipzig.
47. MIGNET, L., BARBOSA, D., AND VELTRI, P. 2003. The XML web: A first study. In Proceedings of the 12th International World Wide Web Conference. 500-510.
48. MIKLAU, G. 2002. XMLData repository. www.cs.washington.edu/research/ xmldatasets.
49. MIN, J.-K., AHN, J.-Y., AND CHUNG, C.-W. 2003. Efficient extraction of schemas for XML documents. Inform. Process. Lett. 85, 1, 7-12.
50. NESTOROV, S.,ABITEBOUL, S., ANDMOTWANI, R. 1998. Extracting schema from semistructured data. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 295-306.
51. NESTOROV, S.,ULLMAN, J. D.,WIENER, J. L., AND CHAWATHE, S. S. 1997. Representative objects: Concise representations of semistructured, hierarchial data. In Proceedings of the 13th International Conference on Data Engineering. IEEE Computer Society, 79-90.
52. NEVEN, F. AND SCHWENTICK, T. 2006. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods Comput. Sci. 2, 3.
53. NGU, A. H. H., ROCCO, D., CRITCHLOW, T., AND BUTTLER, D. 2005. Automatic discovery and inferencing of complex bioinformatics web interfaces. World Wide Web 8, 4, 463-493.
54. OAKS, P. AND TER HOFSTEDE, A. H. M. 2007. Guided interaction: A mechanism to enable ad hoc service interaction. Inform. Syst. Frontiers 9, 1, 29-51.
55. OHLEBUSCH, E. 2001. Implementing conditional term rewriting by graph rewriting. Theor. Comput. Sci. 262, 1, 311-331.
56. OPEN WEB APPLICATION SECURITY PROJECT CONSORTIUM. 2004. The top ten most critical web application security vulnerabilities-2004 update. www.owasp.org.
57. PITT, L. 1989. Inductive inference, DFAs, and computational complexity. In Proceedings of the International Workshop on Analogical and Inductive Inference (AII'89). Springer-Verlag, 18-44.
58. RABINER, L. 1989. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77, 2, 257-286.
59. RAHM, E. AND BERNSTEIN, P. A. 2001. A survey of approaches to automatic schema matching. VLDB J. 10, 4, 334-350.
60. SAHUGUET, A. 2000. Everything you ever wanted to know about DTDs, but were afraid to ask (extended abstract). In Proceedings of the 3rd International Workshop on The World Wide Web and Databases, (WebDB'00), Selected Papers. 171-183.
61. SAKAKIBARA, Y. 1997. Recent advances of grammatical inference. Theor. Comput. Sci. 185, 1, 15-45.
62. SANKEY, J. ANDWONG, R. K. 2001. Structural inference for semistructured data. In Proceedings of the International Conference on Information and Knowledge Management. ACM Press, 159-166. Sun. Sun JAXB. java.sun.com/ webservices/jaxb.
63. THOMPSON, H. S., BEECH, D.,MALONEY, M., AND MENDELSOHN, N. 2004. XML Schema part 1: Structures 2nd Ed. World Wide Web Consortium, Recommendation REC-xmlschema-1-20041028. W3C. 2002. XHTML 1.0 The Extensible HyperText Markup Language, 2nd Ed. W3C.
64. WANG, G., LIU, M., YU, J. X., SUN, B., YU, G., LV, J., AND LU, H. 2003. Effective schema-based XML query optimization techniques. In Proceedings of the 7th International Database Engineering and Applications Symposium. 230-235.