Foundations of Secure Deductive Databases.

@article{DBLP:journals/tkde/BonattiKS95,
  author    = {Piero A. Bonatti and
               Sarit Kraus and
               V. S. Subrahmanian},
  title     = {Foundations of Secure Deductive Databases},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {3},
  year      = {1995},
  pages     = {406-422},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/69.390247},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Nabil R. Adam, John C. Wortmann: Security-Control Methods for Statistical Databases: A Comparative Study. ACM Comput. Surv. 21(4): 515-556(1989)

[2]

François Bancilhon, Nicolas Spyratos: Protection of Information in Relational Data Bases. VLDB 1977: 494-500

[3]

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15

[4]

Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Implementing Deductive Databases by Linear Programming. PODS 1992: 283-292

[5]

...

[6]

Joachim Biskup, Hans Hermann Brüggemann: The Personal Model of Data: Towards a Privacy-Oriented Information System. Computers & Security 7: 575-597(1988)

[7]

Piero A. Bonatti, Sarit Kraus, V. S. Subrahmanian: Declarative Foundations of Secure Deductive Databases. ICDT 1992: 391-406

[8]

...

[9]

Frédéric Cuppens: A Modal Logic Framework to Solve Aggregation Problems. DBSec 1991: 315-332

[10]

Dorothy E. Denning: Cryptography and Data Security. Addison-Wesley 1982

[11]

...

[12]

...

[13]

William F. Dowling, Jean H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3): 267-284(1984)

[14]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7

[15]

...

[16]

...

[17]

...

[18]

Sarit Kraus, Daniel J. Lehmann, Menachem Magidor: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artif. Intell. 44(1-2): 167-207(1990)

[19]

John W. Lloyd: Foundations of Logic Programming, 2nd Edition. Springer 1987, ISBN 3-540-18199-7

[20]

...

[21]

Anil Nerode, Raymond T. Ng, V. S. Subrahmanian: Computing Circumscriptive Databases: I. Theory and Algorithms. Inf. Comput. 116(1): 58-80(1995)

[22]

Domenico Saccà, Carlo Zaniolo: On the Implementation of a Simple Class of Logic Queries for Databases. PODS 1986: 16-23

[23]

...

[24]

George L. Sicherman, Wiebren de Jonge, Reind P. van de Riet: Answering Queries Without Revealing Secrets. ACM Trans. Database Syst. 8(1): 41-59(1983)

[25]

Tzong-An Su, Gultekin Özsoyoglu: Controlling FD and MVD Inferences in Multilevel Relational Database Systems. IEEE Trans. Knowl. Data Eng. 3(4): 474-485(1991)

[26]

Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146

[27]

...

[28]

Simon Wiseman: Control of confidentiality in databases. Computers & Security 9(6): 529-537(1990)

[29]

...

Last update Fri May 25 09:47:00 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page