COMMUNICATION METHOD FOR MULTISUBSCRIBER NETWORKS, WHICH IS PROTECTED FROM DECEPTION, EAVESDROPPING AND HACKING
First Claim
1. A method for unalterable, tap-proof and non-hackable P2P communication in multi-subscriber networks wherein part of data are relative data calculated with reference to a space or a plurality of spaces, to a reference point or a plurality of reference points, comprising:
- performing each P2P communication with reference to at least one global random reference data element valid for a randomly defined time interval, and to a separate random reference data element and/or random data element valid for one P2P communication,storing at least said global random reference data valid for randomly defined time intervals secretly and unalterably in each P2P communication performing transmitting/receiving unit,wherein only units involved in a P2P communication have knowledge about the separate random reference data and/or random data valid for said P2P communication,determining at least a part of the separate random reference data and/or random data valid for said P2P communication in at least one unit involved in said P2P communication, and exchanging said at least a part in form of relative data between the units involved in said P2P communication,determining at least one exchanged relative data element of at least one random reference data element, and/or random data element, and/or data element identifying a person, and/or data element identifying a unit, and/or P2P control data element with reference to said currently valid global random reference data element, anddetermining at least another exchanged relative data element or all of the other exchanged relative data with reference to said separate random reference data and/or random data valid for said P2P communication.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention relates to a P2P communication method for multi-subscriber networks, which is protected from deception, eavesdropping and hacking, and wherein the communication carried out in an interval is predominantly carried out in separate rooms, allocated to the P2P communication, and with separate reference data allocated to the P2P communication. At least part of the separate random reference data and/or random data is generated in at least one unit that participates in the P2P communication and is exchanged within the P2P communication in the form of relative data. The separate P2P communication is initiated with respect to at least one global random reference date valid for the time of the P2P communication, the random reference date being valid for a randomly determined time range and being stored in all units that carry out the P2P communications in a secret and non-deceivable manner.
-
Citations
11 Claims
-
1. A method for unalterable, tap-proof and non-hackable P2P communication in multi-subscriber networks wherein part of data are relative data calculated with reference to a space or a plurality of spaces, to a reference point or a plurality of reference points, comprising:
-
performing each P2P communication with reference to at least one global random reference data element valid for a randomly defined time interval, and to a separate random reference data element and/or random data element valid for one P2P communication, storing at least said global random reference data valid for randomly defined time intervals secretly and unalterably in each P2P communication performing transmitting/receiving unit, wherein only units involved in a P2P communication have knowledge about the separate random reference data and/or random data valid for said P2P communication, determining at least a part of the separate random reference data and/or random data valid for said P2P communication in at least one unit involved in said P2P communication, and exchanging said at least a part in form of relative data between the units involved in said P2P communication, determining at least one exchanged relative data element of at least one random reference data element, and/or random data element, and/or data element identifying a person, and/or data element identifying a unit, and/or P2P control data element with reference to said currently valid global random reference data element, and determining at least another exchanged relative data element or all of the other exchanged relative data with reference to said separate random reference data and/or random data valid for said P2P communication. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification