Data processing: software development – installation – and managem – Software upgrading or updating – Plural version management
Reexamination Certificate
2006-10-17
2006-10-17
Chaki, Kakali (Department: 2193)
Data processing: software development, installation, and managem
Software upgrading or updating
Plural version management
C713S167000
Reexamination Certificate
active
07124408
ABSTRACT:
A system and method is provided for providing security to components or assemblies employed by application programs during runtime. Assemblies carry version information that can be used to enforce the versioning rules described by the application program. At runtime, version numbers requested by the application programs are compared with those version numbers of the assemblies that are actually found. In addition to comparing version numbers, the present invention offers a stricter form of version checking based on cryptographic hashes. An assembly is provided with module information that contains a list of the files that make up the assembly. Part of the information recorded about each module is a hash of the module's contents at the time the manifest was built. An assembly referencing another assembly computes the hash of the manifest of the referenced assembly. An assembly manifest may include dependency information, which is information about other assemblies that the assembly depends on or references. Part of the information stored as part of an assembly reference or manifest is a hash of the dependent assembly's manifest.
REFERENCES:
patent: 5390247 (1995-02-01), Fischer
patent: 5625693 (1997-04-01), Rohatgi et al.
patent: 5689565 (1997-11-01), Spies et al.
patent: 5692047 (1997-11-01), McManis
patent: 5748960 (1998-05-01), Fischer
patent: 5802368 (1998-09-01), Grigsby et al.
patent: 5805899 (1998-09-01), Evans et al.
patent: 5842214 (1998-11-01), Whitney et al.
patent: 5848274 (1998-12-01), Hamby et al.
patent: 5892904 (1999-04-01), Atkinson et al.
patent: 5958051 (1999-09-01), Renaud et al.
patent: 5974421 (1999-10-01), Krishnaswamy et al.
patent: 5978484 (1999-11-01), Apperson et al.
patent: 5991399 (1999-11-01), Graunke et al.
patent: 6021491 (2000-02-01), Renaud
patent: 6044467 (2000-03-01), Gong
patent: 6149318 (2000-11-01), Chase et al.
patent: 6182279 (2001-01-01), Buxton
patent: 6212673 (2001-04-01), House et al.
patent: 6230184 (2001-05-01), White et al.
patent: 6263379 (2001-07-01), Atkinson et al.
patent: 6308320 (2001-10-01), Burch
patent: 6324637 (2001-11-01), Hamilton
patent: 6374266 (2002-04-01), Shnelvar
patent: 6445973 (2002-09-01), Sagasaki et al.
patent: 6463535 (2002-10-01), Drews
patent: 6480880 (2002-11-01), White et al.
patent: 6510516 (2003-01-01), Benson et al.
patent: 6748538 (2004-06-01), Chan et al.
patent: 2002/0026634 (2002-02-01), Shaw
patent: 2002/0129094 (2002-09-01), Reisman
patent: 0 845 733 (1998-06-01), None
patent: WO 99/36854 (1999-07-01), None
International Search Report, PCT/US01/40632, Oct. 31, 2003.
Parthasarathy Srivatsan
Pratschner Steven J.
Sinclair Craig T.
Amin & Turocy LLP
Chaki Kakali
Microsoft Corporation
Vu Tuan Anh
LandOfFree
Binding by hash does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Binding by hash, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binding by hash will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3620011