SYSTEMS AND METHODS FOR EFFICIENT ACCESS CONTROL

• US 20170364693A1
• Filed: 06/21/2016
• Published: 12/21/2017
• Est. Priority Date: 06/21/2016
• Status: Active Grant

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Gallagher, Adam
• Granted Patent: US 11,386,213 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 21/6209 to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
• CPC Class Codes: G06F 9/45545 Guest-host, i.e. hypervisor is an application program itself, e.g. VirtualBox

Abstract

An apparatus configured for database access control. The apparatus includes a memory and a processor coupled to the memory, wherein the processor is configured to execute instructions. The instructions include receiving a statement requesting access for a user to data files stored in a non-transitory memory medium; parsing the statement into one or more arguments, wherein each argument ends with a logical operator; computing a skip count for each of the arguments; evaluating the statement using the skip counts to determine whether the access should be granted to the user; retrieving the data files from the non-transitory memory medium; and sending the data files to the user, if the access is granted.

Claims

1. A method, comprising steps of:

receiving, at a processor, a statement requesting an access for a user to a data file stored in a non-transitory memory medium;

parsing, by the processor, the statement into one or more arguments, wherein each argument ends with a logical operator except a last argument in the statement;

computing, by the processor, a skip count for each of the arguments;

evaluating, by the processor, the statement using the skip counts to determine whether the access should be granted to the user;

retrieving, by the processor, the data file from the non-transitory memory medium; and

sending, by the processor, the data file to the user, if the access is granted.

2. The method according to claim 1, wherein the statement includes user identities, at least one logical operator, and at least one parenthesis.

3. The method according to claim 1, wherein the step of parsing, by the processor, the statement into one or more arguments ignores parenthesis.

4. The method according to claim 1, wherein the step of computing, by the processor, a skip count for each of the arguments further includes

counting, by the processor, a number of left parenthesis of an argument;

and

counting, by the processor, a number of left parenthesis of a next argument, wherein the next argument is subsequently adjacent to the argument in the statement.

5. The method according to claim 4, wherein the step of computing, by the processor, a skip count for each of the arguments further includes

setting, by the processor, the skip count equal to a variable Count.

6. The method according to claim 5, wherein the step of computing, by the processor, a skip count for each of the arguments further includes

calculating, by the processor, a variable P, wherein P=P+(a number of left parenthesis of an argument)−

(a number of right parenthesis of the argument); and

calculating, by the processor, the variable Count, wherein Count=Count+1,

wherein the method accumulatively repeats the calculations of P and Count for each argument in the statement.

7. The method according to claim 6, wherein the step of computing, by the processor, a skip count for each of the arguments further includes

terminating, by the processor, the calculations of P and Count, if P is not less or not equal to zero;

terminating, by the processor, the calculations of P and Count, if the argument is the final argument in the statement.

8. A computer program product, comprising:

a non-transitory computer-readable medium comprising instructions which, when executed by a processor of a computing system, cause the processor to perform the steps of;

receiving a statement requesting an access for a user to a data file stored in a non-transitory memory medium;

parsing the statement into one or more arguments, wherein each argument ends with a logical operator except a last argument in the statement;

computing a skip count for each of the arguments;

evaluating the statement using the skip counts to determine whether the access should be granted to the user;

retrieving the data file from the non-transitory memory medium; and

sending the data file to the user, if the access is granted.

9. The computer program product of claim 8, wherein the statement includes user identities, at least one logical operator, and at least one parenthesis.

10. The computer program product of claim 8, wherein the step of parsing the statement into one or more arguments ignores parenthesis.

11. The computer program product of claim 8, wherein the step of computing a skip count for each of the arguments further includes

counting a number of left parenthesis of an argument;

and

counting a number of left parenthesis of a next argument, wherein the next argument is subsequently adjacent to the argument in the statement.

12. The computer program product of claim 11, wherein the step of computing a skip count for each of the arguments further includes

setting the skip count equal to a variable Count.

13. The computer program product of claim 12, wherein the step of computing a skip count for each of the arguments further includes

calculating a variable P, wherein P=P+(a number of left parenthesis of an argument)−

(a number of right parenthesis of the argument); and

calculating the variable Count, wherein Count=Count+1,

wherein the method accumulatively repeats the calculations of P and Count for each argument in the statement.

14. The computer program product of claim 13, wherein the step of computing a skip count for each of the arguments further includes

terminating the calculations of P and Count, if P is not less or not equal to zero;

terminating the calculations of P and Count, if the argument is the final argument in the statement.

15. An apparatus, comprising:

a memory; and

a processor coupled to the memory, the processor being configured to execute the steps of;

receiving a statement requesting an access for a user to a data file stored in a non-transitory memory medium;

parsing the statement into one or more arguments, wherein each argument ends with a logical operator except a last argument in the statement;

computing a skip count for each of the arguments;

evaluating the statement using the skip counts to determine whether the access should be granted to the user;

retrieving the data file from the non-transitory memory medium; and

sending the data file to the user, if the access is granted.

16. The apparatus of claim 15, wherein the statement includes user identities, at least ne logical operator, and at least one parenthesis.

17. The apparatus of claim 15, wherein the step of parsing the statement into one or more arguments ignores parenthesis.

18. The apparatus of claim 15, wherein the step of computing a skip count for each of the arguments further includes

counting a number of left parenthesis of an argument;

and

counting a number of left parenthesis of a next argument, wherein the next argument is subsequently adjacent to the argument in the statement.

19. The apparatus of claim 18, wherein the step of computing a skip count for each of the arguments further includes

setting the skip count equal to a variable Count.

20. The apparatus of claim 19, wherein the step of computing a skip count for each of the arguments further includes

calculating a variable P, wherein P=P+(a number of left parenthesis of an argument)−

(a number of right parenthesis of the argument); and

.

calculating the variable Count, wherein Count=Count+1,

wherein the method accumulatively repeats the calculations of P and Count for each argument in the statement.