Arun T Moorthy

US Patent:

7458072, Nov 25, 2008

Filed:

Oct 6, 2004

Appl. No.:

10/959812

Inventors:

Arun Moorthy - Seattle WA, US
Christopher W. Brumme - Mercer Island WA, US
Jonathan C. Hawkins - Seattle WA, US
Raja Krishnaswamy - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 9/44

US Classification:

717157, 717154, 717106, 719315, 719316

Abstract:

Described herein is an implementation for exposing an “execution context” to a logical execution flow of procedures as it executes. An “execution context” is a set of data and/or sub-procedures that might be useful at some point during a logical execution flow (to manage and control the execution flow and provide additional services to the execution flow) of computer-executable instructions though the often complex, intertwined, and interconnected conglomeration of procedures of software product(s).

US Patent:

7930687, Apr 19, 2011

Filed:

Nov 24, 2008

Appl. No.:

12/277180

Inventors:

Arun Moorthy - Seattle WA, US
Christopher W. Brumme - Mercer Island WA, US
Jonathan C. Hawkins - Seattle WA, US
Raja Krishnaswamy - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/45
G06F 9/44

US Classification:

717157, 717154, 717106

Abstract:

Described herein is an implementation for exposing an “execution context” to a logical execution flow of procedures as it executes. An “execution context” is a set of data and/or sub-procedures that might be useful at some point during a logical execution flow (to manage and control the execution flow and provide additional services to the execution flow) of computer-executable instructions though the often complex, intertwined, and interconnected conglomeration of procedures of software product(s).

US Patent:

8011008, Aug 30, 2011

Filed:

Nov 13, 2007

Appl. No.:

11/939383

Inventors:

Michael D. Downen - Sammamish WA, US
Raja Krishnaswamy - Redmond WA, US
Arun Moorthy - Newcastle WA, US
Charles W. Kaufman - Sammamish WA, US

Assignee:

Microsoft Corporation - Remond WA

International Classification:

G06F 17/30

US Classification:

726 21, 726 3, 726 4

Abstract:

Performing security sensitive operations with an application security model. Security agnostic code is executed. The security agnostic code is identified as not having authorization to perform a security sensitive operation. Executing the security agnostic code includes calling code identified as security safe critical code. In response to the security agnostic code calling the security safe critical code, the security safe critical code is executed. The security safe critical code includes functionality for performing validity checks. Executing the security safe critical code includes performing an validity check for the security agnostic code. When the security agnostic code passes the validity check, code identified as security critical code is called. In response to the security safe critical code calling the security critical code, the security critical code is executed. The security critical code is authorized to perform the security sensitive operation.

US Patent:

20030014625, Jan 16, 2003

Filed:

Jul 6, 2001

Appl. No.:

09/900493

Inventors:

Michael Freed - Pleasanton CA, US
Arun Moorthy - San Jose CA, US

International Classification:

H04L009/00

US Classification:

713/153000

Abstract:

A method for enabling secure communication between a client on an open network and a server apparatus on a secure network. The method is generally performed on a intermediary apparatus coupled to the secure network and the open network. The method includes the steps of negotiating a secure communications session with the client apparatus via the open network; negotiating an open communications session with the server via the secure network; receiving encrypted packet application data having a length greater than a packet length via multiple data packets; decrypting the encrypted packet application data in each data packet; forwarding decrypted, unauthenticated application data to the server via the secure network; and authenticating the decrypted packet data on receipt of a final packet of the segment.

US Patent:

20130159718, Jun 20, 2013

Filed:

Dec 19, 2011

Appl. No.:

13/330260

Inventors:

Shawn Farkas - Kirkland WA, US
Mueez Siddiqui - Mississauga, CA
Reid Martin Borsuk - Bellevue WA, US
Andrew Dai - Seattle WA, US
Arun Moorthy - Newcastle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 9/32

US Classification:

713176

Abstract:

The present invention extends to methods, systems, and computer program products for updating signature algorithms used for signing an assembly with a strong name without changing the identity of the assembly. The present invention enables an assembly that has already been given an identity (via strong name signing with an identity public/private key pair) to be resigned with a different public/private key pair without changing the original identity that was based on the identity public/private key pair. This is accomplished by including a counter signature within the assembly that links the original identity of the assembly to the new signature key pair.