Microsoft Technology Licensing, LLC

Lidong Zhou

Chandramohan Amyangot Thekkath

Paramvir Bahl

Fan Yang

Alastair Wolman

Atul Adya

Jitendra Dattatraya Padhye

Dahlia Malkhi

Lili Qiu

Lintao Zhang

Guobin Shen

Vijayan Prabhakaran

John Philip MacCormick

Ming Wu

Srinath Setty

Ananth Rajagopala Rao

Parveen Kumar Patel

Ramarathnam R Venkatesan

Marcus Peinado

Chen Wang

Zheng Zhang

Richard L Hasha

Jacob Rubin Lorch

Roy Levin

Manuel Costa

Lu Xun

Thomas Lee Rodeheffer

Zhenyu Guo

Raymond Cheng

Jinglei Ren

Aapo Kyrola

Xuetian Weng

Ji Hong

Youshan Miao

Gang Hu

Jian Tang

Shuo Chen

Leslie B Lamport

Miguel Castro

Marcus Jon Jager

Yang Chen

Xuezheng Liu

Shiding Lin

Kristof Roomp

William Raymond Hoffman

Zhengping Qian

Soumya Basu

JunFeng Yang

Jiaxing Zhang

Xiuwei Chen

Venugopalan Ramasubramanian

Mao Yang

Li Zhuang

Yaacov Fernandess

Zhongxin Guo

Haoxiang Lin

Ivan Beschastnikh

Michael Lowell Roberts

Xian Zhang

Qiufeng Yin

Hucheng Zhou

Huayang Guo

Tisheng Chen

Nicholas Charles Murphy

Xiaobing Guo

Gopala Kirhsna R Kakivaya

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 computing device requests access to an application object from a remote storage system in order to locally execute application functionality without hosting application resources. An accessed object is associated with an intent in the storage system and locked. Locking an object in combination with an intent prevents computing devices that are not performing the intent from accessing the object. An intent defines one or more operations to be performed with the requested object, which are serialized as intent steps and stored in the storage system. Upon executing an intent step, the computing device stores a log entry at the storage system signifying the step's completion. A locked object remains locked until the log entries indicate every intent step as complete. Different computing devices can unlock a locked object by executing any incomplete steps of an intent associated with the locked object.

Intents and locks with intent

Systems and methods described herein relate to secure, efficient, confidential, and/or outsourced blockchain networks, which can enable a group of mutually distrusting participants to securely share state and then agree on a linear history of operations on that shared state.

Blockchain system for leveraging member nodes to achieve consensus

A multi-party security protocol that incorporates biometric-based authentication and withstands attacks against any single party (e.g., mobile phone, cloud, or the user). The protocol involves the function split between mobile and cloud and the mechanisms to chain-hold the secrets. A key generation mechanisms binds secrets to a specific device or URL (uniform resource locator) by adding salt to a master credential. An inline CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) handling mechanism uses the same sensor modality as the authentication process, which not only improves the usability, but also facilitates the authentication process. This architecture further enhances existing overall system security (e.g., handling untrusted or compromised cloud service, phone being lost, impersonation, etc.) and also improves the usability by automatically handling the CAPTCHA.

Usable security of online password management with sensor-based authentication

A machine-implemented method includes automatically determining that a host device is restarting from a disruptive stoppage of operations and that in-process write transactions by the host device to respective pages of non-volatile storage may have been interrupted. The method includes, in response to the determination, automatically scanning the non-volatile storage for all metadata-containing storage pages with respective identifications S(i) and having corresponding metadata relating each respective storage page S(i) to a corresponding data page P(j) and a corresponding version number V(k). The method includes automatically identifying scanned storage pages S(i) that have for their corresponding data page P(j) a most recent version number HV(k) and, in some cases, a secondmost recent version number. The method includes designating for expungement scanned storage pages S(i) that are not both of committed and having the more recent of the most recent and secondmost recent version number for their corresponding data structure page P(j).

Cyclic commit transaction protocol

A continuous stream data (e.g., messages, tweets) is received by ingest nodes of a platform. The ingest nodes may analyze the data to create a transaction of graph updates, assign a sequence number to the transaction, and distribute the graph updates with the sequence number to graph nodes of the platform. The graph nodes may store graph updates from ingest nodes, and then the ingest nodes may report graph update progresses in a progress table. A snapshot may be taken based on the progress table, and then graph-mining computation may be implemented. Tolerate failures and decaying may be supported and incremental expansion may be allowed to cope with increasing update rates and computation needs.

Platform for continuous graph update and computation

A cyclic commit protocol is used to store relationships between transactions and is used by the technology to determine whether a transaction is committed or not. The protocol allows creation of a cycle of transactions which can be used to recover the state of a storage device after a host failure by identifying the last committed version of intention records as committed or uncommitted based on the data stored in the physical pages.

Data-parallel computation programs may be improved by, for example, determining the functional properties user defined functions (UDFs), eliminating unnecessary data-shuffling stages, and/or changing data-partition properties to cause desired data properties to appear after one or more user defined functions are applied.

Data-parallel computation management

Data that is collected and disseminated by mobile devices typically has to be processed, correlated with other data, aggregated, and then transmitted back to the mobile device users before the information becomes stale or otherwise irrelevant. These operations may be performed in a cloud-based solution that manages dataflow. The cloud-based solutions may be scalable and implemented in a fault-tolerant distributed system to support user-facing continuous sensing and processing services in the cloud-computing system. A system may monitor execution of data and shift workloads (i.e., balancing) in response to spatial and temporal load imbalances that occur in a continuous computing environment. A failure recovery protocol may be implemented that uses a checkpoint-based partial rollback recovery mechanism with selective re-execution, which may allow recovery of the continuous processing after an error while avoiding large amounts of downtime and re-execution.

Platform for continuous mobile-cloud services

Architecture employs an iterative process that incrementally discovers inter-component interactions and explores local state spaces within each component. Thus, the architecture lazily constructs the behavior of the environment of a component in the target software system, and integrates the construction of the inter-component interactions with the model checking process itself, and hence, does not need to eagerly construct the interface process. Component-based state space reduction is applied during the exploration of the whole system. The architecture decomposes a target software system into a set of loosely coupled components where interactions between the components tend to be significantly simpler than interactions within each component. An iterative algorithm facilitates the component-based state space reduction, which is exponential, on the real large-scale software systems.

Dynamic interface reduction for software model checking

Data is automatically shared over one or more contact networks which are interrelated by a trust relationship. The data can be shared using a network-based communication service and is stored as a data record in a local data store. The communication service may be implemented as an instant messaging, electronic mail, mobile phone or some other type of communication service. The data record can include data created by a user, a relevance value, a maximum share count and/or other data. The number of times that data may be shared may be configured by the user that generates the data. The relevance of the data may be updated each time the data is shared.

Sharing data over trusted networks

Methods and architectures for automatic filter generation are described. In an embodiment, these filters are generated in order to block inputs which would otherwise disrupt the normal functioning of a program. An initial set of filter conditions is generated by analyzing the path of a program from a point at which a bad input is received to the point at which the malfunctioning of the program is detected and creating conditions on an input which ensure that this path is followed. Having generated the initial set of filter conditions, the set is made less specific by determining which instructions do not influence whether the point of detection of the attack is reached and removing the filter conditions which correspond to these instructions.

Automatic filter generation and generalization

Growing community of inventors

Sunnyvale, CA, United States of America

Lidong Zhou