发明授权
- 专利标题： Verifying access-control policies with arithmetic quantifier-free form constraints
- 专利标题（中）： 用算术无量表格约束验证访问控制策略
-
申请号： US12837068申请日： 2010-07-15
-
公开(公告)号： US08826366B2公开(公告)日： 2014-09-02
- 发明人: Sanjai Narain , Gary Levin
- 申请人： Sanjai Narain , Gary Levin
- 申请人地址： US NJ Piscataway
- 专利权人： TT Government Solutions, Inc.
- 当前专利权人： TT Government Solutions, Inc.
- 当前专利权人地址： US NJ Piscataway
- 代理机构： Heslin Rothenberg Farley & Mesiti P.C.
- 主分类号： G06F17/00
- IPC分类号： G06F17/00 ; G06F11/00 ; G06F21/62 ; G06F13/362 ; G06F21/60 ; G06F13/00 ; G06F7/60 ; H04L29/06
摘要：
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.
公开/授权文献
信息查询
