Telematics Authentication
US-2019108695-A1 · Apr 11, 2019 · US
US11362833B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11362833-B2 |
| Application number | US-201916588314-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 30, 2019 |
| Priority date | Sep 30, 2019 |
| Publication date | Jun 14, 2022 |
| Grant date | Jun 14, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
An approach is provided for embedding information into probe data. The approach involves retrieving a probe data set comprising a plurality of probe data points collected from a probe device. The approach also involves determining the information to embed, wherein the information is a bit string of a specified length. The approach further involves iteratively selecting at least one bit of the bit string to embed into at least one probe data point of the plurality of probe data points to generate an embedded probe data set until at least a predetermined portion of the bit string is embedded. The approach further involves providing the embedded probe data set as an output.
Opening claim text (preview).
What is claimed is: 1. A method for embedding information into probe data comprising: retrieving a probe data set comprising a plurality of probe data points collected from a probe device; determining the information to embed, wherein the information is a bit string of a specified length; iteratively selecting, based on a repeating grid, at least one bit of the bit string to embed into at least one probe data point of the plurality of probe data points to generate an embedded probe data set until at least a predetermined portion of the bit string is embedded; and providing the embedded probe data set as an output. 2. The method of claim 1 , wherein the information is a watermark. 3. The method of claim 1 , wherein the generating of the embedded probe data set comprises: quantizing latitude data and longitude data of the at least one probe data point into the repeating grid, wherein a grid cell index of the at least one probe data point in the repeating grid; and modulating the at least one bit into speed data of the at least one probe data point. 4. The method of claim 3 , further comprising: selecting a least significant bit of the speed data, wherein the at least one bit is modulated into the least significant bit. 5. The method of claim 3 , wherein the modulating of the at least one bit into the speed data comprises: setting a speed value of the speed data to an even integer or an odd integer based on a bit value of the at least one bit. 6. The method of claim 1 , wherein the repeating grid has a grid size based on the specified length of the bit string and a cell edge size based on a specified unit measurement. 7. The method of claim 1 , further comprising: initiating an encryption of the information prior to embedding. 8. The method of claim 7 , wherein the encryption uses a key based on a hash computed from an identity of the probe device, a random number, or a combination thereof. 9. The method of claim 8 , wherein the key is used to prove an ownership of the probe data set. 10. The method of claim 1 , further comprising: generating another bit string based on the bit string by applying an error-correction block codec, wherein the another bit string is embedded into the probe data set in place of the bit string to generate the embedded probe data set. 11. An apparatus for extracting information from probe data comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, receive a probe data set embedded with the information, wherein the probe data set comprises a plurality of probe data points collected from a probe device, and the information is a bit string of a specified length; iteratively extract, based on a repeating grid, at least one bit of the bit string from at least one probe data point of the plurality of probe data points of the probe data set until at least a predetermined portion of the bit string is extracted; and identify an ownership of the probe data set based on the bit string. 12. The apparatus of claim 11 , wherein the apparatus extracts the at least one bit of the bit string by: quantizing latitude data and longitude data of the at least one probe data point into a grid cell index of the repeating grid; using the grid cell index to select a position in the bit string for the at least one bit; de-modulating speed data of the at least one probe data point into a bit value of the at least one bit; and reconstructing the bit string by setting the bit value of the at least one bit in the position in the bit string. 13. The apparatus of claim 12 , wherein the apparatus is further caused to: select a least significant bit of the speed data for the de-modulating. 14. The apparatus of claim 12 , wherein the apparatus de-modulates the speed data into the at least one bit by: converting an even integer or an odd integer of a speed value of the speed data as the bit value of the at least one bit. 15. The apparatus of claim 11 , wherein the apparatus is further caused to: initiate a decryption of the bit string. 16. The apparatus of claim 15 , wherein the decryption uses a key and a hash computed from an identity of the probe device, a random number, or a combination thereof. 17. The apparatus of claim 11 , wherein the apparatus is further caused to: generate another bit string based on the bit string by removing an error-correction block codec, wherein the another bit string is applied with the error-correction block codec and then embedded into the probe data set. 18. A non-transitory computer-readable storage medium for embedding information, carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform: retrieving a data stream comprising a plurality of data points; determining the information to embed, wherein the information is a bit string of a specified length; iteratively selecting, based on a repeating grid, at least one bit of the bit string to embed into at least one data point of the plurality of data points to generate an embedded data stream until at least a predetermined portion of the bit string is embedded; and providing the embedded data stream as an output. 19. The non-transitory computer-readable storage medium of claim 18 , wherein the data stream is collected from a probe device, and the embedded data stream is generated by: quantizing at least two attributes of the at least one data point into the repeating grid, wherein a grid cell index of the at least one probe data point in the repeating grid; and modulating the at least one bit into a third attribute of the at least one data point, wherein the attributes include at least three of latitude, longitude, speed, timestamp, and direction. 20. The non-transitory computer-readable storage medium of claim 19 , wherein the apparatus is further caused to perform: selecting a least significant bit of the third attribute, wherein the at least one bit is modulated into the least significant bit.
involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC · CPC title
Wireless · CPC title
Random or pseudo-random number generators · CPC title
Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title
Significance control · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.