Microsoft Technology Licensing, LLC

Boris Asipov

Saikat Guha

Michael Aksionkin

Justin R Dellamore

Rithesh Baradi

Alisson Sol

Guoyu Hao

Leena Jain Sheth

Keren Asipov

Steven Peter Herbert

Jonathan Preston Carter

Fiona Fung

Aidan Thomas Joseph Hughes

Steve P Herbert

Aditya Gupta

Vitaly L Rubtsov

Khaled Mohamed Morssi Ibrahim

Methods, systems, apparatuses, and computer program products are provided for updating a catalog of assets. A scanning agent may scan for a set of assets in a data store. A scan validator may receive, from the scanning agent, a list of assets scanned in the data store and determine that a summary record is received from the scanning agent. The summary record may include an asset summary generated by the scanning agent corresponding to the list of scanned assets. In response to determining that the summary record is received, the scan validator may determine whether the asset summary in the summary record matches an asset summary generated from the list of assets. If a match is determined between the asset summaries, a match validation may be provided. In response to the match validation being provided, assets absent from the list of assets may be removed from the asset catalog.

Reliable detection of deleted assets in data stores

Non-limiting examples of the present disclosure describe systems and methods for scanning of data for policy compliance. In one example, network data is evaluated to generate one or more groupings. A grouping may be based on file type of the network data. Data identification rules are applied to identify one or more data schemas from file data of a grouping. One or more policy rules that apply to content of the data schema may be determined. At least one file of the file data may be scanned to determine compliance with the one or more policy rules. A report of compliance with the one or more policy rules may be generated based on a result of a file scan. Other examples are also described.

Compliance violation detection

Techniques described herein are directed to determining an effective tag for data assets. For instance, each tag associated with a data asset may be associated with certain attributes. Non-limiting examples for such attributes may include a confidence level associated with a source that applied the tag, an applied date at which the tag was applied to the data asset, and/or a hierarchical depth of the data asset to which the tag was applied, as well as additional and/or alternative types of attributes. When a request to determine a tag for a data asset is received, the attributes for all the tags applied to the data asset may be retrieved and/or analyzed to determine which of such tags effectively classifies the data asset. The determined effective tag may be returned to the requesting entity.

Compute-efficient effective tag determination for data assets

Described herein is a system and method for utilizing data flow analysis to perform data classification with respect to a source dataset and a generated derived dataset. A flow confidence for a field is calculated using an adaptive algorithm in accordance with the action performed and the derived dataset. An associated derived confidence for a particular tag is calculated in accordance with an associated confidence and the flow confidence. When the associated derived confidence is greater than or equal to a first threshold, the particular tag is copied to the derived dataset. In some embodiments, when the associated derived confidence is less than or equal to a second threshold, the particular tag is not copied to the derived dataset. Otherwise an action to be taken is identified. A response to the action is received and the adaptive algorithm is modified in accordance with the received response.

Data classification using data flow analysis

According to one aspect of the present disclosure, a computing device is provided, including non-volatile memory storing a database including a plurality of database entries. The computing device may further include a processor configured to sort the plurality of database entries into a plurality of database entry length sets. For each database entry length set, each database entry included in the database entry length set may be within a predefined length range. For each database entry length set, the processor may be further configured to generate a probabilistic data structure based on the one or more database entries included in the database entry length set.

Data classification using probabilistic data structures

Methods, systems, apparatuses, and computer program products are provided for enabling server-side web application execution by maintaining a server-side DOM that is mirrored at the client-side. A client-side DOM is rendered in a browser at a client computing device and corresponds to a server-side DOM at a server. An event indication associated with the client-side DOM is received from a client-side event manager at the client computing device. The received event indication is provided to server-side application code defining a web application to which the client-side DOM corresponds. An instruction is generated by the server-side application code based on the event indication. The server-side DOM is modified in response to the instruction. An indication of the modification is provided to a client-side DOM manager at the client computing device to apply to the client-side DOM, thereby synchronizing the client-side DOM to the server-side DOM.

Manipulation of browser DOM on server

A flash storage device and a method for using the flash storage device to prevent unauthorized use of a software application are provided. An identifier may be encoded within specific sectors of the flash storage device. One bits of the identifier may be encoded as unusable ones of the specific sectors and zero bits of the identifier may be encoded as usable one of the specific sectors. Alternatively, the zero bits of the identifier may be encoded as the unusable ones of the specific sectors and the one bits of the identifier may be encoded as the usable ones of the specific sectors. The software application may be permitted to execute on a processing device connected to the flash storage device only when the identifier is encoded within the flash storage device.

Using flash storage device to prevent unauthorized use of software

An extensible editor for editing program source code can customize a default display provided by a language service in an IDE. The default display can be modified using source code-specific extension code. The extension code can be provided by a third party. The extension code can reside in the source code file to which it applies. The extension code can reside in a separate file from the file in which the source code resides. A naming convention can be used to enable the extensible editor to locate the extension code. Display entries can be filtered, added, removed, or modified using an API provided by the extensible editor. The API can allow the extension code to register for one or more events including but not limited to a completion hint event, a completion list event, and a function help event. User-provided extensions can be used to customize default display results.

Extensible mechanism for providing suggestions in a source code editor

A method for preventing the unauthorized modification of a software or unauthorized modification of runtime data. According to this method, a converter, which is capable of converting the software into a generalized machine code is provided. The converter is designed such that it cannot he reverse engineered, by using a conversion process that causes data loss. An interpreter, which the knowledge of its process method is kept restricted, is also provided. The interpreter interprets the general machine code into a specific machine code, while reconstructing the lost data during the interpretation process.

Method for preventing software reverse engineering, unauthorized modification, and runtime data interception

Techniques are described for performing decryption using a key-specific decryption engine. A message including an encrypted data portion is received. The encrypted data portion is formed by performing a symmetric encryption operation using a symmetric key. The encrypted data portion is decrypted using a key-specific decryption engine which does not use the symmetric key as an input. Also described are techniques for generating the key-specific decryption engine which may be implemented using boolean functions determined for the symmetric key.

Techniques for performing symmetric cryptography

During a software activation process, a processing device may provide a software license key to be communicated to an activation authority. The software license key may be provided to the activation authority via one of a number of communication methods, such as, for example, via a telephone, via a facsimile, via e-mail, via a text message, or via other communication methods. A length of the software license key may be based on an expected amount of time to provide the software license key to the activation authority. When the expected amount of time is relatively long, the software license key may be relatively short. When the expected amount of time is relatively short, the software license key may be relatively long. In some embodiments, a relatively short software license key may be a unique subset of a relatively long software license key.

Optimizing amount of data passed during software license activation

A method for preventing the unauthorized modification of a software or unauthorized modification of runtime data. According to this method, a converter, which is capable of converting the software into a generalized machine code is provided. The converter is designed such that it cannot be reverse engineered, by using a conversion process that causes data loss. An interpreter, which the knowledge of its process method is kept restricted, is also provided. The interpreter interprets the general machine code into a specific machine code, while reconstructing the lost data during the interpretation process.

Growing community of inventors

Bellevue, WA, United States of America

Boris Asipov