Microsoft Technology Licensing, LLC

Alibaba Singapore Holding Private Limited

The Neat Company, Inc.

Alibaba Group Holding Limited

Shuo Chen

Yi-Min Wang

Rui Wang

Jiahe Helen Wang

Jiesheng Wu

Qingda Lu

Zhu Pang

Chad E Verbowski

John David Dunagan

Shaz Qadeer

Yuri Gurevich

Venkataraman Pranatharthiharan

Ralf Sasse

Yuchen Zhou

Lidong Zhou

Emre Mehmet Kiciman

Boxin Li

Xiaofeng Fan

Yang Chen

Zhenbin Xu

David Andrew Ross

Tuomas Aura

Mao Yang

George Danezis

Zhongxin Guo

Xian Zhang

Jose Meseguer

John D Dungan

Yuanjiang Ni

Xiaobing Guo

Qiufeng Yin

According to implementations of the subject matter described herein, a solution is provided for pirated copy tracing based on a third party. In the solution, a report on a pirated copy of a digital content is received from a third party, wherein the report comprises first secret information for characterizing a first identification, time information and tracing information of the pirated copy. Subsequently, a request for verifying the report is received to determine whether the report is valid. When the report is determined as valid, a licensee associated with the report is marked as a first status to indicate that the pirated copy might be leaked by the licensee. Therefore, the pirated copy may be effectively traced based on third parties. The tracing information in the report can be hidden, and other third parties can therefore be prevented from using the tracing information for duplicate reports.

Third party based pirated copy tracing

A key-value engine may perform garbage collection for a tree or hierarchical data structure on an append-only storage device with page mappings. The key-value engine may separate hot and cold data to reduce write amplification, track extent usage using a restricted or limited amount of memory, efficiently answer queries of valid extent usage, and adaptively or selectively defragment pages in snapshots in rounds of garbage collection.

Garbage collection of tree structure with page mappings

A key-value engine of a storage system may perform a restart recovery after a system failure. The key-value engine may read a metadata log to locate a latest system checkpoint, and load a page mapping table from the latest system checkpoint. The key-value engine may replay to apply changes to the page mapping table from a system transaction log starting from a system transaction replay starting point. The key-value engine may further form one or more read-only replicas using an underlying file stream opened in a read-only mode during the recovery after the system failure to further facilitate fast recovery and provide fast response to user transactions that conduct read only transactions after the system failure.

Fast recovery and replication of key-value stores

Systems and methods discussed herein, based on a key-value data store including multiple-tiered sorted data structures in memory and storage, implement granularly timestamped concurrency control. The multiple-tiering of the key-value data store enables resolving the snapshot queries by returning data record(s) according to granularly timestamped snapshot lookup instead of singularly indexed snapshot lookup. Queries return a merged collection of records including updates from data structures in memory and in storage, such that a persistent storage transaction may refer to non-committed updates up to a timeframe defined by the snapshot read timestamp. This way, inconsistency is avoided that would result from merely reading data records committed in storage, without regard as to pending, non-committed updates thereto. The global timestamp further modifies the generation of the local transaction commit timestamp and the local snapshot read timestamp, so as to establish a granularly timestamped concurrency control scheme (over three levels of granularity).

Granularly timestamped concurrency control for key-value store

A mapping correspondence between memory addresses and request counts and a cache line flusher are provided, enabling selective cache flushing for persistent memory in a computing system to optimize write performance thereof. Random writes from cache memory to persistent memory are prevented from magnifying inherent phenomena of write amplification, enabling computing systems to implement persistent memory as random-access memory, at least in part. Conventional cache replacement policies may remain implemented in a computing system, but may be effectively overridden by operations of a cache line flusher according to example embodiments of the present disclosure preventing conventional cache replacement policies from being triggered. Implementations of the present disclosure may avoid becoming part of the critical path of a set of computer-executable instructions being executed by a client of cache memory, minimizing additional computation overhead in the critical path.

Random-access performance for persistent memory

A system and method for invoice field detection and parsing includes the steps of extracting character bounding blocks using optical character recognition (OCR) or digital character extraction (DCE), enhancing the image quality, analyzing the document layout based on imaging techniques, detecting the invoice field based on the machine learning techniques, and parsing the invoice field value based on the content information.

Document field detection and parsing

A framework is described herein for identifying implicit assumptions associated with an SDK and its accompanying documentation (e.g., dev guide). An implicit assumption is information that is not expressly stated in the documentation, but which would be useful in assisting an application developer in building an application. The framework also describes a systematic approach for identifying one or more vulnerability patterns based on the identified implicit assumptions. An application developer may run a test on an application that is being developed to ensure that it does not have any deficiency which matches a vulnerability pattern.

Identifying implicit assumptions associated with a software product

Systems and methods for verifying an application data modification are described herein. In one example, a method includes detecting modified application data in a computing device and determining the modified application data did not originate from an automatic program. The method also includes sending an identifier and the modified application data to a signing server. Furthermore, the method includes receiving encrypted data comprising the identifier and the modified application data from the signing server. Additionally, the method includes storing the encrypted data in the computing device.

Anonymous server based user settings protection

Systems and methods to manage same-origin-policy (SOP) failures that occur in a computing environment are provided. In an illustrative implementation, an exemplary computing environment comprises a lockbox module, and an instruction set comprising at least one instruction directing the lockbox module to process data and/or computing application execution commands representative of and a request for a selected operation/feature according to a selected SOP management paradigm. In the illustrative implementation, the SOP management paradigm comprises one or more instructions to deploy a 'lockbox' computing application element allowing for the management, monitoring, and control of computing application features/operations operable under a same origin policy.

Lockbox for mitigating same origin policy failures

Sharing of user preferences is described. In an embodiment a user preference associated with a user is shared with a group of users in order to improve the relevance of results they receive. A database is used to store information detailing a number of groups of users extracted from a social network graph, where the social network graph describes connections between users. On receipt of a user preference associated with a user, a group of users containing the user is selected and the user preference is then shared with everyone in the selected group. In a further embodiment, the groups of users in the database may comprise cohesive groups of users and an extended group associated with each cohesive group. When selecting a group to share preference data with, a cohesive group containing the user is first selected and then the preference data is shared with the corresponding extended group.

Sharing of user preferences

A method includes placing an accent in a frame, and only letting frames with the same accent communicate with each other. This accenting is removed using an accent key immediately prior to a compilation operation. The accenting can be performed by performing an XOR operation on a data stream using a key. In one exemplary non-limiting embodiment a computing system is provided. The computing system includes a memory, and a processor coupled to the memory, the processor configured to introduce domain specificity to at least one of a script and an HTML object name. In another exemplary non-limiting embodiment, means are provided for introducing domain specificity to at least one of a script and an HTML object name and means are provided for removing the introduced domain specificity prior to a compiling operation.

Methods and apparatus for securing frames from other frames

To achieve end-to-end security, traditional machine-to-machine security measures are insufficient if the integrity of the graphical user interface (GUI) is compromised. GUI logic flaws are a category of software vulnerabilities that result from logic flaws in GUI implementation. The invention described here is a technology for uncovering these flaws using a systematic reasoning approach. Major steps in the technology include: (1) mapping a visual invariant to a program invariant; (2) formally modeling the program logic, the user actions and the execution context, and systematically exploring the possibilities of violations of the program invariant; (3) finding real spoofing attacks based on the exploration.

Systematic approach to uncover visual ambiguity vulnerabilities

Systematic approach to uncover GUI logic flaws

Growing community of inventors

Kenmore, WA, United States of America

Shuo Chen