Patents by Inventor Adam M. O'Neill

Adam M. O'Neill 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).

  • Reducing leakage of information from cryptographic systems
    Patent number: 8527766
    Abstract: A system is described for reducing leakage of meaningful information from cryptographic operations. The system uses a pairwise independent hash function to generate a modified secret key SK? having individual components. The system forms a modified secret key collection that includes SK? and its individual components. The system then uses the modified secret key collection to decrypt a message. The decryption involves providing multiple partial operation results in separate respective steps. Leakage of meaningful information is reduced due to difficulty in piecing together meaningful information from information leaked by the separate partial operations. In one example, the hash function has the form HK(r)=ar+b, where a, b, and r are selected values, such as random numbers. In another example, the hash function has the form HK(r)=Ar*B, where A, B, and r are selected values.
    Type: Grant
    Filed: December 30, 2009
    Date of Patent: September 3, 2013
    Assignee: Microsoft Corporation
    Inventors: Melissa E. Chase, Adam M. O'Neill
  • Reducing Leakage of Information from Cryptographic Systems
    Publication number: 20110161670
    Abstract: A system is described for reducing leakage of meaningful information from cryptographic operations. The system uses a pairwise independent hash function to generate a modified secret key SK? having individual components. The system forms a modified secret key collection that includes SK? and its individual components. The system then uses the modified secret key collection to decrypt a message. The decryption involves providing multiple partial operation results in separate respective steps. Leakage of meaningful information is reduced due to difficulty in piecing together meaningful information from information leaked by the separate partial operations. In one example, the hash function has the form HK(r)=ar+b, where a, b, and r are selected values, such as random numbers. In another example, the hash function has the form HK(r)=Ar*B, where A, B, and r are selected values.
    Type: Application
    Filed: December 30, 2009
    Publication date: June 30, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Melissa E. Chase, Adam M. O'Neill