Amazon Technologies, Inc.

Microsoft Technology Licensing, LLC

Other

Microsoft Corporation

Nicholas Alexander Allen

John Anthony Taylor

Kenneth David Wolf

Gregory Branchek Roth

Justin David Brown

Matthew John Campagna

Elena Dykhno

Gregory Alan Rubin

Edmund Samuel Victor Pinto

Stephen Jared Maine

Stefan R Batres

Stephen James Millet

Eric Jason Brandwine

Cristian Marius Ilac

Kartik Paramasivam

Matthew Roy Noble

Andrew Thomas Troutman

Joshua William McFarlane

Andrew Kyle Driggs

Erik B Christensen

Tirunelveli R Vishwanath

Daniel Ron Simon

Karthik Raman

Raleigh Harrison Upshur

Edmund S V Pinto

Margaret J Lye

James Ernest Johnson

John Raymond Justice

Andrew Paul Mikulski

Slavka Praus

Christopher Brian Barclay

Patrick James Ward

Jayteerth Narasingrao Katti

David J Whitney

Petr Praus

Bin Li

Evgeny Osovetsky

Xianrui Jeri Meng

Matthew J Morrisson

Philbert L Henning, Ii

Andrew Hopkins

Dharma Kiritkumar Shukla

Peter Zachary Bowen

Richard Douglas Hill

Affan Arshad Dar

Tao Xie

Alexander Evgenievich Nosov

Igor Sedukhin

Jean-Emile Elien

Roman Batoukov

Tomasz Janczuk

Asad Jawahar

William Trotter Shelton

David Leon Stucki

Ramasubramaniam Poornalingam

Stuart J Langley

Jay Thaler

Sergiy V Kuryata

Kirill Gavrylyuk

Matthew Stephen Bullock

Tres L Henry

Raul Guillermo Camacho

William Leo Oellermann, Jr

Margaret J Drollinger

Jonathan M Cole

Yavor Georgiev

Jesse R Yurkovich

Mark Prentice

Edmund Sv Pinto

Stefen R Batres

Described implementations obtain a proof of valid attestation data. The attestation data may include configuration data of a host computing system. A prover service may receive the attestation data. The prover service may generate a proof to prove that the attestation data includes valid configuration data of the host computer system, without revealing sensitive or private information of the host computing system. The proof may be a zero-knowledge proof.

Privacy preserving attestation

A first computing system establishes a cryptographically protected communication session with a second computing system by proposing a hybrid cryptographic scheme. In response to the proposed hybrid cryptographic scheme, a second computing system transmits cryptographic materials to the first computing system, and the first computing system transmits cryptographic materials to the second computing system. Using the cryptographic materials, two or more cryptographic keys are derived. One cryptographic key is used to perform an inner cryptographic operation on one or more data items, and another cryptographic key is used to perform an outer cryptographic operation on the one or more data items that have been cryptographically protected by the inner cryptographic operation.

Hybrid key exchanges for double-hulled encryption

Described implementations obtain credential information including an encrypted digital identity (ID). The encrypted digital ID may include a public component of a credential and identity data. Furthermore, the credential information may include cryptographically obfuscated data based on the identity data and a private component of the credential. A proof is obtained that includes proof data. The proof data may confirm that the credential information was correctly generated. Verification of the proof data, and confirmation that the cryptographically obfuscated data is not associated in a collection of cryptographically obfuscated data, cause a computer-implemented service to issue a pseudonym. The pseudonym is usable to generate a relationship associated with a computer-implemented service.

Privacy preserving account generation

Techniques for fault-tolerant function placement across multiple computing placement locations are described. An application placement service obtains a latency-based placement of functions of an application and utilizes resource information associated with the placement locations to determine error rates for flows of the placement. For flows having an error rate falling outside of an allowable range, the application placement service can modify the placement to improve the error rate, e.g., by adding additional redundancy for functions in higher-error placement locations within those placement location tiers, and/or by adding additional redundancy for functions in higher-error placement locations within different placement location tiers.

Fault-tolerant function placement for edge computing

A computer system obtains a request to apply a signed patch to a piece of signed executable code. The computer system determines whether the signed patch is allowed to be applied to the signed executable based on a set of patch policies. If the patch policies allow the patch to be applied, the patch is applied to the signed executable code. The computer system generates a new digital signature for the modified executable code thereby allowing the resulting signed patched executable code to be verified and executed by the computer system.

Code signing method and system

A service provider provides virtual computing services using a fleet of one or more host computer systems. Each of the host computer systems may be equipped with a trusted platform module ('TPM'). The service provider, the host computer systems, and the virtual computing environments generate attestations that prove the integrity of the system. The attestations are signed with a one-time-use cryptographic key that is verifiable against the public keys of the service provider, a host computer system, and a virtual computing environment. The public key of the host computer system is integrated into a hash tree that links the public key of the host computer system to the public key of the service provider. The public key of the virtual computing environment is signed using a one-time-use graphic key issued to the host computer system that hosts the virtual computing environment.

Host attestation

Systems and methods for implementing a secure and efficient cryptographic protocol for analyzing data objects while providing assurances of data privacy and security. A data object may be obfuscated and provided for analysis (e.g., to a data analytics service) without necessarily providing access to the (e.g., plaintext) data object. For example, a first computing entity and second computing entity may agree upon a function or circuit that performs a certain type of computational task, such as comparing a first data set controlled by the first computing entity and a second data set controlled by the second computing entity. An event-driven function may be invoked by the event-driven compute service in response to detecting satisfaction of a condition as part of monitoring alerts that are generated as a result of the output of the computational task described above.

Multi-party analysis of streaming data with privacy assurances

The disclosure relates to provisioning honeypot computing services using computing resources in a defective computing resource pool. In one example, a computing system can generate a maliciousness score for a received resource allocation request, determine that the generated maliciousness score exceeds a maliciousness threshold and identify a computing resource in a defective resource pool that is eligible to satisfy the request. The system can then provision honeypot computing services to fulfill the request, using the identified computing resource in the defective resource pool.

Allocating defective computing resources for honeypot services

Non-volatile devices may be configured such that a clear operation on a single bit clears an entire block of bits. The representation of particular data structures may be optimized to reduce the number of clear operations required to store the representation in non-volatile memory. A data schema may indicate that a data structure of an application may be optimized for storage in non-volatile memory. A translation layer may convert an application level representation of a data value associated with the data structure to an optimized storage representation of the data value before storing the optimized storage representation of the data value in non-volatile memory.

Data storage optimization for non-volatile memory

A first public key is generated based at least in part on a first plurality of signing keys and a second public key is generated based at least in part on a second plurality of signing keys. The signing keys may be used to generate digital signatures. The second public key may be made available to verify a digital signature generated using a signing key from the second plurality of signing keys. In some cases, a first Merkle tree may be formed by the first public key and the first plurality of signing keys, and a second Merkle tree may be formed by the second public key, the first public key, and the second plurality of signing keys.

Merkle signature scheme tree expansion

A method and apparatus for configuring an overlay network are provided. In the method and apparatus, an application source comprising an executable portion is obtained. A computer system instance is caused to execute at least some of the executable portion, and a snapshot of the computer system instance after partial but incomplete execution of the executable portion is obtained such that the snapshot is usable to instantiate another computer system instance to continue execution of the executable portion from a point in execution at which the snapshot was obtained.

Fast-booting application image

In certain embodiments, a system receives a computer program from a server. The computer program can initiate display of views. The system selects one or more views according to a hierarchy of parent-child relationships among the views. For each selected view, a controller associated with rendering of the view is identified. One or more timing thunks configured to collect timing events are installed into the controllers. One or more records are created from the timing events, and at least a subset of the records are reported to the server.

Hierarchical performance instrumentation injection

A secret is securely maintained on a virtualized computer system by configuring a specialized virtual machine to manage and maintain the secret on behalf of an application. When the application requests access to the secret, a controlling domain, in combination with the specialized virtual machine, validates that the application is authorized to make the request and that the application has not been compromised prior to making the request. If the request is validated, the controlling domain and the specialized virtual machine fulfill the request by providing the application with access to the secret.

Hypervisor supported secrets compartment

As requests are received, virtual computer systems are provisioned to process the requests. The virtual computer systems may be configured without various components typically implemented by virtual computer systems, such as traditional operating systems, network interfaces and the like. Application images for the virtual computer systems are configured so that execution of the applications can begin soon after provisioning, with minimal overhead the provisioning process contributing relatively little to any latency in processing the request.

Per request computer system instances

Growing community of inventors

Seattle, WA, United States of America

Nicholas Alexander Allen