The present disclosure relates in general to the field of computers and similar technologies, and in particular to cybersecurity systems utilized in this field. Still more particularly, the disclosure relates to a method, system, and computer-usable medium for implementing a user interface providing visualization of security policies.
Users interact with physical, system, data, and services resources of all kinds, as well as each other, on a daily basis. Each of these interactions, whether accidental or intended, poses some degree of security risk. As an example, security risks are present anytime two or more devices communicate with one another over, for example, the Internet.
Secured networks often automatically execute programmed IT Security Policies to deal with potential security risks. An IT security policy may be used to implement the rules and procedures for all individuals accessing and using an organization's IT assets and resources.
A system of one or more computers can be configured to perform particular operations or actions by virtue of having software, firmware, hardware, or a combination of them installed on the system that in operation causes or cause the system to implement a cybersecurity system having security policy visualization. One general aspect of the disclosure is directed to a computer-implemented method for implementing security policies in a secured network, including: retrieving a set of rules of a security policy; analyzing the set of rules of the security policy using one or more Satisfiability Modulo Theory (SMT) operations to reduce a dimensionality of the security policy; and generating a visual presentation on a user interface using results of the SMT operations, where the visual presentation includes visual indicia representing one or more targeted policy dimensions with respect to one or more fixed policy dimensions. In at least one embodiment, two or more security policies are presented with visual indicia representing differences between the security policies, including representations of one or more targeted policy dimensions with respect to one or more fixed policy dimensions. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.
Another general aspect of the disclosure is directed to a system including one or more information handling systems, where the one or more information handling systems include: a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus; where the computer program code included in one or more of the information handling systems is executable by the processor of the information handling system so that the information handling system, alone or in combination with other information handling systems, executes operations that may include: retrieving a set of rules of a security policy; analyzing the set of rules of the security policy using one or more Satisfiability Modulo Theory (SMT) operations to reduce a dimensionality of the security policy; and generating a visual presentation on a user interface using results of the SMT operations, where the visual presentation includes visual indicia representing one or more targeted policy dimensions with respect to one or more fixed policy dimensions.
Another general aspect of the disclosure is directed to a non-transitory, computer-readable storage medium embodying computer program code, the computer program code may include computer-executable instructions configured for: retrieving a set of rules of a security policy; analyzing the set of rules of the security policy using one or more Satisfiability Modulo Theory (SMT) operations to reduce a dimensionality of the security policy; and generating a visual presentation on a user interface using results of the SMT operations, where the visual presentation includes visual indicia representing one or more targeted policy dimensions with respect to one or more fixed policy dimensions.
The present invention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings. The use of the same reference number throughout the several figures designates a like or similar element.
A method, system, and computer-usable medium are disclosed for implementing a cybersecurity system having a unique security policy visualization system. To effectively implement a secured network, administrators often write a set of security policies in which individual policies are used that describe the intended security access rules relating to the IT assets of an organization. In certain systems, the policy syntax is expressive to allow flexibility in the policies. This expressiveness can include many different fields, precedence in expressing rules, etc.
Certain embodiments of the disclosed system are implemented with the recognition that the expressiveness and complexity of a subset of security policies make it difficult for policy administrators to understand how rules interact. Also, certain embodiments of the disclosed system are implemented with the recognition that many security breaches come from this misunderstanding. Further, certain embodiments of the disclosed system are implemented with an understanding that security administrators are often hesitant to make changes to the security policy or duplicate portions of policy because of fear of breaking another part of the policy.
Certain embodiments of the disclosed system use advances in formal logic software, such as Satisfiability Modulo Theory solvers (e.g., Z3 solver) to perform analysis of a security policy and present the administrator with a simplified view of the policy effects in an understandable manner at a user interface. The administrator can use the presentation at the user interface to understand an existing policy and, in certain embodiments, to understand the impact of any policy changes.
Although the disclosed system is described in the context of network policies, it will be recognized in view of the teachings of the present disclosure that this approach is applicable to other policy languages (DLP, etc.).
For the purposes of this disclosure, an information handling system may include any instrumentality or aggregate of instrumentalities operable to compute, classify, process, transmit, receive, retrieve, originate, switch, store, display, manifest, detect, record, reproduce, handle, or utilize any form of information, intelligence, or data for business, scientific, control, entertainment, or other purposes. For example, an information handling system may be a personal computer, a mobile device such as a tablet or smartphone, a consumer electronic device, a connected “smart device,” a network appliance, a network storage device, a network gateway device, a server or collection of servers or any other suitable device and may vary in size, shape, performance, functionality, and price. The information handling system may include volatile and/or non-volatile memory, and one or more processing resources such as a central processing unit (CPU) or hardware or software control logic. Additional components of the information handling system may include one or more storage systems, one or more wired or wireless interfaces for communicating with other networked devices, external devices, and various input and output (I/O) devices, such as a keyboard, a mouse, a microphone, speakers, a trackpad, a touchscreen and a display device (including a touch-sensitive display device). The information handling system may also include one or more buses operable to transmit communication between the various hardware components.
For the purposes of this disclosure, computer-readable media may include any instrumentality or aggregation of instrumentalities that may retain data and/or instructions for a period of time. Computer-readable media may include, without limitation, storage media such as a direct access storage device (e.g., a hard disk drive or solid-state drive), a sequential access storage device (e.g., a tape disk drive), optical storage device, random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and/or flash memory; as well as communications media such as wires, optical fibers, microwaves, radio waves, and other electromagnetic and/or optical carriers; and/or any combination of the foregoing.
In various embodiments, the security policy visualization system 118 performs a security protection operation. In certain embodiments, the security policy visualization system 118 improves the efficiency of the information handling system 100, by facilitating security policy visualization including, in certain embodiments, facilitating security policy modification visualizations. In certain embodiments, the security policy visualization system 118 provides a way of protecting a network system against security threats, thereby enhancing the operation of the network. As will be appreciated, once the information handling system 100 is configured to perform the disclosed security visualization operations, the information handling system 100 becomes a specialized computing device specifically configured to protect the information handling system 100 and/or a network connected to the information handling system 100 against security threats and is not a general-purpose computing device. The implementation of the security policy visualization system 118 on the information handling system 100 improves the functionality of the information handling system 100, providing a useful and concrete result of performing security analytics functions to mitigate security risk.
In certain embodiments, the security policy visualization system 118 includes components that are used to perform an analysis of a set of security policies and present the administrator with a simplified view of the effects of the policies. The administrator can use the simplified view to understand an existing set of security policies and to understand the impact of policy changes.
In the example shown in
The exemplary security policy visualization system 118 shown in
In certain embodiments, the administrator can interact with the security policy visualization system 118 through an administrator interface engine 126 that is configured to communicate with an administrator interface 150. In certain embodiments, the administrator interface 150 includes a display, a keyboard, mouse, or the like, which allow the administrator to enter information into the security policy visualization system 118. Further, certain embodiments of the administrator interface allow the administrator to view a simplified representation of the effects of the set of security policies in datastore 120.
In certain embodiments, a security policy may be represented as an N-dimensional space, where each N is a dimension of the policy. As an example, the dimensions of a network security policy may include source addresses, destination addresses, protocols, source ports, user groups, etc. In certain embodiments, the SMT solver 124 reduces the dimensions of the n-dimensional space so that simplified visualizations of the set of network policies may be displayed in terms of fixed policy dimensions 122 and targeted policy dimensions 128. In certain embodiments, the fixed policy dimensions 122 and targeted policy dimensions may be input by the administrator through the administrator interface 150. In certain embodiments, policy colors or other representative visual indicia are assigned to each region of the n-dimensional space with the appropriate action for that region. Certain embodiments, the SMT solver reduces high-dimension spaces down into easily visualized spaces where the administrator can see how the set of security policies operate.
Certain embodiments of the security policy visualization system 118 fix some values of the policy dimensions (e.g., the destination port) and find all policy rules that could apply the fixed values. Certain embodiments of the disclosed system are implemented with a recognition that the use of matching policy operations, without more, are difficult to execute using simple pattern matching because the effect of the rule set in the policy is cumulative. For example, a network policy rule set may have actions that implement conditions in which network access and/or traffic is to be passed or denied. A modification of a network policy rule may affect the results of later rules. Operations executed by the SMT solver 124 can be used to find actual combinations that will meet an access or traffic condition because the security policy visualization system 118 can create the actual logical relationships between the rules to evaluate the true policy effect using the SMT solver 124.
Certain embodiments of the security policy visualization system 118 may be configured to compare multiple sets of policies with one another. In the example shown in
In operation, endpoint devices 212 and server 213 are configured for communication with the secured network 202 over the Internet 214. In certain embodiments, endpoint devices 216 and server 218 communicate with one another over network 220 within secured network 202. Endpoint devices 216 and server 218, in certain embodiments, are configured to communicate with endpoint devices 212 and one or more servers 213 over the Internet 214 through the secured network 202.
Certain embodiments of the secured network 202 include a security policy visualization system 222 that, for example, is executed on a workstation 224 of a system administrator 226. In certain embodiments, the system administrator 226 can interface with the security policy visualization system 222 through the workstation 224. In turn, the security policy visualization system 222 provides a simplified view of the rules of the network security policies 204, as described herein.
The display screen 300 in this example shows a range of destination ports and the traffic rule for the destination ports. To this end, a table 310 is displayed in a central region of display screen 300, which displays the values of the fixed dimension (e.g., destination ports) in cells on a vertical axis, and the values of targeted dimension (e.g., traffic) in cells adjacent to the values for the fixed dimension. In certain embodiments, the traffic is displayed using cells having different colors, shades, and/or fill patterns. A legend, such as a legend shown at 312, may be provided on the display screen 300 to allow an administrator to understand the relationship between the destination ports and that the corresponding traffic rules at the destination ports.
In this example, actuation of button 404 may be used to bring up a list of dimensions of the security policies that may be used as fixed dimensions in the comparative analysis. As shown at label object 406 of
The display screen 400 in this example shows a range of destination ports and the traffic rules for the destination ports in each of the selected security policies. To this end, a table 412 is displayed in a central region of display screen 400, which displays the values of the destination ports (e.g., the fixed dimension) in a vertical column of cells 414 and the traffic rules (e.g., the targeted dimension) adjacent one another in cells of column 416 and, further, adjacent the cells having the values for the ports. In certain embodiments, the traffic rule is displayed using cells having different colors, shades, and/or fill patterns. A legend, such as a legend shown at 418, may be provided on the display screen 400 to allow an administrator to understand the relationship between the destination ports and the corresponding traffic rule allowed on the destination ports in the Active Policy and the Modified Policy.
In the example shown in
In certain embodiments, the cells in columns 416 may be button objects that are actuatable to display portions of the security policy files associated with the fixed dimension. As an example, actuation of a button object at cell 420 may transition to a screen showing all references to destination port 53 in the Active Policy, while actuation of button object at cell 422 may transition to a screen showing all references to rules referencing destination port 53 in the Modified Policy. As a further example, actuation of a button object at cell 430 may transition to a screen showing all rules referencing destination port 443 in the Active Policy, while the actuation of a button object at cell 428 may transition to a screen showing all rules referencing destination port 443. Additionally, or in the alternative, cell 424 may be a button object that transitions to a screen showing a side-by-side relationship of all rules referencing destination port 53 in both the Active Policy and Modified Policy. Similarly, cell 443 may be a button object that transitions to a screen showing a side-by-side relationship of all rules referencing destination port 443 in both the Active Policy and Modified Policy.
In the example shown in
In certain embodiments, the cells in table 500 may be button objects that are actuatable to display textual portions of the security policy files associated with the rules for the fixed dimensions and target dimension. As an example, actuation of a button object at cell 508 may transition to a screen showing all references to destination port 22 in the Modified Policy P2, while actuation of the button object adjacent the button object at cell 508 may transition to a screen showing all rules referencing destination port 22 in the Active Policy P1. Similar operations may be executed in response to the actuation of buttons in cells labeled with an address range seven as well as cells labeled with a destination port.
In the example of
At operation 610, certain embodiments copy a rule of the active policy from the copy of the active policy to the temporary table for the rules of the active policy. At operation 612, a rule of the modified policy is copied from the copy of the modified policy into the temporary table for the rules of the modified policy. At operation 614, an SMT analysis is used to compare the rules copied to the temporary tables with one another. In some embodiments, the syntax of the copied rules may be different but have the same logical consequences. SMT analysis allows policy rules to be compared with one another based on the logic of the rules rather than the syntax. Based on the SMT analysis, a check is made at operation 616 to determine whether the rule copied in the temporary table for the active security policy and the rule copied into the temporary table for the modified security policy are logically equivalent. If the rules are not equivalent, the rules and/or logical difference between the rules are stored in a list at operation 618.
Operation 620 is executed to determine whether there are further rules of the active security policy and modified security policy that are to be compared with one another. If the rules are equivalent as determined at operation 616, the operational flow may proceed to operation 620 to determine whether there are further rules of the active security policy and modified security policy that are to be compared. If more rules are to be compared, the next rule of the active security policy and the next rule of the modified security policy are retrieved and compared in the manner shown at operations 610 through 618. If there are no more rules that are to be compared as determined at operation 620, the list having the inequivalent rules and/or logical consequences of the inequivalent rules may be finalized at operation 622.
At operation 624, the fixed policy dimensions and target policy dimensions are input by, for example, an administrator. At operation 626, the inequivalent rules and/or logical consequence of the inequivalent rules are used to provide a user interface providing a simplified view of the differences between the active security policy and modified security policy using the fixed policy dimensions, and target policy dimensions entered at operation 624.
As will be appreciated by one skilled in the art, the disclosed system may be embodied as a method, system, or computer program product. Accordingly, embodiments of the disclosed system may be implemented entirely in hardware, entirely in software (including firmware, resident software, micro-code, etc.) or in an embodiment combining software and hardware. These various embodiments may all generally be referred to herein as a “circuit,” “module,” or “system.” Furthermore, the disclosed system may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium.
Any suitable computer-usable or computer-readable medium may be utilized. The computer-usable or computer-readable medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, or a magnetic storage device. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
Computer program code for carrying out operations of the disclosed system may be written in an object-oriented programming language such as Java, Smalltalk, C++ or the like. However, the computer program code for carrying out operations of the disclosed system may also be written in conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Embodiments of the disclosed system are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosed system. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the disclosed system. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
While particular embodiments of the disclosed system have been shown and described, it will be evident to those skilled in the art that, based upon the teachings herein, changes and modifications may be made without departing from this invention and its broader aspects. Therefore, the appended claims are to encompass within their scope all such changes and modifications as are within the true spirit and scope of this invention. Furthermore, it is to be understood that the invention is solely defined by the appended claims. It will be understood by those with skill in the art that if a specific number of an introduced claim element is intended, such intent will be explicitly recited in the claim, and in the absence of such recitation, no such limitation is present. For non-limiting example, as an aid to understanding, the following appended claims contain usage of the introductory phrases “at least one” and “one or more” to introduce claim elements. However, the use of such phrases should not be construed to imply that the introduction of a claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an”; the same holds true for the use in the claims of definite articles.
The disclosed system is well adapted to attain the advantages mentioned as well as others inherent therein. While the disclosed system has been depicted, described, and is defined by reference to particular embodiments of the disclosed system, such references do not imply a limitation on the invention, and no such limitation is to be inferred. The invention is capable of considerable modification, alteration, and equivalents in form and function, as will occur to those ordinarily skilled in the pertinent arts. The depicted and described embodiments are examples only, and are not exhaustive of the scope of the invention.
Consequently, the invention is intended to be limited only by the spirit and scope of the appended claims, giving full cognizance to equivalents in all respects.
Number | Name | Date | Kind |
---|---|---|---|
6072875 | Tsudik | Jun 2000 | A |
6678693 | Shiraishi | Jan 2004 | B1 |
7107447 | Sanin et al. | Sep 2006 | B2 |
7694150 | Kirby | Apr 2010 | B1 |
7725565 | Li et al. | May 2010 | B2 |
7813944 | Luk et al. | Oct 2010 | B1 |
7933960 | Chen et al. | Apr 2011 | B2 |
8181253 | Zaitsev et al. | May 2012 | B1 |
8312064 | Gauvin | Nov 2012 | B1 |
8424061 | Rosenoer | Apr 2013 | B2 |
8484066 | Miller et al. | Jul 2013 | B2 |
8490163 | Harsell et al. | Jul 2013 | B1 |
8713633 | Thomas | Apr 2014 | B2 |
8776168 | Gibson et al. | Jul 2014 | B1 |
8826443 | Raman et al. | Sep 2014 | B1 |
8892690 | Liu et al. | Nov 2014 | B2 |
8990930 | Burrell et al. | Mar 2015 | B2 |
9015812 | Plattner et al. | Apr 2015 | B2 |
9015847 | Kaplan et al. | Apr 2015 | B1 |
9043905 | Allen et al. | May 2015 | B1 |
9053124 | Dornquast et al. | Jun 2015 | B1 |
9128995 | Fletcher et al. | Sep 2015 | B1 |
9137318 | Hong | Sep 2015 | B2 |
9166999 | Kulkarni et al. | Oct 2015 | B1 |
9223972 | Vincent et al. | Dec 2015 | B1 |
9246941 | Gibson et al. | Jan 2016 | B1 |
9262722 | Daniel | Feb 2016 | B1 |
9298726 | Mondal et al. | Mar 2016 | B1 |
9342553 | Fuller | May 2016 | B1 |
9369433 | Paul et al. | Jun 2016 | B1 |
9485266 | Baxley et al. | Nov 2016 | B2 |
9542650 | Lospinoso et al. | Jan 2017 | B2 |
9596146 | Coates et al. | Mar 2017 | B2 |
9609010 | Sipple | Mar 2017 | B2 |
9665854 | Burger et al. | May 2017 | B1 |
9692762 | Barkan et al. | Jun 2017 | B2 |
9755913 | Bhide et al. | Sep 2017 | B2 |
9762582 | Hockings et al. | Sep 2017 | B1 |
9798883 | Gil et al. | Oct 2017 | B1 |
9935891 | Stamos | Apr 2018 | B1 |
9977824 | Agarwal et al. | May 2018 | B2 |
10096065 | Little | Oct 2018 | B2 |
10108544 | Duggal et al. | Oct 2018 | B1 |
10187369 | Caldera et al. | Jan 2019 | B2 |
10210283 | Broz et al. | Feb 2019 | B2 |
10235285 | Wallace | Mar 2019 | B1 |
10237298 | Nguyen et al. | Mar 2019 | B1 |
10270794 | Mukerji et al. | Apr 2019 | B1 |
10275671 | Newman | Apr 2019 | B1 |
10282702 | Paltenghe et al. | May 2019 | B2 |
10284601 | Bar-Menachem et al. | May 2019 | B1 |
10320813 | Ahmed et al. | Jun 2019 | B1 |
10341391 | Pandey et al. | Jul 2019 | B1 |
10417454 | Marom et al. | Sep 2019 | B1 |
10417653 | Milton et al. | Sep 2019 | B2 |
10419428 | Tunnell et al. | Sep 2019 | B2 |
10432669 | Badhwar et al. | Oct 2019 | B1 |
10545738 | Jaeger et al. | Jan 2020 | B1 |
10579281 | Cherubini et al. | Mar 2020 | B2 |
10769908 | Burris et al. | Sep 2020 | B1 |
10917319 | Scheib et al. | Feb 2021 | B2 |
11061874 | Funk et al. | Jul 2021 | B1 |
20020112015 | Haynes | Aug 2002 | A1 |
20020123865 | Whitney et al. | Sep 2002 | A1 |
20040034582 | Gilliam et al. | Feb 2004 | A1 |
20040044613 | Murakami et al. | Mar 2004 | A1 |
20050120025 | Rodriguez et al. | Jun 2005 | A1 |
20050198099 | Motsinger et al. | Sep 2005 | A1 |
20050273850 | Freund | Dec 2005 | A1 |
20060048209 | Shelest et al. | Mar 2006 | A1 |
20060053476 | Bezilla et al. | Mar 2006 | A1 |
20060112111 | Tseng et al. | May 2006 | A1 |
20060117172 | Zhang et al. | Jun 2006 | A1 |
20060129382 | Anand et al. | Jun 2006 | A1 |
20060195905 | Fudge | Aug 2006 | A1 |
20060206449 | Fletcher et al. | Sep 2006 | A1 |
20060225124 | Kolawa et al. | Oct 2006 | A1 |
20070043703 | Bhattacharya et al. | Feb 2007 | A1 |
20070121522 | Carter | May 2007 | A1 |
20070225995 | Moore | Sep 2007 | A1 |
20070234409 | Eisen | Oct 2007 | A1 |
20080168002 | Kagarlis et al. | Jul 2008 | A1 |
20080168135 | Redlich et al. | Jul 2008 | A1 |
20080168453 | Hutson et al. | Jul 2008 | A1 |
20080198453 | LaFontaine et al. | Aug 2008 | A1 |
20080244741 | Gustafson et al. | Oct 2008 | A1 |
20090006888 | Bernhard et al. | Jan 2009 | A1 |
20090100498 | Grossi | Apr 2009 | A1 |
20090177979 | Garbow et al. | Jul 2009 | A1 |
20090182872 | Hong | Jul 2009 | A1 |
20090228474 | Chiu et al. | Sep 2009 | A1 |
20090300712 | Kaufmann et al. | Dec 2009 | A1 |
20100024014 | Kailash et al. | Jan 2010 | A1 |
20100057662 | Collier et al. | Mar 2010 | A1 |
20100058016 | Nikara et al. | Mar 2010 | A1 |
20100094767 | Miltonberger | Apr 2010 | A1 |
20100094818 | Farrell et al. | Apr 2010 | A1 |
20100107255 | Eiland et al. | Apr 2010 | A1 |
20100146622 | Nordstrom et al. | Jun 2010 | A1 |
20100228656 | Wasserblat et al. | Sep 2010 | A1 |
20100235495 | Petersen et al. | Sep 2010 | A1 |
20100275263 | Bennett et al. | Oct 2010 | A1 |
20110061093 | Korkus et al. | Mar 2011 | A1 |
20110167105 | Ramakrishnan et al. | Jul 2011 | A1 |
20110307957 | Barcelo et al. | Dec 2011 | A1 |
20120046989 | Baikalov et al. | Feb 2012 | A1 |
20120047575 | Baikalov et al. | Feb 2012 | A1 |
20120079107 | Williams et al. | Mar 2012 | A1 |
20120110087 | Culver et al. | May 2012 | A1 |
20120137367 | Dupont et al. | May 2012 | A1 |
20120210158 | Akiyama et al. | Aug 2012 | A1 |
20120259807 | Dymetman | Oct 2012 | A1 |
20120290215 | Adler et al. | Nov 2012 | A1 |
20130013550 | Kerby | Jan 2013 | A1 |
20130054433 | Giard et al. | Feb 2013 | A1 |
20130055367 | Kshirsagar et al. | Feb 2013 | A1 |
20130081141 | Anurag | Mar 2013 | A1 |
20130097662 | Pearcy et al. | Apr 2013 | A1 |
20130102283 | Lau et al. | Apr 2013 | A1 |
20130104236 | Ray et al. | Apr 2013 | A1 |
20130132551 | Bose et al. | May 2013 | A1 |
20130174259 | Pearcy et al. | Jul 2013 | A1 |
20130205366 | Luna et al. | Aug 2013 | A1 |
20130238422 | Saldanha | Sep 2013 | A1 |
20130290598 | Fiske et al. | Oct 2013 | A1 |
20130297729 | Suni et al. | Nov 2013 | A1 |
20130305358 | Gathala et al. | Nov 2013 | A1 |
20130317808 | Kruel et al. | Nov 2013 | A1 |
20130320212 | Valentino et al. | Dec 2013 | A1 |
20130340035 | Uziel et al. | Dec 2013 | A1 |
20140075004 | Van Dusen et al. | Mar 2014 | A1 |
20140096215 | Hessler | Apr 2014 | A1 |
20140115654 | Rogers | Apr 2014 | A1 |
20140173727 | Lingafelt et al. | Jun 2014 | A1 |
20140199663 | Sadeh-Koniecpol et al. | Jul 2014 | A1 |
20140205099 | Christodorescu et al. | Jul 2014 | A1 |
20140214938 | Bhatt et al. | Jul 2014 | A1 |
20140283075 | Drissel et al. | Sep 2014 | A1 |
20140325634 | Iekel-Johnson et al. | Oct 2014 | A1 |
20140356445 | Little | Dec 2014 | A1 |
20150082430 | Sridhara et al. | Mar 2015 | A1 |
20150113646 | Lee et al. | Apr 2015 | A1 |
20150154263 | Boddhu et al. | Jun 2015 | A1 |
20150161386 | Gupta et al. | Jun 2015 | A1 |
20150199511 | Faile, Jr. et al. | Jul 2015 | A1 |
20150199629 | Faile, Jr. et al. | Jul 2015 | A1 |
20150205954 | Jou et al. | Jul 2015 | A1 |
20150215325 | Ogawa | Jul 2015 | A1 |
20150220625 | Cartmell et al. | Aug 2015 | A1 |
20150256550 | Taylor et al. | Sep 2015 | A1 |
20150269383 | Lang et al. | Sep 2015 | A1 |
20150286819 | Coden et al. | Oct 2015 | A1 |
20150288709 | Singhal et al. | Oct 2015 | A1 |
20150324559 | Boss et al. | Nov 2015 | A1 |
20150324563 | Deutschmann et al. | Nov 2015 | A1 |
20150326613 | Devarajan et al. | Nov 2015 | A1 |
20150350902 | Baxley et al. | Dec 2015 | A1 |
20150356488 | Eden et al. | Dec 2015 | A1 |
20160021117 | Harmon et al. | Jan 2016 | A1 |
20160036844 | Kopp et al. | Feb 2016 | A1 |
20160078362 | Christodorescu et al. | Mar 2016 | A1 |
20160092774 | Wang et al. | Mar 2016 | A1 |
20160105334 | Boe et al. | Apr 2016 | A1 |
20160117937 | Penders et al. | Apr 2016 | A1 |
20160147380 | Coates et al. | May 2016 | A1 |
20160164922 | Boss et al. | Jun 2016 | A1 |
20160224803 | Frank et al. | Aug 2016 | A1 |
20160226914 | Doddy et al. | Aug 2016 | A1 |
20160232353 | Gupta et al. | Aug 2016 | A1 |
20160247158 | Kolotinsky | Aug 2016 | A1 |
20160261621 | Srivastava et al. | Sep 2016 | A1 |
20160277360 | Dwyier et al. | Sep 2016 | A1 |
20160277435 | Salajegheh et al. | Sep 2016 | A1 |
20160286244 | Chang et al. | Sep 2016 | A1 |
20160300049 | Guedalia et al. | Oct 2016 | A1 |
20160308890 | Weilbacher | Oct 2016 | A1 |
20160330219 | Hasan | Nov 2016 | A1 |
20160330746 | Mehrabanzad et al. | Nov 2016 | A1 |
20160335865 | Sayavong et al. | Nov 2016 | A1 |
20160371489 | Puri et al. | Dec 2016 | A1 |
20170032274 | Yu et al. | Feb 2017 | A1 |
20170053280 | Lishok et al. | Feb 2017 | A1 |
20170063888 | Muddu et al. | Mar 2017 | A1 |
20170070521 | Bailey et al. | Mar 2017 | A1 |
20170104790 | Meyers et al. | Apr 2017 | A1 |
20170116054 | Boddhu et al. | Apr 2017 | A1 |
20170155669 | Sudo et al. | Jun 2017 | A1 |
20170171609 | Koh | Jun 2017 | A1 |
20170230418 | Amar et al. | Aug 2017 | A1 |
20170255938 | Biegun et al. | Sep 2017 | A1 |
20170279616 | Loeb et al. | Sep 2017 | A1 |
20170286671 | Chari et al. | Oct 2017 | A1 |
20170331828 | Caldera et al. | Nov 2017 | A1 |
20170149815 | Bolgert | Dec 2017 | A1 |
20180004948 | Martin et al. | Jan 2018 | A1 |
20180007069 | Hunt et al. | Jan 2018 | A1 |
20180018456 | Chen et al. | Jan 2018 | A1 |
20180024901 | Tankersley et al. | Jan 2018 | A1 |
20180025273 | Jordan et al. | Jan 2018 | A1 |
20180027006 | Zimmermann et al. | Jan 2018 | A1 |
20180077182 | Sartran | Mar 2018 | A1 |
20180081661 | Gonzalez del Solar et al. | Mar 2018 | A1 |
20180082307 | Ochs et al. | Mar 2018 | A1 |
20180091520 | Camenisch et al. | Mar 2018 | A1 |
20180107528 | Vizer et al. | Apr 2018 | A1 |
20180121514 | Reisz et al. | May 2018 | A1 |
20180139227 | Martin et al. | May 2018 | A1 |
20180145995 | Roeh et al. | May 2018 | A1 |
20180191745 | Moradi et al. | Jul 2018 | A1 |
20180191766 | Holeman et al. | Jul 2018 | A1 |
20180191857 | Schooler et al. | Jul 2018 | A1 |
20180204215 | Hu et al. | Jul 2018 | A1 |
20180232111 | Jones et al. | Aug 2018 | A1 |
20180232426 | Gomez et al. | Aug 2018 | A1 |
20180234434 | Viljoen | Aug 2018 | A1 |
20180248863 | Kao et al. | Aug 2018 | A1 |
20180276541 | Studnitzer et al. | Sep 2018 | A1 |
20180285363 | Dennis et al. | Oct 2018 | A1 |
20180288063 | Koottayi et al. | Oct 2018 | A1 |
20180295141 | Solotorevsky | Oct 2018 | A1 |
20180332062 | Ford | Nov 2018 | A1 |
20180336353 | Manadhata et al. | Nov 2018 | A1 |
20180341758 | Park et al. | Nov 2018 | A1 |
20180341889 | Psalmonds et al. | Nov 2018 | A1 |
20180349221 | Harutyunyan et al. | Dec 2018 | A1 |
20180349684 | Bapat et al. | Dec 2018 | A1 |
20190007418 | Cook | Jan 2019 | A1 |
20190014153 | Lang et al. | Jan 2019 | A1 |
20190034625 | Ford et al. | Jan 2019 | A1 |
20190034813 | Das et al. | Jan 2019 | A1 |
20190036969 | Swafford et al. | Jan 2019 | A1 |
20190052660 | Cassidy et al. | Feb 2019 | A1 |
20190095478 | Tankersley et al. | Mar 2019 | A1 |
20190158503 | Bansal et al. | May 2019 | A1 |
20190174319 | Backholm et al. | Jun 2019 | A1 |
20190222603 | Yang | Jul 2019 | A1 |
20190289021 | Ford | Sep 2019 | A1 |
20190294482 | Li et al. | Sep 2019 | A1 |
20190311105 | Beiter et al. | Oct 2019 | A1 |
20190354703 | Ford | Nov 2019 | A1 |
20190356688 | Ford | Nov 2019 | A1 |
20190356699 | Ford | Nov 2019 | A1 |
20190387002 | Ford et al. | Dec 2019 | A1 |
20190387003 | Ford et al. | Dec 2019 | A1 |
20190392419 | DeLuca et al. | Dec 2019 | A1 |
20200034462 | Narayanasamy et al. | Jan 2020 | A1 |
20200036740 | Ford | Jan 2020 | A1 |
20200065728 | Wilson et al. | Feb 2020 | A1 |
20200077265 | Singh et al. | Mar 2020 | A1 |
20200089692 | Tripathi et al. | Mar 2020 | A1 |
20200117546 | Wong et al. | Apr 2020 | A1 |
20200334025 | Wang et al. | Oct 2020 | A1 |
20200387497 | Chittimalli | Dec 2020 | A1 |
Number | Date | Country |
---|---|---|
2019153581 | Aug 2019 | WO |
WO-2019153581 | Aug 2019 | WO |
Entry |
---|
Barrere et al., Vulnerability Assessment in Autonomic Networks and Services: A Survey, IEEE, Aug. 30, 2013. vol. 16, issue. 2, pp. 988-1004. |
Burns et al., Automatic Management of Network Security Policy, IEEE, Jun. 14, 2001, pp. 12-26. |
L. F. Lafuerza et al., Exact Solution of a Stochastic Protein Dynamics Model with Delayed Degradation, Phys. Rev. E 84, 051121, Nov. 18, 2011, pp. 1-8. |
Zoubin Ghahramani, Bayesian nonparametrics and the probabilistic approach to modelling, Philosophical Transactions A of the Royal Society, vol. 371 Issue: 1984, Published Dec. 31, 2012, pp. 1-20. |
Elena Zheleva et al., Higher-order Graphical Models for Classification in Social and Affiliation Networks, NIPS 2010 Workshop on Networks Across Disciplines: Theory and Applications, Whistler BC, Canada, 2010, pp. 1-7. |
Varun Chandola et al., Anomaly Detection: A Survey, ACM Computing Surveys, vol. 41, No. 3, Article 15, Jul. 2009, pp. 15.1-58.1. |
Judea Pearl, The Causal Foundations of Structural Equation Modeling, Technical Report R-370, Computer Science Department, University of California, Los Angeles, also Chapter 5, R. H. Hoyle (Ed.), Handbook of Structural Equation Modeling, New York, Guilford Press, Jun. 4, 2012, pp. 68-91. |
Yueh-Hsuan Chiang, Towards Large-Scale Temporal Entity Matching, Dissertation Abstract, University of Wisconsin-Madison, 2013. |
Furong Li, Linking Temporal Records for Profiling Entities, 2015, SIGMOD '15 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 593-605, https://users.soe.ucsc.edu/˜tan/papers/2015/modf445-li.pdf. |
Peter Christen et al., Adaptive Temporal Entity Resolution on Dynamic Databases, Apr. 2013, http://users.cecs.anu.edu.au/˜Peter.Christen/publications/christen2013pakdd-slides.pdf. |
Wikipedia, Categorical Distribution, edited Jul. 28, 2018, https://en.wikipedia.org/wiki/Categorical_distribution. |
Wikipedia, One-Hot, edited May 22, 2018, https://en.wikipedia.org/wiki/One-hot. |
Github, The Z3 Theorem Prover, retrieved from internet May 19, 2020, https://github.com/Z3Prover/z3. |
John Backes et al., Semantic-based Automated Reasoning for AWS Access Policies using SMT, 2018 Formal Methods in Computer Aided Design (FMCAD), Oct. 30-Nov. 2, 2018 https://d1.awsstatic.com/Security/pdfs/Semantic_Based_Automated_Reasoning_for_AWS_Access_Policies_Using_SMT.pdf. |
Sean Barnum, Standardized Cyber Threat Intelligence Information with the Structured Threat Information eXpression (STIX) Whitepaper v1.1 (Feb. 20, 2014). |
Xiang Sun et al., Event Detection in Social Media Data Streams, IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Automatic and Secure Computing; Persuasive Intelligence and Computing, pp. 1711-1717, Dec. 2015. |
Crandall et al., Inferring Social Ties from Geographic Coincidences, PNAS, vol. 107, No. 52, 2010, pp. 22436-22441, 2010. |
Ross et al., Bully Prevention in Positive Behavior Support, Journal of Applied Behavior Analysis, 42(4), pp. 747-759, 2009. |
Matt Klein, How to Erase Your iOS Device After Too Many Failed Passcode Attempts, https://www.howtogeek.com/264369/ how-to-erase-your-ios-device-after-too-many-failed-passcode-attempts/, Jul. 28, 2016. |
Mesaros et al., Latent Semantic Analysis in Sound Event Detection, 19th European Signal Processing Conference (EUSIPCO 2011), pp. 1307-1311. |
Marinescu, Dan C., Cloud Computing and Computer Clouds, University of Central Florida, 2012, pp. 1-246. |
Sanjeev Goyal et al., Attack, Defence and Contagion in Networks, the Review of Economic Studies, vol. 81, Issue 4, Oct. 2014, pp. 1518-1542, https://doi.org/10.1093/restud/rdu013 (2014). |
S. Chambi et al., Better bitmap performance with Roaring bitmaps, arXiv:1402.6407v10 [cs.DB] (Mar. 15, 2016). |
Jianguo Wang et al., An Experimental Study of Bitmap Compression vs. Inverted List Compression, SIGMOD 2017: Proceedings of the 2017 ACM Int'l Conf. on Management of Data, pp. 993-1008 (May 2017). |
Singh et al., Container-Based Microservice Architecture for Cloud Applications, International Conference on Computing, Communication and Automation (ICCCA2017), 2017. |
Number | Date | Country | |
---|---|---|---|
20210367979 A1 | Nov 2021 | US |