The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 30, 2016

Filed:

Nov. 12, 2012
Applicant:

Telefonaktiebolaget L M Ericsson (Publ), Stockholm, SE;

Inventors:

Vincent Huang, Sollentuna, SE;

Yi Cheng, Sundbyberg, SE;

András Méhes, Sundbyberg, SE;

Mats Näslund, Bromma, SE;

Assignee:
Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 21/00 (2013.01); H04L 29/06 (2006.01); G06F 21/64 (2013.01); H04L 9/32 (2006.01);
U.S. Cl.
CPC ...
H04L 63/126 (2013.01); G06F 21/64 (2013.01); H04L 9/3236 (2013.01); H04L 63/08 (2013.01); H04L 63/123 (2013.01); H04L 2209/38 (2013.01);
Abstract

A first data handling node () is configured to verify data received in a data distribution network with multiple data handling nodes forming a distribution path of a network topology, by obtaining tag information from a hash server (). The first data handling node () receives data (D) and a hash tag (H) from a second data handling node (). The received data (D) and hash tag (H) have been generated by the second node based on a previous hash tag (H, H) generated by a preceding third data handling node (). The third node has delivered data (D, D) to the second node, and the received data (D) has been generated by the second node based on the data (D, D) delivered by the third data handling node. The first data handling node () verifies the received data (D) based on the tag information from the hash server, which indicates whether the received hash tag (H) corresponds to a 'valid hash tag' (Hx) which is calculated by applying a predefined hash algorithm on the previous hash tag (H, H). When the received tag corresponds to the valid tag, the data is verified as trustworthy and not faked or manipulated.


Find Patent Forward Citations

Loading…