http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-1425874-A2
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_bc2b03342511abc88f60c63f2acd96d0 |
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L2209-04 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-0847 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-3073 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L9-30 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L9-08 |
| filingDate | 2002-08-13-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_bbf1ce6c285bf669ce1dd8ed4daac3a0 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_8cda85a4dc3b3f691f476be574d63ba4 |
| publicationDate | 2004-06-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | EP-1425874-A2 |
| titleOfInvention | Systems and methods for identity-based encryption and related cryptographic techniques |
| abstract | A method and system for encrypting a first piece of information M to be sent by a sender (100) to a receiver (110) allows both sender and receiver to compute a secret message key using identity-based information and a bilinear map. In a one embodiment, the sender (100) computes an identity-based encryption key from an identifier ID associated with the receiver (110). The identifier ID may include various types of information such as the receiver's e-mail address, a receiver credential, a message identifier, or a date. The sender uses a bilinear map and the encryption key to compute a secret message key grID, which is then used to encrypt a message M, producing ciphertext V to be sent from the sender (100) to the receiver (110) together with an element rP. An identity-based decryption key dID is computed by a private key generator (120) based on the ID associated with the receiver and a secret master key s. After obtaining the private decryption key from the key generator (120), the receiver (110) uses it together with the element rP and the bilinear map to compute the secret message key grID, which is then used to decrypt V and recover the original message M. According to one embodiment, the bilinear map is based on a Weil pairing or a Tate pairing defined on a subgroup of an elliptic curve. Also described are several applications of the techniques, including key revocation, credential management, and return receipt notification. |
| priorityDate | 2001-08-13-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 18.