| |
 |
|
|
Meadows, Catherine
Naval Research Laboratory
Washington, Washington DC
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 14
reviews
|
|
|
|
|
|
|
|
The multilevel relational (MLR) data model
Sandhu R., Chen F. ACM Transactions on Information and System Security 1(1): 93-132, 1998. Type: Article
The problem of multilevel database security, in which the data in a database are classified at different security levels that form a lattice structure, is addressed. It is infeasible to assure oneself that all the software that handles...
|
Feb 1 1999 |
|
|
|
|
|
|
How to sign given any trapdoor permutation
Bellare M., Micali S. Journal of the ACM 39(1): 214-233, 1992. Type: Article
A trapdoor permutation is one that is easy to compute but difficult to invert unless some further information is known. The most straightforward way to use a trapdoor permutation for digital signatures is to make the permutation public...
|
Oct 1 1994 |
|
|
|
|
|
|
From failure to success
de Boer F., Kok J., Palamidessi C. (ed), Rutten J. Theoretical Computer Science 101(2): 239-263, 1992. Type: Article
Horn clause logic provides the basis for many logic programming languages, most notably Prolog. This paper compares three kinds of semantics for Horn clause logic: operational, denotational, and declarative. Operational and den...
|
May 1 1993 |
|
|
|
|
|
|
Competition: a model of AND-parallel execution of logic
Ng K., Leung H. The Computer Journal 33(3): 215-218, 1990. Type: Article
One way to improve the efficiency of logic programs is to allow execution of subgoals in parallel. If two or more subgoals share a variable, however, it is possible that if they are executed in parallel, they will return conflicting an...
|
Jul 1 1991 |
|
|
|
|
|
|
Termination proofs for logic programs
Plümer L., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387528373)
The problem of determining whether a program terminates is of course undecidable. But since logic programs have recursion as their only source of infinite computation, the construction of automatic termination proofs for reasonably lar...
|
Jul 1 1991 |
|
|
|
|
|
|
Cryptography: an introduction to computer security
Seberry J., Pieprzyk J. (ed), Prentice-Hall, Inc., Upper Saddle River, NJ, 1989. Type: Book (9780131949867)
The authors intended this book as a text for a course in cryptography at the upper undergraduate or masters level. A minimum of mathematical background is required, and most of the mathematics needed to read the book is presented in th...
|
Jan 1 1991 |
|
|
|
|
|
|
Integrity = validity + completeness
Motro A. (ed) ACM Transactions on Database Systems 14(4): 480-502, 1989. Type: Article
A class of integrity constraints on relational databases that can be enforced using standard relational query techniques is defined. Although this class of constraints is less powerful than the constraints defined by first-order predic...
|
Oct 1 1990 |
|
|
|
|
|
|
On the transformation of logic programs with instantiation based computation rules
De Schreye D. (ed), Bruynooghe M. (ed) Journal of Symbolic Computation 7(2): 125-154, 1989. Type: Article
Prolog’s rigid depth-first left-to-right computation rule often makes for inefficient programs. Thus it is necessary to develop ways of producing programs that follow more flexible rules. The approach in this paper is to comp...
|
Jun 1 1990 |
|
|
|
|
|
|
Further results on the security of partitioned dynamic statistical databases
McLeish M. ACM Transactions on Database Systems 14(1): 98-113, 1989. Type: Article
A statistical database is one in which only statistics on data are released. In most cases, the actual data are to be kept confidential; queries must therefore be answered selectively so that individual records are not revealed. One wa...
|
Oct 1 1989 |
|
|
|
|
|
|
How to prove yourself: practical solutions to identification and signature problems
Fiat A., Shamir A. Advances in cryptology--CRYPTO ’86 (, Santa Barbara, CA, Aug 11-15, 1987) 1941987. Type: Proceedings
Zero-knowledge, a newly emerging area of complexity theory, is of great interest to cryptographers because it provides a basis for the construction of secure authentication protocols. Most zero-knowledge protocols are of little practic...
|
Apr 1 1989 |
|
|
|
|
|
| |
|
|
| |
|
|
