| Patent application number | Description | Published |
|---|
| 20090247567 | BENZOPYRAN AND BENZOXEPIN PI3K INHIBITOR COMPOUNDS AND METHODS OF USE - Benzopyran and benzoxepin compounds of Formulas I and II, and including stereoisomers, geometric isomers, tautomers, solvates, metabolites and pharmaceutically acceptable salts thereof, are useful for inhibiting lipid kinases including p110 alpha and other isoforms of PI3K, and for treating disorders such as cancer mediated by lipid kinases. Methods of using compounds of Formulas I and II for in vitro, in situ, and in vivo diagnosis, prevention or treatment of such disorders in mammalian cells, or associated pathological conditions, are disclosed. | 10-01-2009 |
| 20110076291 | BENZOXEPIN PI3K INHIBITOR COMPOUNDS AND METHODS OF USE - Benzoxepin compounds of Formula I, and including stereoisomers, geometric isomers, tautomers, solvates, metabolites and pharmaceutically acceptable salts thereof, wherein: Z | 03-31-2011 |
| 20110076292 | BENZOXAZEPIN PI3K INHIBITOR COMPOUNDS AND METHODS OF USE - Benzoxazepin compounds of Formula I, including stereoisomers, geometric isomers, tautomers, solvates, metabolites and pharmaceutically acceptable salts thereof, wherein: Z | 03-31-2011 |
| 20110130363 | BENZOPYRAN AND BENZOXEPIN PI3K INHIBITOR COMPOUNDS AND METHODS OF USE - Benzopyran and benzoxepin compounds of Formulas I and II, and including stereoisomers, geometric isomers, tautomers, solvates, metabolites and pharmaceutically acceptable salts thereof, are useful for inhibiting lipid kinases including p110 alpha and other isoforms of PI3K, and for treating disorders such as cancer mediated by lipid kinases. Methods of using compounds of Formulas I and II for in vitro, in situ, and in vivo diagnosis, prevention or treatment of such disorders in mammalian cells, or associated pathological conditions, are disclosed. | 06-02-2011 |
| Patent application number | Description | Published |
|---|
| 20100306543 | Method of efficient secure function evaluation using resettable tamper-resistant hardware tokens - An embodiment of the present invention provides a computer implemented method for the transfer of private information of one user to another user—a primitive known as Oblivious Transfer. An output from a strong pseudorandom function generation (SPRFG) is calculated by a first user's computing module based on first and second parameters: the first parameter specifying one of two secret keys; the second parameter being a value selected within the domain of the SPRFG by the first user. The first user is prevented from reading or learning the stored two secret keys. The output is transmitted to a computer of a second user which generates first and second encrypted values that are each based on an inverse SPRFG calculation using the first and second secret keys, respectively, and corresponding private values of the second user. The encrypted values are sent to a first computer of the first user that calculates one of the private values using a mathematical computation based on the second parameter and the one of the first and second encrypted values that corresponds to the one of the first and second key used. | 12-02-2010 |
| 20110010549 | Efficient key management system and method - A system for providing cost effective, secure key exchange from at least one first device to at least one second device through at least one proxy server is provided. The system includes a first key exchange message from the at least one first device to the at least one second device via the at least one proxy server. A second key exchange message from the at least one second device to the at least one first device via a media stream of the Internet is required to complete the computation of the session key. A method of securing a communication system is also set forth. The method includes the steps of providing a routing device for identifying a subscriber, and providing a master key exchange session, the master key exchange session including a key k to find a subscriber and a nonce r to answer a query to the subscriber, wherein the master key exchange session includes both the key k and the nonce r. | 01-13-2011 |
| 20110138184 | Efficient Techniques for Achieving Security Against Cheating Tamper-Resistant Tokens - An improved secure transaction system for facilitating secure transactions between devices in a network is set forth. The system includes a first device. A secure agent, adapted for encrypting and delivering a message on behalf of the first device, is provided. The secure agent has a secret key drawn at random from a large domain embedded in the agent by the first device. A second device, adapted to obtain the message, based on a session ID, from the secure agent, is provided. The second device can selectively test the truth of a corresponding message from the agent, based on querying of the first device. The testing is unknown and unpredictable to the secure agent during the transaction. In this manner, the first device and agent are kept separate to deter cheating. | 06-09-2011 |
| Patent application number | Description | Published |
|---|
| 20090140767 | Universal circuit for secure function evaluation - An exemplary method enables implementation of a universal circuit capable of emulating each gate of a circuit designed to calculate a function. A first selection module receives inputs associated with the function. It generates outputs that are an ordered series of the inputs. A universal module receives these outputs and generates another set of outputs. A second selection module receives the outputs from the universal module and generates final function outputs that are an ordered series inputs received from the universal module. The selection modules and universal module themselves are also aspects of the present invention. | 06-04-2009 |
| 20090175443 | Secure function evaluation techniques for circuits containing XOR gates with applications to universal circuits - An embodiment of the present invention provides a method that minimizes the number of entries required in a garbled circuit associated with secure function evaluation of a given circuit. Exclusive OR (XOR) gates are evaluated in accordance with an embodiment of the present invention without the need of associated entries in the garbled table to yield minimal computational and communication effort. This improves the performance of SFE evaluation. Another embodiment of the present invention provides a method that replaces regular gates with more efficient constructions containing XOR gates in an implementation of a Universal Circuit, and circuits for integer addition and multiplication, thereby maximizing the performance improvement provided by the above. | 07-09-2009 |
| 20090287929 | METHOD AND APPARATUS FOR TWO-FACTOR KEY EXCHANGE PROTOCOL RESILIENT TO PASSWORD MISTYPING - A system and method for two factor key exchange protocol resilient to password mistyping is disclosed. This authentication process is based on two factors including both electronically stored (long keys) and human supplied credentials (password or biometrics). The disclosed system and method ensures security in the presence of mistyping. The system includes receiving a message from a client signifying a request to establish a secure connection and sending a first random number to the client. The method continues with receiving a string and authorization code with parameters comprising the first random number and the string where the string includes an identifier, a short key and a second random number encrypted with a public key. The method continues with decrypting the string with a private key verifying the authentication code, verifying the short key and session key derivation by both server and client. | 11-19-2009 |
| 20100058070 | Message authentication code pre-computation with applications to secure memory - A method comprising the steps of creating a random permutation of data from a data input by executing at least one of a Pseudo-Random Permutation (PRP) and a Pseudo-Random Function (PRF), creating a first data block by combining the random permutation of data with a received second data block and executing an ε-differentially uniform function on the result of the combination, XORing the result of the ε-DU function evaluation with a secret key, and reducing the first data block to a first message authentication code. | 03-04-2010 |
