Verifying access-control policies with arithmetic quantifier-free form constraints
US9736183B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 28, 2014 |
| Grant date | Aug 15, 2017 |
| Priority date | — |
| Expiry date | Jan 11, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2221/2113
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.