WO2015197657A1 - Netzwerksystem mit ende-zu-ende verschlüsselung - Google Patents
Netzwerksystem mit ende-zu-ende verschlüsselung Download PDFInfo
- Publication number
- WO2015197657A1 WO2015197657A1 PCT/EP2015/064180 EP2015064180W WO2015197657A1 WO 2015197657 A1 WO2015197657 A1 WO 2015197657A1 EP 2015064180 W EP2015064180 W EP 2015064180W WO 2015197657 A1 WO2015197657 A1 WO 2015197657A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- endpoint
- network
- network system
- endpoints
- instance
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
- H04L63/0272—Virtual private networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/03—Protecting confidentiality, e.g. by encryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
- H04L2463/121—Timestamp
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
- H04L63/062—Network architectures or network communication protocols for network security for supporting key management in a packet data network for key distribution, e.g. centrally by trusted party
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/16—Implementing security features at a particular protocol layer
- H04L63/164—Implementing security features at a particular protocol layer at the network layer
Definitions
- end-to-end encryption is desired to prevent spying on data being sent from one communication partner to another communication partner.
- attack options include e.g. a replay in which data already entered is intercepted and repeated, or a so-called man-in-the-middle attack, in which proxy-like data of another user are displayed in order to arrive at desired information.
- a replay in which data already entered is intercepted and repeated
- a so-called man-in-the-middle attack in which proxy-like data of another user are displayed in order to arrive at desired information.
- WLAN WPA key which is entered by a user at the respective WLAN access point, eg during commissioning, and must then also be entered in each WLAN client connecting to the WLAN access point.
- public-key exchange technique there are also solutions based on the public-key exchange technique. In this case, a key pair is generated on one of the communication partners and transmitted to the other partner via a secure channel.
- the patent DE 10 2006 003 167 B3 is known from the prior art.
- keys are implemented on terminals and intermediate devices in order to allow a direct secure exchange between the individual devices.
- the presented system is disadvantageous since the keys are always used only on partial routes and thus a compromise of an intermediate node can disclose the entire traffic over this node.
- foreign methods for authentication from DE 10 2005 003 208 A1 and time-controlled key methods from DE 603 16 861 T2 are known.
- This network system has at least a first endpoint and a second endpoint and at least one central entity within the network.
- the first endpoints have access to the network system via one or more access nodes, with simultaneous access via more than one access node through endpoints.
- the central entity within the network undertakes the routing of data to the first endpoint to the second endpoint, with data of the first endpoint forwarded by both a first access node and a second access node to the central entity being recognized as a doublet by the central entity will be sent to the second endpoint only once.
- the network system is not tied to a particular access technology and can therefore be used with both wireline and wired networks.
- the object is achieved by an inventive network system with end-to-end encryption.
- the network system has at least a first endpoint and a second endpoint and at least a first central entity within the network.
- the first endpoints have access to the network system via one or more access nodes, with the first central entity within the network taking over the routing of data from the first endpoint to the second endpoint.
- the network has at least one second central entity within the network, which stores key data of each endpoint.
- asymmetric encryption based on a common time base is further provided, the common time base by a third party, preferably within the network.
- the time base is verified via a challenge handshake.
- temporarily valid keys are created by the second entity based on the respective key data of the first and second endpoints and available to the first and second endpoints posed.
- the temporary valid keys for the communication between the first endpoint and the second endpoint are provided based on a common time base, the common time base being provided by a third instance, preferably within the network ,
- FIG. 1 shows a schematic example of a network in which the invention can be used.
- a plurality of endpoints Ni, N 2 , N 3 , N 4 , N 5 , N 6 may be interconnected.
- FIG. 1 Only an exemplary number of end points are shown in FIG. 1 and the invention is in no way limited to this arrangement.
- At least one central entity ZI is provided in a network system according to the invention, the function of which will be explained in more detail below.
- the endpoints are mutually provided via access points Gi, G 2, G 3 with access to the network system.
- the individual endpoints can record with one or more access nodes Gi, G 2 , G 3 connection to the network system.
- the endpoint may obtain N 6 via both the access node and the access node Gi G 3 access to the network system in FIG. 3
- the endpoint N 3 can receive access to the network system via repeaters Ri and R 2 via the access node G 2 as well as the access node G 3 .
- the central entity ZI generally handles the routing of data from any of the endpoints (source endpoint) to any other destination (sink endpoint).
- a message to the second endpoint N 2 can be made so that the data is received via the access nodes Gi and G 3 and passed on to the central entity ZI.
- the central entity recognizes the destination of the data and forwards it via the access node G 2 to the second endpoint N 2 . It depends on the further design of the network, which is shown as a cloud Cl, for the further understanding of the invention not.
- end-to-end encryption can be achieved by providing a second central entity Zl s within the network, which stores key data of each endpoint.
- This second central instance Zl s need not necessarily be a physically separate from the first central entity ZI device but may also be integrated into this.
- first and second central instance is to be seen merely as a distinction of the functionalities.
- the invention makes use of the property that the network and the associated network protocol provide a central instance ZI, which can enable communication in principle of each endpoint with each other endpoint.
- central instance ZI represents a constantly available entity that already knows all possible endpoints "a priori”.
- the key architecture can be implemented particularly easily.
- the key for each endpoint can already set at the time of production of the respective endpoints and s are stored in the second central instance Zl. In this respect, no further activity of the end user is required anymore. Thus, the endpoint with the entry in the second central instance Zls is ultimately already paired. In this respect, there is no need for further pairing neither in the network protocol nor for other safety considerations.
- communication via the access points is now encrypted. The access points require, apart from a connection to the central entities ZI, Zl s, no further knowledge of the content of the communication. This means that all data is encrypted and transmitted in encrypted form for further routing to a destination inside or outside the network. In the above-mentioned key architecture, however, a subsequent exchange of keys is possible.
- An existing key is used to secure the data channel for the transmission of the new key. This procedure can be applied, for example, if the confidentiality of the previous key material is no longer guaranteed. If the initialization of the new key takes place in a "secure environment", then the endpoint equipped with new key material can then again be considered "secure".
- the network system continues to provide asymmetric encryption based on a common time base, the shared time base being provided by a third instance Z ⁇ t within the network ,
- This third instance Zl t need not necessarily be a physically separate from the first central entity ZI and second central authority device, but may also be integrated into this.
- the designation first and second central instance and third instance is to be seen merely as a distinction of the functionalities.
- the third instance Zl t provide distributed network Cl, as long as the necessary synchronism is ensured. It may also be readily provided that the time base is provided by other techniques, such as radio.
- the endpoints can query the common time base, for example via the access points.
- timestamps as a cryptographically strong initialization of the encryption algorithms (eg AES Counter Mode).
- AES Counter Mode a manipulation of the time base t Zl within the network for attackers from the outside is not possible.
- the transmitted timestamps can be verified via a challenge handshake conducted over the network by the endpoint, and thus likewise executed in a tamper-proof manner.
- "local communication" may be desired, for example between endpoints which are connected to a shared access node, for example, for reasons of network load, or if the first central entity ZI otherwise responsible for the routing is temporary
- the endpoint N 6 could contact the endpoint N 4 via the access node G 3 and any repeater R 2 needed with the endpoints N 3 and N 4, respectively, without having to do so Connection via the first central instance ZI would need.
- One way to allow this communication end-to-end encrypted is to pass the respective endpoint key to those partner endpoints involved in the local communication.
- temporarily limited keys are used for local communication. These keys can be created, for example, within the network Cl by a suitable device, for example the second central instance Zl s, and made available to the respective end points. For example, these temporary valid keys may be created based on the respective key data of the first and second endpoints and made available to the first and second endpoints.
- the temporary valid keys for the communication between the first endpoint and the second endpoint may be provided in addition to a first symmetric encryption system based on a common time base, wherein the common time base is determined by a or the third instance, preferably within the network, is made available.
- the validity with respect to the time base may be a few days, hours, minutes or even seconds.
- an almost infinite optimization with regard to safety can be provided, taking into account the possible duration of a compromise.
- One possible method of forming the temporary key is to use a hashing or encryption method, e.g. on a link between the original key material and the time base.
- Such a function could be provided by the following method.
- the time base results z.
- the temporary key is created via a crpto_hash function, which operates on the original key and the previously obtained timebase.
- this could be represented as follows
- time_base round (current_time / base_interval)
- temp_key crypto_hash (original_key, time_base)
- the temporary key is available as the second instance Zl.
- the second instance is usually able to detect the duration of a correct local communication can therefore generate and distribute correspondingly long valid keys. Farther For example, the second instance can also log and monitor the issuing of temporary keys so that no unnecessary keys are issued.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE112015003022.0T DE112015003022A5 (de) | 2014-06-24 | 2015-06-24 | Netzwerksystem mit Ende-zu-Ende Verschlüsselung |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102014212038.1A DE102014212038A1 (de) | 2014-06-24 | 2014-06-24 | Netzwerksystem mit Ende-zu-Ende Verschlüsselung |
DE102014212038.1 | 2014-06-24 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015197657A1 true WO2015197657A1 (de) | 2015-12-30 |
Family
ID=53540724
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2015/064180 WO2015197657A1 (de) | 2014-06-24 | 2015-06-24 | Netzwerksystem mit ende-zu-ende verschlüsselung |
Country Status (2)
Country | Link |
---|---|
DE (2) | DE102014212038A1 (de) |
WO (1) | WO2015197657A1 (de) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113852471B (zh) * | 2021-11-30 | 2022-04-01 | 武汉天喻信息产业股份有限公司 | 一种基于资源受限场景的数据通信方法及装置 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040030889A1 (en) * | 2002-08-09 | 2004-02-12 | Broadcom Corporation | Methods and apparatus for initialization vector processing |
US20060239218A1 (en) * | 2005-02-15 | 2006-10-26 | Weis Brian E | Clock-based replay protection |
US20070211900A1 (en) * | 2006-03-09 | 2007-09-13 | Tan Tat K | Network mobility security management |
US20090034557A1 (en) * | 2004-06-14 | 2009-02-05 | Cisco Technology, Inc. | Method and system for dynamic secured group communication |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB0208858D0 (en) * | 2002-04-18 | 2002-05-29 | Hewlett Packard Co | Method and apparatus for encrypting/decrypting data |
DE102005003208B4 (de) * | 2005-01-24 | 2015-11-12 | Giesecke & Devrient Gmbh | Authentisierung eines Benutzers |
DE102006003167B3 (de) * | 2006-01-23 | 2007-08-23 | Siemens Ag | Sichere Echtzeit-Kommunikation |
DE102014212037A1 (de) | 2014-06-24 | 2015-12-24 | Qsc Ag | Netzwerksystem |
-
2014
- 2014-06-24 DE DE102014212038.1A patent/DE102014212038A1/de not_active Withdrawn
-
2015
- 2015-06-24 DE DE112015003022.0T patent/DE112015003022A5/de not_active Withdrawn
- 2015-06-24 WO PCT/EP2015/064180 patent/WO2015197657A1/de active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040030889A1 (en) * | 2002-08-09 | 2004-02-12 | Broadcom Corporation | Methods and apparatus for initialization vector processing |
US20090034557A1 (en) * | 2004-06-14 | 2009-02-05 | Cisco Technology, Inc. | Method and system for dynamic secured group communication |
US20060239218A1 (en) * | 2005-02-15 | 2006-10-26 | Weis Brian E | Clock-based replay protection |
US20070211900A1 (en) * | 2006-03-09 | 2007-09-13 | Tan Tat K | Network mobility security management |
Also Published As
Publication number | Publication date |
---|---|
DE102014212038A1 (de) | 2015-12-24 |
DE112015003022A5 (de) | 2017-03-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3125492B1 (de) | Verfahren und system zum erzeugen eines sicheren kommunikationskanals für endgeräte | |
EP3220597B1 (de) | Verfahren und vorrichtung zum bereitstellen eines einmalpasswortes | |
DE102014222222A1 (de) | Verfahren zur Absicherung eines Netzwerks | |
DE102009037469A1 (de) | Aktualisierung und Verteilung von Verschlüsselungsschlüsseln | |
WO2014086654A1 (de) | Verfahren zum aufbau einer sicheren verbindung zwischen clients | |
DE102013221159B3 (de) | Verfahren und System zum manipulationssicheren Bereitstellen mehrerer digitaler Zertifikate für mehrere öffentliche Schlüssel eines Geräts | |
DE102020003739A1 (de) | Verfahren zur Verteilung und Aushandlung von Schlüsselmaterial | |
DE102014011687B3 (de) | Kommunikationssystem mit PKI-Schlüsselpaar für mobiles Endgerät | |
DE102018202176A1 (de) | Master-Slave-System zur Kommunikation über eine Bluetooth-Low-Energy-Verbindung | |
EP3661113A1 (de) | Verfahren und vorrichtung zum übertragen von daten in einem publish-subscribe-system | |
DE112015003792T5 (de) | System und Verfahren zur Verwaltung von sicheren Kommunikationen in einem Ad-hoc-Netzwerk | |
EP3171570B1 (de) | Vorrichtung und verfahren zum anpassen von berechtigungsinformationen eines endgeräts | |
WO2015197657A1 (de) | Netzwerksystem mit ende-zu-ende verschlüsselung | |
DE102014212443A1 (de) | Verringerung des Speicherbedarfs für kryptographische Schlüssel | |
EP3525414A1 (de) | Verfahren zur verschlüsselten übertragung von daten auf einer kryptographisch geschützten, unverschlüsselten kommunikationsverbindung | |
EP2685682A2 (de) | Verfarhen und System zur sicheren Nachrichtenübertragung | |
AT521914B1 (de) | Kommunikationsmodul | |
EP2481183A1 (de) | Verfahren zum aufbauen eines gesicherten kommunikationskanals | |
DE102022000638B9 (de) | Verfahren zum sicheren Aushandeln von symmetrischen Schlüsseln zwischen zwei Teilnehmern einer Kommunikation | |
DE102015208176A1 (de) | Gerät und Verfahren zur Autorisierung eines privaten kryptographischen Schlüssels in einem Gerät | |
DE102014217320A1 (de) | Verfahren zur Generierung eines kryptographischen Schlüssels in einem Gerät sowie hierzu eingerichtetes Gerät | |
EP3363144B1 (de) | Verfahren und vorrichtung zum etablieren eines gemeinsamen geheimnisses | |
DE102014222216A1 (de) | Verfahren und Vorrichtung zur Absicherung einer Kommunikation | |
DE102014217330A1 (de) | Verfahren zum Informationsabgleich zwischen Geräten sowie hierzu eingerichtetes Gerät | |
DE102022005046A1 (de) | Verfahren zum sicheren Aushandeln von symmetrischen Schlüsseln zwischen zwei Teilnehmern einer Kommunikation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15735872 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 112015003022 Country of ref document: DE |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: R225 Ref document number: 112015003022 Country of ref document: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 15735872 Country of ref document: EP Kind code of ref document: A1 |