Abstract: The design for modern graphical interfaces generated by an application under test (AUT) can take many forms. A codeless testing system reads the output generated by the AUT to identify components, however, scroll bars may be present but in a form that is not reliably identified. As a result, an AUT may comprise scrollable graphical elements that are not identified as such resulting in the performance of tests that are incomplete. By applying a middle button click event, an associated pointer changes form and reveals an associated graphical element to comprise a scrollable element. When the pointer change occurs, testing directed to the scrollable element is then included to perform a more complete testing of the features of the AUT.

Abstract: Examples relate to detecting an abnormality. The examples disclosed herein enable receiving, from a first user, a first request to perform a first transaction on at least one data record. A plurality of transactions originated from the first request may be organized in a first hierarchical tree-based data structure having multiple depth levels. The data structure may comprise a root node representing the first transaction and a leaf node representing a second transaction. The examples further enable detecting the abnormality based on at least one parameter where the at least one parameter comprises a size of the data structure and a depth level associated with the leaf node.

Abstract: An event is detected. The event is a designated event for capturing a snapshot of a blockchain where the blockchain is not replicated in a distributed ledger. For example, the event may be where a specific number of new blocks have been added to the blockchain. In response to detecting the event, a capstone block or a lock block is created. The capstone block or the lock block is added to the blockchain. A copy of the capstone block or the copy of the lock block sent to a trusted authority. The copy of the capstone block or the copy of the lock block is used to validate some or all the blockchain to detect if the blockchain has been changed. For example, validating the blockchain may be to detect if the blockchain has been tampered with or has become corrupted.

Abstract: A self-contained validation process is initiated. For example, an application may contain code to initiate the self-contained validation process. The self-contained validation process comprises at least one of: a self-contained application validation process, a self-contained container validation process, a self-contained virtual machine validation process, and a self-contained hypervisor validation process. In response to initiating the self-contained validation process, the self-contained validation process requests a list of vulnerabilities associated with the self-contained validation process. The list of vulnerabilities associated with the self-contained validation process is received. For example, the received list of vulnerabilities may identify a security vulnerability in the application. An action taken based on the received list of vulnerabilities associated with the computer process. For example, the application may self-quarantine itself based on the received list of vulnerabilities.

Abstract: A shard of a selected document is identified. A hierarchy of documents including the selected document are to be tagged with metadata in a data store of a search engine so that the related documents are queryable by the metadata using the search engine. The shard specifies a location of the related documents within the data store of the search engine. For each related document, a tagging operation is generated within a script, the tagging operation specifying the metadata, the shard, an identifier of the related document, and an identifier of the selected document. The script including the generated tagging operation for each related document is transmitted to the search engine to execute to tag the related documents in the data store with the metadata and with the selected document as a source of the metadata.

Abstract: A computer implemented method includes: accessing from a configuration management database, by a virtualization manager, configuration data for a first computing node of a computing system; generating, by the virtualization manager, a set of attribute/value pairs for the first computing node using the configuration data; and managing, by the virtualization manager, a first container on the first computing node using the set of attribute/value pairs for the first computing node.

Abstract: A request to install a first version of a software application is received. The first version of the software application is stored in a first blockchain in a first distributed blockchain ledger. In response to receiving the request to install the first version of the software application, the first version of the software application is validated by running a hash of the first blockchain. In response to validating the first version of the software application, the first version of the software application is installed from the blockchain to a device. The software application may also be validated after being installed to the device.

Abstract: A first message is received from a first communication device. The first message comprises an authentication token. For example, the authentication token may be a username/password. A determination is made if the first message also comprises a valid temporary password. The temporary password is used to prevent a Denial-of-Service (DOS) attack. In response to the first message comprising the valid temporary password, a determination is made if the authentication token is valid. In response to the authentication token being valid, the first message is responded to in a normal manner. If the first message does not contain the temporary password, the first message is handled based on a DOS message handling process.

Abstract: A computing device includes a processor and a machine-readable storage storing instructions. The instructions are executable by the processor to: receive a bit vector representing input data to be tokenized; divide the bit vector into two vector portions; and perform a plurality of rounds of a Feistel network on the two vector portions, each round including converting one vector portion using a table-based hash function that combines multiple tokens retrieved from at least one token table.

Abstract: A non-tokenized string is received. For example, a non-tokenized string could be a credit card number. The non-tokenized string is partitioned into a plurality of non-tokenized substrings. For example, if the credit card number is 16 digits long, it may be partitioned into substrings that are three, six, and seven digits in length. The non-tokenized substrings are used as an index into a plurality of lookup tables. As a result of the indexing, a plurality of tokenized substrings are retrieved. The plurality of tokenized substrings are combined into a tokenized string. The tokenized string is used as a token that represents the credit card number without disclosing the actual credit card number. The reverse of the above process can also occur.

Abstract: A synchronization structure that indicates changes to files that are to be synchronized is created. The synchronization structure is stored as a series of synchronization blocks. A first synchronization message is received from a communication device. The first synchronization message includes a next block number. A second synchronization message is sent to the communication device. The second synchronization message comprises one or more synchronization blocks that are identified based on the next block number. A third synchronization message is received from the communication device. The third synchronization message requests a number of files to be synchronized. The number of files to be synchronized are sent to the communication device.

Abstract: A system includes a processor and a memory coupled with and readable by the processor and storing therein a set of instructions. When executed by the processor, the processor is caused to receive application events associated with an application and create data records based on the application events. The processor is further caused to compute an interestingness value for each of the data records based on a goal of the application, assign the computed interestingness value to each of the data records and store each of the data records with the assigned interestingness value.

Abstract: Results of an authentication process are received. The authentication process allows for a graded level of authentication using a plurality of authentication types (e.g., a username/password and a fingerprint scan). Encrypted data is then accessed. The encrypted data has been encrypted using a plurality of encryption levels. The data is unencrypted based on the graded level of authentication. In a second embodiment, a system and method are provided that establish a communication session (e.g., a voice or email communication session). The communication session is between a plurality of users. During the communication session, an indication is received to change an encryption level for the communication session. In response to receiving the indication to change the encryption level for the communication session, an encryption level of the first communication session is dynamically changed from a first level of encryption to a second level of encryption.

Abstract: Embodiments of the present disclosure provide a system for generating risk scores in near real-time. The system includes a processor and a memory coupled with and readable by the processor and storing therein a set of instructions. When executed by the processor, the processor is caused to generate risk scores in near real-time by receiving near real-time application events associated with an application in near real-time and identifying anomalies from the near real-time application events. The processor is further caused to generate risk scores in near real-time by generating an intermediate near real-time risk score for the identified anomalies and combining the intermediate near real-time risk score with a batch risk score generated from a batch process executed prior to receiving the near real-time application events to generate a near real-time risk score.

Abstract: A request is received, by a plurality of nodes that are part of a distributed blockchain ledger, to add a transaction block to a plurality of blockchains in the distributed blockchain ledger. The transaction block comprises a transaction block authentication credential(s). The plurality of nodes that are part of the distributed blockchain ledger determine if the transaction block authentication credential(s) are valid. An indication is received from at least a majority of the plurality of nodes that are part of the distributed blockchain ledger that the transaction block authentication credential(s) are valid. In response to receiving the indication from the at least a majority of the plurality of nodes that are part of the distributed blockchain ledger that the transaction block authentication credential(s) are valid, the transaction block is added to the plurality of blockchains in the distributed blockchain ledger.

Abstract: Testing software applications is routinely limited by time or testing iterations rather than exhaustively testing ever possible permutation of inputs or execution paths. By configuring a testing device to only perform relevant tests, the test results are more meaningful (e.g., few false-positives) and relevant to the application. Additional effects include reduced processing times and storage requirements. As described herein, source code is analyzed to determine elements that indicate a particular environment for the source code's corresponding machine code. When the source code indicates that a particular environment is not a candidate for execution of the machine code, tests associated with that particular environment are excluded. The testing device is then configured to perform those tests, either statically or dynamically, that are relevant for those environments that actually apply.

Abstract: A sub-archive is initiated. The sub-archive saves changes that have occurred since a previous final archive. Changes to an operational database (i.e., the operational database that is being archived) are allowed during the first sub-archive. A final archive is initiated in series after the sub-archive has completed. The final archive does not allow changes to the operational database when the final archive is active. In one embodiment, the sub-archive may comprise a plurality of sub-archives that depend on an amount of outstanding changes that exist in the operational database.

Abstract: Secure multi-party information retrieval is disclosed. One example is a system including a query processor to request secure retrieval of candidate terms similar to a query term. A collection of information processors, where a given information processor receives the request and generates a random permutation. A plurality of data processors, where a given data processor generates clusters of a plurality of terms in a given dataset, where the clusters are based on similarity scores for pairs of terms, and selects a representative term from each cluster. The given information processor determines similarity scores between a secured query term received from the query processor and secured representative terms received from the given data processor, where the secured terms are based on the permutation, and the given data processor filters, without knowledge of the query term, the candidate terms of the plurality of terms based on the determined similarity scores.

Abstract: Testing software applications often requires a balancing of thoroughness versus the time and computing resources available to perform such tests. Certain data handling operations may potentially expose data to unauthorized parties. However, not all data is equal; some data requires a greater degree of protection than other data, which may be based on a security context (e.g., rule, law, policy, etc.). By generating rules determined by a particular context, extraneous tests on data outside of the context, may be omitted. Unnecessary tests may be omitted and the results of each analysis process correlated to identify actual vulnerabilities and omit false positives, such as vulnerabilities to data that does not require the same degree of care to avoid unauthorized exposure.

Abstract: A request to retroactively add one or more of an encryption level, an encryption type, a security level, and an authentication level to an existing blockchain is received. An authentication/encryption block is added to the existing blockchain. The authentication/encryption block comprises the one or more of the encryption level, the encryption type, the security level, and the authentication level. Based on the added authentication/encryption block in the existing blockchain, the one or more of the encryption level, the encryption type, the security level, and the authentication level are retroactively applied to at least a portion of blockchain data in the existing blockchain. In one embodiment, a data structure is used in place of the authentication/encryption block.