Saurabh K Sinha

US Patent:

7058941, Jun 6, 2006

Filed:

Nov 14, 2000

Appl. No.:

09/713633

Inventors:

Ramarathnam Venkatesan - Redmond WA, US
Saurabh Sinha - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44
G06F 7/00

US Classification:

717168, 717144, 717157, 707 6

Abstract:

Implementations of this invention provide a technology for generating a minimum delta between at least two program binaries. An implementation of this invention is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation of this invention produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.

US Patent:

7228426, Jun 5, 2007

Filed:

Apr 3, 2002

Appl. No.:

10/116263

Inventors:

Saurabh Sinha - Seattle WA, US
Mariusz H. Jakubowski - Bellevue WA, US
Ramarathnam Venkatesan - Redmond WA, US
Yuqun Chen - Bellevue WA, US
Matthew Cary - Seattle WA, US
Ruoming Pang - Shanghai, CN

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 9/00
G06F 11/00
G06F 12/14
G06F 12/16
G06F 15/18

US Classification:

713176, 726 23, 726 24

Abstract:

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—which are sets of computer-executable instructions—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.

US Patent:

7346780, Mar 18, 2008

Filed:

Apr 3, 2002

Appl. No.:

10/116440

Inventors:

Saurabh Sinha - Seattle WA, US
Mariusz H. Jakubowski - Bellevue WA, US
Ramarathnam Venkatesan - Redmond WA, US
Yuqun Chen - Bellevue WA, US
Matthew Cary - Seattle WA, US
Ruoming Pang - Shanghai, CN

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/30
G06F 12/14

US Classification:

713187, 713176, 713194, 726 24

Abstract:

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.

US Patent:

7610623, Oct 27, 2009

Filed:

Dec 6, 2005

Appl. No.:

11/275060

Inventors:

Saurabh Sinha - Seattle WA, US
Mariusz H. Jakubowski - Bellevue WA, US
Ramarathnam Venkatesan - Redmond WA, US
Yuqun Chen - Bellevue WA, US
Matthew Cary - Seattle WA, US
Ruoming Pang - Shanghai, CN

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 12/14
H04L 1/00
G08B 23/00

US Classification:

726 23, 713176, 717135

Abstract:

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—which are sets of computer-executable instructions—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.

US Patent:

7644440, Jan 5, 2010

Filed:

Dec 6, 2005

Appl. No.:

11/275061

Inventors:

Saurabh Sinha - Seattle WA, US
Mariusz H. Jakubowski - Bellevue WA, US
Ramarathnam Venkatesan - Redmond WA, US
Yuqun Chen - Bellevue WA, US
Matthew Cary - Seattle WA, US
Ruoming Pang - Shanghai, CN

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 12/14
H04L 1/00
G08B 23/00

US Classification:

726 23, 713176, 717135

Abstract:

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—which are sets of computer-executable instructions—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.

US Patent:

7681190, Mar 16, 2010

Filed:

Mar 15, 2006

Appl. No.:

11/276814

Inventors:

Ramarathnam Venkatesan - Redmond WA, US
Saurabh Sinha - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717168, 717132, 717144, 717156

Abstract:

Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.

US Patent:

7685590, Mar 23, 2010

Filed:

Mar 15, 2006

Appl. No.:

11/276815

Inventors:

Ramarathnam Venkatesan - Redmond WA, US
Saurabh Sinha - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/44

US Classification:

717168, 717132, 717144, 717156

Abstract:

Implementations provide a technology for generating a minimum delta between at least two program binaries. An implementation is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.

US Patent:

7263531, Aug 28, 2007

Filed:

Jun 7, 2004

Appl. No.:

10/862554

Inventors:

Ramarathnam Venkatesan - Redmond WA, US
Saurabh Sinha - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707102

Abstract:

Implementations of this invention provide a technology for generating a minimum delta between at least two program binaries. An implementation of this invention is given a source program (S) in a binary format and a target program (T) in a binary form. It constructs control flow graphs (CFGs) of each. It matches common blocks of the S's CFGs and T's CFGs. The blocks are matched based upon their content and their local neighborhoods. In addition, the register renaming problems is solved so that blocks can be fairly compared. This implementation of this invention produces an intermediate output, which is the content of unmatched blocks. It generates a set of edge edit operations for merging the unmatched blocks into S. The combination of the unmatched blocks and the edit operations is the delta. To patch S to produce a reconstructed copy of T, the delta is merged with S.