Invention Grant
- Patent Title: Verifying access-control policies with arithmetic quantifier-free form constraints
- Patent Title (中): 用算术无量表格约束验证访问控制策略
-
Application No.: US12837068Application Date: 2010-07-15
-
Publication No.: US08826366B2Publication Date: 2014-09-02
- Inventor: Sanjai Narain , Gary Levin
- Applicant: Sanjai Narain , Gary Levin
- Applicant Address: US NJ Piscataway
- Assignee: TT Government Solutions, Inc.
- Current Assignee: TT Government Solutions, Inc.
- Current Assignee Address: US NJ Piscataway
- Agency: Heslin Rothenberg Farley & Mesiti P.C.
- Main IPC: G06F17/00
- IPC: G06F17/00 ; G06F11/00 ; G06F21/62 ; G06F13/362 ; G06F21/60 ; G06F13/00 ; G06F7/60 ; H04L29/06
Abstract:
A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.
Public/Granted literature
- US20120017260A1 VERIFYING ACCESS-CONTROL POLICIES WITH ARITHMETIC QUANTIFIER-FREE FORM CONSTRAINTS Public/Granted day:2012-01-19
Information query
