摘要:
Methods, systems, and media for measuring computer security are provided. In accordance with some embodiments, methods for measuring computer security are provided, the methods comprising: making at least one of decoys and non-threatening access violations accessible to a first user using a computer programmed to do so; maintaining statistics on security violations and non-violations of the first user using a computer programmed to do so; and presenting the statistics on a display.
摘要:
In a communications network-based system, a method for securely processing recurrent consumer transactions. Merchant-specific proxy financial account information is provided to a user and maintained in a database, the proxy financial account information valid for transactions at a single merchant only. A request for transaction approval is received from a merchant, the request including a merchant identifier and a user's proxy financial account information. The database is queried to determine if the proxy financial account is valid for the merchant seeking transaction approval. The proxy financial account information may include a credit card account number and/or a proxy billing address linked to a financial account. A merchant identifier string, identifying the authorized merchant, may be encoded in the credit card number and/or proxy billing address. A communications network-based system and software program for implementing the present invention are also disclosed.
摘要:
A method of detecting an intrusion in the operation of a computer system based on a plurality of events. A rule set is determined for a training set of data comprising a set of features having associated costs. For each of a plurality of events, the set of features is computed and a class is predicted for the features with a rule of the rule set. For each event predicted as an intrusion, a response cost and a damage cost are determined, wherein the damage cost is determined based on such factors as the technique of the intrusion, the criticality of the component of the computer system subject to the intrusion, and a measure of progress of the intrusion. If the damage cost is greater than or equal to the response cost, a response to the event.
摘要:
A system and methods of detecting an occurrence of a violation of an email security policy of a computer system. A model relating to the transmission of prior emails through the computer system is defined which is derived from statistics relating to the prior emails. For selected emails to be analyzed, statistics concerning the selected email are gathered. Such statistics may refer to the behavior or other features of the selected emails, attachments to emails, or email accounts. The determination of whether a violation of an email security policy has occurred is performed by applying the model of prior email transmission to the statistics relating to the selected email. The model may be statistical or probabilistic. A model of prior email transmission may include grouping email recipients into cliques. A determination of a violation of a security policy may occur if email recipients for a particular email are in more than one clique.
摘要:
In accordance with some embodiments of the present invention, systems and methods that protect an application from attacks are provided. In some embodiments of the present invention, input from an input source, such as traffic from a communication network, can be routed through a filtering proxy that includes one or more filters, classifiers, and/or detectors. In response to the input passing through the filtering proxy to the application, a supervision framework monitors the input for attacks (e.g., code injection attacks). The supervision framework can provide feedback to tune the components of the filtering proxy.
摘要:
A method, apparatus and medium are provided for detecting anomalous payloads transmitted through a network. The system receives payloads within the network and determines a length for data contained in each payload. A statistical distribution is generated for data contained in each payload received within the network, and compared to a selected model distribution representative of normal payloads transmitted through the network. The model payload can be selected such that it has a predetermined length range that encompasses the length for data contained in the received payload. Anomalous payloads are then identified based on differences detected between the statistical distribution of received payloads and the model distribution. The system can also provide for automatic training and incremental updating of models.
摘要:
Methods, media, and systems for detecting anomalous program executions are provided. In some embodiments, methods for detecting anomalous program executions are provided, comprising: executing at least a part of a program in an emulator; comparing a function call made in the emulator to a model of function calls for the at least a part of the program; and identifying the function call as anomalous based on the comparison. In some embodiments, methods for detecting anomalous program executions are provided, comprising: modifying a program to include indicators of program-level function calls being made during execution of the program; comparing at least one of the indicators of program-level function calls made in the emulator to a model of function calls for the at least a part of the program; and identifying a function call corresponding to the at least one of the indicators as anomalous based on the comparison.
摘要:
Trading in pooled securities (e.g., pooled mortgages) requires allocation of securities from pools to contracts subject to certain rules or constraints. To improve upon manual allocation procedures, computer techniques for fast and profitable allocation have been developed. Advantageously, a locally optimal allocation can be found by a rule-based greedy algorithm, and the locally optimal allocation can be improved upon further by a simulated annealing technique which is more likely to produce a globally optimal allocation.
摘要:
A technique is provided in the present invention for updating a current database without restarting a knowledge-based system (rule-based system, inference system, expert system). The technique allows for the receipt of updates to an earlier database after an inference procedure has started or even after it has ended. The technique calls for the performance of actions necessary to incrementally bring the database to a consistent state by selectively undoing the inferential consequences of not having had the updated fact in the prior inference procedures and redoing the inferential consequences of having the newly received updated fact.
摘要:
A plurality of parallel processing elements are connected in a binary tree configuration, with each processing element except those in the highest and lowest levels being in communication with a single parent processing element as well as first and second (or left and right) child processing elements. Each processing element comprises a processor, a read/write or random access memory, and an input/output (I/O) device. The I/O device provides interfacing between each processing element and its parent and children processing elements so as to provide significant improvements in propagation speeds through the binary tree. The I/O device allows the presently preferred embodiment of the invention to be clocked at 12 megahertz, producing in the case of a tree of 1023 processors, each having an average instruction cycle time of 1.8 .mu.s, a system with a raw computational throughput of approximately 570 million instructions per second. The I/O device communicates data and queries from the root processing element to all other N processing elements in the array in one processor instruction cycle instead of in O(log.sub.2 N) processor instruction cycles as in prior art binary tree arrays. Primitive queries are executed in parallel by each processing element and the results made available for reporting back to the root processing element. In several important cases, these results can be combined and reported back to the root processing element in a single processor instruction cycle instead of in O(log.sub.2 N) processor instruction cycles as in prior art binary tree arrays. Thus, the elapsed time for a broadcast and report operation is in effect a constant time regardless of the number of processors in the array.
摘要翻译:多个并行处理元件以二叉树配置连接,除了最高和最低级中的每个处理元件与单个父处理元件以及第一和第二(或左和右)子处理元件 。 每个处理元件包括处理器,读/写或随机存取存储器以及输入/输出(I / O)设备。 I / O设备提供每个处理元件与其父和子处理元件之间的接口,以便通过二叉树提供传播速度的显着改进。 I / O设备允许将本发明的当前优选实施例定时为12兆赫,在1023个处理器的树的情况下产生,每个处理器的平均指令周期时间为1.8μs,具有原始计算吞吐量的系统 每秒约5.7亿条指令。 I / O设备在一个处理器指令周期内将数据和来自根处理元件的数据和查询传送到阵列中的所有其他N个处理元件,而不是象现有技术的二叉树阵列那样处于O(log2N)处理器指令周期中。 原始查询由每个处理元素并行执行,结果可用于向根处理元素报告。 在几个重要的情况下,这些结果可以在单个处理器指令周期中组合并返回给根处理元素,而不是像现有技术的二叉树数组那样在O(log2N)处理器指令周期内。 因此,与阵列中的处理器数量无关,广播和报告操作的经过时间实际上是恒定的时间。