Data processing method based on blockchain network and related product
US-2024419537-A1 · Dec 19, 2024 · US
US9027147B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9027147-B2 |
| Application number | US-201313893097-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 13, 2013 |
| Priority date | May 13, 2013 |
| Publication date | May 5, 2015 |
| Grant date | May 5, 2015 |
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 example apparatus may include a processor and a memory device including computer program code. The memory device and the computer program code may, with the processor, cause the apparatus to provide modified serialization codes for a first entity in a serialization flow to replace existing serialization codes for the first entity. In various examples, the modified serialization codes may have a representation of at least two different characters, and a number of instances of one of the characters in the representation of the modified serialization codes may be different from a number of instances of the one of the characters in the representation of the existing serialization codes. The memory device and the computer program code may further cause the apparatus to receive serialization codes from a second entity, the second entity being downstream in the serialization flow from the first entity; compare serialization codes from the second entity with the modified serialization codes; and verify the serialization codes from the second entity by determining if the serialization codes from the second entity are compatible with the modified serialization codes.
Opening claim text (preview).
What is claimed is: 1. An apparatus, comprising: a processor; and a memory device including computer program code, the memory device and the computer program code, with the processor, for causing the apparatus to perform at least the following: provide modified serialization codes for a first entity in a serialization flow to replace existing serialization codes for the first entity in response to an indication that the existing serialization codes have been compromised to an untrusted entity, wherein the modified serialization codes have a representation of at least two different characters, and wherein a number of instances of one of the characters in the representation of the modified serialization codes is different from a number of instances of the one of the characters in the representation of the existing serialization codes; receive serialization codes from a second entity, the second entity being downstream in the serialization flow from the first entity; compare serialization codes from the second entity with the modified serialization codes; and verify the serialization codes from the second entity by determining if the serialization codes from the second entity are compatible with the modified serialization codes. 2. The apparatus of claim 1 , wherein the modified serialization codes are represented as binary strings of 0's and 1's. 3. The apparatus of claim 2 , wherein the number of instances of 1 in the representation of the modified serialization codes is greater than the number of instances of 1 in the representation of the existing serialization codes. 4. The apparatus of claim 1 , wherein the serialization codes from the second entity are compatible with the modified serialization codes when the serialization codes for the second entity could be achieved from the modified serialization codes. 5. The apparatus of claim 1 , wherein the serialization codes received from the second entity are serialization codes received by the second entity from another entity in the serialization flow. 6. The apparatus of claim 5 , wherein the another entity is the first entity. 7. A computer program product, embodied on a non-transitory computer-readable medium, comprising: computer code for providing modified serialization codes for a first entity in a serialization flow to replace existing serialization codes for the first entity in response to an indication that the existing serialization codes have been compromised to an untrusted entity, wherein the modified serialization codes have a representation of at least two different characters, and wherein a number of instances of one of the characters in the representation of the modified serialization codes is different from a number of instances of the one of the characters in the representation of the existing serialization codes; computer code for comparing serialization codes from a second entity with the modified serialization codes, the second entity being downstream in the serialization flow from the first entity; and computer code for verifying the serialization codes from the second entity by determining if the serialization codes from the second entity are compatible with the modified serialization codes. 8. The computer program product of claim 7 , wherein the modified serialization codes are represented as binary strings of 0's and 1's. 9. The computer program product of claim 8 , wherein the number of instances of 1 in the representation of the modified serialization codes is greater than the number of instances of 1 in the representation of the existing serialization codes. 10. The computer program product of claim 7 , wherein the serialization codes from the second entity are compatible with the modified serialization codes when the serialization codes from the second entity could be achieved from the modified serialization codes.
Related publications grouped by family.
Answers are generated from the same data shown on this page.