Microsoft Technology Licensing, LLC

Google Inc.

Matthew C Cary

Ramarathnam R Venkatesan

Mariusz Hieronim Jakubowski

Yuqun Chen

Saurabh Sinha

Ruoming Pang

Aaron Shon

Gideon Andreas Yuval

Yacov Yacobi

Michael Skinner

Courtney L Bowman

Gregory Scott West

Leon Chih Wen Wong

Guy Calvert

Michael English

Methods, systems, and apparatus, including computer program products, in which one or more webpages are identified based on one or more signals associated with an advertisement, a content of each of the webpages, and a property associated with the advertisement, and a performance measure is determined for the advertisement for each of the webpages. An auction score is calculated for the advertisement for each of the webpages based on the performance measure and a bid associated with the advertisement.

Contextual targeting prediction

A publication evaluation subsystem generates publication scores for publications. Each publication score is indicative of an expected performance for content that is presented with the publication. The publication scores are generated relative to a baseline performance measure. The baseline performance measure has a value that is indicative of an expected performance of any selected content presented with any publication in the content network. More than one publication score can be generated for each publication, with each publication score being indicative of the performance of a sub-group of content items that are presented with the publication. The sub-group of content items can include content items that each share a common characteristic. For example, a publication score can be generated for a sub-group of content items that are associated with common targeting criteria (e.g., keywords).

Publication evaluation

Among other disclosed subject matter, a computer-implemented method for modifying an estimate value includes determining a first estimate value based on a plurality of values relating to a first entity. The method includes determining a second estimate value for at least one second entity identified as a peer of the first entity. The method includes modifying the first estimate value using the second estimate value.

Modifying an estimate value

Techniques are disclosed to enable efficient implementation of secure hash functions and/or stream ciphers. More specifically, a family of graphs is described that has relatively large girth, large claw, and/or rapid mixing properties. The graphs are suitable for construction of cryptographic primitives such as collision resistant hash functions and stream ciphers, which allow efficient software implementation.

Primitives for fast secure hash functions and stream ciphers

A computer-implemented system and method for configuring and operating a white-box cipher is disclosed. In one implementation, the system employs a method for configuring pseudorandom data derived from a key to perform key-scheduling functionality associated with rounds of the cipher. Additionally, the system employs a method for generating white-box executable code, wherein the code hides the pseudorandom data by incorporating it into mathematical operations performed during execution of the rounds. Accordingly, the cipher is suited for white-box applications managing digital rights, such as decoding audio, video and other content.

Semi-public white-box cipher

An implementation of a technology, described herein, for facilitating the protection of computer-executable instructions, such as software. At least one implementation, described herein, may generate integrity signatures of one or more program modules&#x2014;which are sets of computer-executable instructions&#x2014;based upon a trace of activity during execution of such modules and/or near-replicas of such modules. With at least one implementation, described herein, the execution context of an execution instance of a program module is considered when generating the integrity signatures. With at least one implementation, described herein, a determination may be made about whether a module is unaltered by comparing integrity signatures. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Integrity ordainment and ascertainment of computer-executable instructions with consideration for execution context

An implementation of a technology, described herein, for facilitating the protection computer-executable instructions, such as software. At least one implementation, described herein, may generate integrity signatures of multiple sets of computer-executable instructions based upon the output trace and/or an execution trace of such sets. With at least one implementation, described herein, a determination may be made about whether two or more of such sets are unaltered duplicates by comparing integrity signatures of such sets. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Integrity ordainment and ascertainment of computer-executable instructions

An implementation of a technology, described herein, for facilitating the protection computer-executable instructions, such as software. At least one implementation, described herein, may generate integrity signatures of one or more program modules&#x2014;which are sets of computer-executable instructions&#x2014;based upon a trace of activity during execution of such modules and/or near-replicas of such modules. With at least one implementation, described herein, the execution context of an execution instance of a program module is considered when generating the integrity signatures. With at least one implementation, described herein, a determination may be made about whether a module is unaltered by comparing integrity signatures. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Growing community of inventors

Seattle, WA, United States of America

Matthew C Cary