Patents by Inventor Christopher G. Kaler

Christopher G. Kaler has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Secure electronic transfer without requiring knowledge of secret data
    Patent number: 7657745
    Abstract: A secure electronic transfer mechanism that does not require that the computing entities that are parties to the transaction be aware of the secret data used to secure the transfer. A transferring computing entity provides a request from a billing agent computing entity to transfer the electronically transferable item to a computing entity. The billing agent computing entity responds to the request by providing approval data to the second computing entity, the approval data being encrypted using secret data known to the billing agent computing entity and a supplemental computing entity associated with the transferee computing entity, but not to the transferring and transferee computing entity. The approval is provided to the supplemental computing entity, which then credits the transferee account.
    Type: Grant
    Filed: November 15, 2004
    Date of Patent: February 2, 2010
    Assignee: Microsoft Corporation
    Inventors: Max G. Morris, Christopher G. Kaler
  • REPRESENTING SECURITY IDENTITIES USING CLAIMS
    Publication number: 20100001833
    Abstract: The claims based identity model provides a model which associates security identities with claims. The model represents information contained in the claims, as well as, captures relationships between the security identities described in the claims. Finally, the data model can be easily translated to the existing .NET environment without breaking the backward compatibility for existing .NET applications.
    Type: Application
    Filed: June 16, 2009
    Publication date: January 7, 2010
    Applicant: Microsoft Corporation
    Inventors: Jan Alexander, Christopher G. Kaler, Charles R. Reeves, Hervey O. Wilson
  • Valid transformation expressions for structured data
    Patent number: 7640260
    Abstract: Structuring a data structure that is of a particular type that has a particular schema used for validation, in a manner that permits selected components of the data structure to be optionally transformed while retaining the ability to validate the data structure. The data structure includes information that is sufficient to identify one or more transformations that may occur on at least one component of the data structure while still being valid.
    Type: Grant
    Filed: December 12, 2005
    Date of Patent: December 29, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Donald F. Box, Martin Gudgin
  • Optimizing communication using scaleable peer groups
    Patent number: 7640299
    Abstract: Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.
    Type: Grant
    Filed: January 4, 2006
    Date of Patent: December 29, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Gopala Krishna R. Kakivaya, Hervey Oliver Wilson, Richard L. Hasha
  • Endpoint identification and security
    Patent number: 7636939
    Abstract: A data structure with endpoint address and security information. The data structure includes an address field that includes one or more endpoint addresses for an entity. The data structure further includes a security field that includes one or more keys for facilitating secure communications with the entity. The data structure may also be such that the contents of the address field and the security field are serialized in the data structure. The data structure may be extensible such that new address fields and security fields may be added.
    Type: Grant
    Filed: December 10, 2004
    Date of Patent: December 22, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Douglas A. Walter, Giovanni M. Della-Libera, Melissa W. Dunn, Richard L. Hasha, Tomasz Janczuk
  • Extensible architecture for project development systems
    Patent number: 7631298
    Abstract: A software-development system or versioning system has a collection of modules for performing individual development functions such as document editing, keyword processing, and private-copy management. Each module has an interface compatible with that of the others, so that modules can be added to or substituted for the original modules, if the new modules conform to the interface. The architecture of this system supports the performance of development actions such as document merging and keyword expansion at any location within the system. The system operates upon documents and files as objects in an object space, rather than in name spaces.
    Type: Grant
    Filed: June 30, 2005
    Date of Patent: December 8, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Martyn S. Lovell, Michael J. Grier, Bradley J. Bartz
  • Hidden proactive replication of data
    Patent number: 7631359
    Abstract: Moving replicas in a cryptographically secure manner such that the target location and timing of the movements are completely hidden from any user, or is kept as a secret by a limited number of users who have been given advanced notice of the new location and relocation time for a replica. A catalog of replica locations that describe the current location of the replicas is stored in encrypted form so as to prevent individuals from determining the exact location of the replicas. Since the location of the replicas is hidden at any given moment, attackers may not use the location of the replicas in order to attack all of the replicas at the same time. Accordingly, recovery mechanisms may have an opportunity to recover from any given attack by once again creating replicas from those replicas that had not been attacked.
    Type: Grant
    Filed: November 6, 2002
    Date of Patent: December 8, 2009
    Assignee: Microsoft Corporation
    Inventors: Luis Felipe Cabrera, Marvin M. Theimer, Christopher G. Kaler
  • End-to-end reliable messaging with complete acknowledgement
    Patent number: 7627759
    Abstract: Reliable end-to-end messaging in which tracking and acknowledgement information are contained in the electronic message that is visible to layers above the transport layer, thereby being independent of what transport protocols, and whether different transport protocols, are used to communicate between the two end points. Furthermore, acknowledgment messages may identify multiple ranges of sequence numbers corresponding to received electronic messages, thereby permitting further flexibility and completeness in acknowledging received messages.
    Type: Grant
    Filed: October 10, 2006
    Date of Patent: December 1, 2009
    Assignee: Microsoft Corporation
    Inventors: David E. Langworthy, Christopher G. Kaler, Luis Felipe Cabrera, Patrick J. Helland, Steven E. Lucco, John P. Shewchuk
  • Grouping and nesting hierarchical namespaces
    Patent number: 7613997
    Abstract: A group identifier represents an association between each of a number of different abbreviated namespace identifiers with a corresponding hierarchical namespace (e.g., an XML namespace). A hierarchically-structured document (e.g., an XML document) is accessed by a computing system that determines that the group identifier is associated with the hierarchically-structured document. Hence, when using the abbreviated namespace identifiers in the hierarchically-structured document, the computing system knows that the corresponding namespace is associated with the designated portions of the hierarchically-structured document. Also, a schema description language document (e.g., an XSD document) may specify multiple target namespaces for a single element. Accordingly, groupings of elements may be included in different namespaces to creating overlapping or even nested namespaces.
    Type: Grant
    Filed: October 27, 2005
    Date of Patent: November 3, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Allen L. Brown, Robert G. Atkinson, Steven E. Lucco
  • Searching with adaptively configurable user interface and extensible query language
    Patent number: 7610290
    Abstract: An adaptively configurable user interface to facilitate a common user experience across two or more databases and an extensible common query structure to allow expansion of a query language to meet the demands of new file types. An exemplary embodiment includes a discovery mechanism for determining query properties of search providers, thereby facilitating adaptive configuring of a user interface to expose the determined query properties. An exemplary embodiment of the user interface includes a portion which remains relatively constant across two or more search providers to reduce user disorientation.
    Type: Grant
    Filed: August 1, 2005
    Date of Patent: October 27, 2009
    Assignee: Microsoft Corporation
    Inventors: Steven J. Kruy, Christopher G. Kaler, Kenneth D. Hardy, Jomo Ahab Fisher
  • Extensible architecture for versioning APIs
    Patent number: 7610316
    Abstract: Some large software development projects need more than one versioning system to accommodate not only a diversity of document formats and data types, but also the geographic diversity of its programmers. However, having more than one versioning system is generally very expensive. A major factor in this expense is the requirement for a separate application program interface (API) for each separate versioning system. Accordingly, the inventors devised an exemplary API architecture that can be extended with “plug-in”protocol providers to include virtually any number of separate version stores or versioning systems. The exemplary architecture includes a generic command parser and a command dispatcher. The command dispatcher operatively couples to one or more protocol providers, each coupled to at least one version store.
    Type: Grant
    Filed: September 7, 2004
    Date of Patent: October 27, 2009
    Assignee: Microsoft Corporation
    Inventors: Bradley J. Bartz, Michael R. Santoro, Christopher G. Kaler, Zachary L. Anderson, Christopher D. Reeves
  • LOW-COST SECURITY USING WELL-DEFINED MESSAGES
    Publication number: 20090217383
    Abstract: Well-defined messages may be transmitted from a sending device to a recipient device in order to reduce the processing and resource requirements imposed by the security semantics of general message standards. The well-defined messages may include an expression of a collective intent of the security semantics included in the message. The expression of the security semantics within the message simplifies the discovery process for devices processing the message. The well-defined message may also require that any intermediary devices that process the well-defined message as it is transmitted from the sender device to the receiver device follow the expressed collective intent of the security semantics. If an intermediary device cannot understand or adhere to the expressed intent, the well-defined message must be rejected.
    Type: Application
    Filed: February 26, 2008
    Publication date: August 27, 2009
    Applicant: Microsoft Corporation
    Inventors: Douglas A. Walter, Christopher G. Kaler, John P. Shewchuk, Arun K. Nanda
  • MESSAGE ENCODING/DECODING USING TEMPLATED PARAMETERS
    Publication number: 20090198761
    Abstract: Communication of a compressed message over a communication channel between message processors. The compressed message may be expressed in terms of an expressed or implicit template identification, and values of one or more parameters. Based on the template identification, the meaning of the one or more parameters may be understood, whereas the meaning of the parameter(s) may not be understood without a knowledge of the template. The template provides semantic context for the one or more parameters. The transmitting message processor may have compressed the message using the identified template. Alternatively or in addition, the receiving message processor may decompress the message using the identified template. The template itself need not be part of the compressed message as transmitted.
    Type: Application
    Filed: January 31, 2008
    Publication date: August 6, 2009
    Applicant: Microsoft Corporation
    Inventors: Arun K. Nanda, John P. Shewchuk, Christopher G. Kaler, Hervey O. Wilson
  • Above-transport layer message partial compression
    Patent number: 7567586
    Abstract: Compression of a portion of a message at above a transport layer in a protocol stack. In the transmission direction, the message is accessed in a form that includes a number of initially parseable components, at least one of which being in compressed form. The message also includes a marker that identifies the component(s) that are compressed. The message is then passed to the transport layer in further preparation for transmission. In the receiving direction, the message is received from the transport layer. The message is initially parsed, and then the compressed component(s) are identified based on the marker.
    Type: Grant
    Filed: October 31, 2005
    Date of Patent: July 28, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, Steven E. Lucco
  • Peer tunnels and peer group targets
    Patent number: 7562151
    Abstract: Transferring data using peer-to-peer protocols. A method may be practiced, for example, at a computer system in a computer network. The computer network may include one or more networked agents formed into a peer group of peers using at least one peer-to-peer connection. The method includes an act of receiving a computer readable message from a peer-to-peer network. The computer readable message is a centric message enveloped in a peer-to-peer message. The centric message is extracted. The centric message is delivered to an agent configured for centric type communications.
    Type: Grant
    Filed: November 30, 2005
    Date of Patent: July 14, 2009
    Assignee: Microsoft Corporation
    Inventor: Christopher G. Kaler
  • Automatically generating security policies for web services
    Patent number: 7559080
    Abstract: Systems and methods for automatically generating security policy for a web service are described. In one aspect, one or more links between one or more endpoints are described with an abstract link description. The abstract link description describes, for each link of the one or more links, one or more security goals associated with exchange of message(s) between the one or more endpoints associated with the link. The one or more endpoints host respective principals networked in a distributed operating environment. Detailed security policies for enforcement during exchange of messages between the one or more endpoints are automatically generated from the abstract link description.
    Type: Grant
    Filed: December 29, 2004
    Date of Patent: July 7, 2009
    Assignee: Microsoft Corporation
    Inventors: Karthikeyan Bhargavan, Cedric Fournet, Andrew Donald Gordon, Christopher G. Kaler
  • GENERIC INTERACTIVE CHALLENGES IN A DISTRIBUTED SYSTEM
    Publication number: 20090113534
    Abstract: A challenge mechanism in which a challenge is issued from one message processor to another. In generating the challenge, the message processor may select any one or more of a number of available interactive challenge types, where each type of challenge type might use different user-originated information. Upon receiving the challenge, the challengee message processor may identify the challenge type based on information provided in the challenge, and perform different actions depending on the challenge type. The challengee message processor then generates an appropriate challenge response, and issues that challenge response to the challenger message processor. The challenger message processor may then validate the challenge response.
    Type: Application
    Filed: October 26, 2007
    Publication date: April 30, 2009
    Applicant: Microsoft Corporation
    Inventors: Arun K. Nanda, Christopher G. Kaler, Tariq Sharif
  • Challenge-based authentication without requiring knowledge of secret authentication data
    Patent number: 7519815
    Abstract: A challenge based authentication mechanism that does not require that the authenticating computing entities be aware of the secret data used for the initial authentication. An authenticator computing entity is to authenticate to the authenticatee computing entity. First, the authenticatee computing entity acquires a challenge from a supplemental authenticatee computing entity. The authenticatee computing entity provides the challenge to the authenticator computing entity, which has a supplemental authenticator computing entity solve the challenge. The authenticator computing entity sends the answer to the authenticatee computing entity, which uses the answer to authenticate the authenticator computing entity.
    Type: Grant
    Filed: August 13, 2004
    Date of Patent: April 14, 2009
    Assignee: Microsoft Corporation
    Inventors: Max G. Morris, Christopher G. Kaler
  • Interface infrastructure for creating and interacting with web services
    Patent number: 7512957
    Abstract: A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
    Type: Grant
    Filed: December 3, 2004
    Date of Patent: March 31, 2009
    Assignee: Microsoft Corporation
    Inventors: Shy Cohen, Geary L. Eppley, Douglas M. Purdy, James E. Johnson, Stephen J. Millet, Stephen T. Swartz, Vijay K. Gajjala, Aaron Abraham Stern, Alexander Martin DeJarnatt, Alfred M. Lee, IV, Anand Rjagopalan, Anastasios Kasiolas, Chaitanya D. Upadhyay, Christopher G. Kaler, Craig Andrew Critchley, David Edwin Levin, David Owen Driver, David Wortendyke, Douglas A. Walter, Elliot Lee Waingold, Erik Bo Christensen, Erin P. Honeycutt, Eugene Shvets, Evgeny Osovetsky, Giovanni M. Della-Libera, Jesus Ruiz-Scougall, John David Doty, Jonathan T. Wheeler, Kapil Gupta, Kenneth David Wolf, Krishnan Srinivasan, Lance E. Olson, Matthew Thomas Tavis, Mauro Ottaviani, Max Attar Feingold, Michael James Coulson, Michael Jon Marucheck, Michael Steven Vernal, Michael Thomas Dice, Mohamed-Hany Essam Ramadan, Mohammad Makarechian, Natasha Harish Jethanandani, Richard Dievendorff, Richard Douglas Hill, Ryan Thomas Sturgell, Saurab Nog, Scott Christopher Seely, Serge Sverdlov, Siddhartha Puri, Sowmyanarayanan K. Srinivasan, Stefan Batres, Stefan Harrington Pharies, Tirunelveli Vishwanath, Tomasz Janczuk, Uday S. Hegde, Umesh Madan, Vaithialingam B. Balayogan, Vipul Arunkant Modi, Yaniv Pessach, Yasser Shohoud
  • Method and system for using a web service license
    Patent number: 7512782
    Abstract: A method and system are provided such that a universal license may be used for authentication and authorization purposes and may include one or more cryptographic keys as well as assertions and related indications of authenticity. In an aspect of the invention, a license may be presented that includes access information, such that authentication and authorization decisions may be made based only on the access information. In other aspects of the invention, rights may be delegated and a trusted party may assert that another party can be trusted.
    Type: Grant
    Filed: August 15, 2002
    Date of Patent: March 31, 2009
    Assignee: Microsoft Corporation
    Inventors: Christopher G. Kaler, John P. Shewchuk, Giovanni Moises Della-Libera, Robert George Atkinson