WO2020108702A1 - Method for generating a linked blockchain structure in an electronic memory - Google Patents

Method for generating a linked blockchain structure in an electronic memory Download PDF

Info

Publication number
WO2020108702A1
WO2020108702A1 PCT/DE2019/101012 DE2019101012W WO2020108702A1 WO 2020108702 A1 WO2020108702 A1 WO 2020108702A1 DE 2019101012 W DE2019101012 W DE 2019101012W WO 2020108702 A1 WO2020108702 A1 WO 2020108702A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
blockchain
descriptor
context
blocks
Prior art date
Application number
PCT/DE2019/101012
Other languages
German (de)
French (fr)
Inventor
Michael KUPERBERG
Original Assignee
Deutsche Bahn Ag
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Deutsche Bahn Ag filed Critical Deutsche Bahn Ag
Priority to DE112019005859.2T priority Critical patent/DE112019005859A5/en
Publication of WO2020108702A1 publication Critical patent/WO2020108702A1/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Definitions

  • the invention relates to a method for generating a chained blockchain structure in an electronic memory, which comprises a root initiating the blockchain and at least one first block chained directly to the root of the blockchain by means of a first data element.
  • a blockchain is to be understood here as a continuously expandable list of data records or so-called “blocks”, which are linked together using cryptographic methods. Each block contains a cryptographically secure check value (so-called “hash value”) of the previous block as well as transaction data and time stamps.
  • hash value a cryptographically secure check value of the previous block as well as transaction data and time stamps.
  • One of the basic principles of a blockchain structure is that newly added data records or blocks are always appended to the most recent or last block (so-called “append-only” principle). Later data records always build on earlier data records and confirm them by proving knowledge of the previous data record. Earlier data records can therefore no longer be deleted or changed without later data records being destroyed or compromised, since their respective hash references to the deleted or changed block are no longer valid. This invalidation then transits into all subsequent blocks. If individual data records or blocks are to be deleted from a blockchain, all data records following this block and directly or indirectly referring to the block to be deleted must be recalculated and saved
  • a system based on a blockchain is known from WO 2017/202757 A1, in which manipulative change of data by a system of distributed keys is to be prevented, so that only several parties can change the data. Subsequent deletion of data without destroying or compromising other data would only be possible if the check value or hash value of the block following the block (which was deleted by deleting the user data) was also manipulated so that it despite this change in the chained block remains unchanged. Such a procedure would be extremely complex, because not only would the block to be changed or deleted be searched, but also the corresponding modification of the hash value in all direct successors of this block to be changed or deleted would have to be carried out. In addition, it would require the use of test values that would be equipped with appropriate access options for changing access. This entails additional security risks.
  • the invention is therefore based on the object of providing a method for generating a chained blockchain structure in an electronic memory, which comprises a root initiating the blockchain and at least one first block chained directly to the root of the blockchain by means of a first data element, which method comprises a Simple and effortless deletion of data records or blocks from the blockchain enables.
  • this object is achieved in connection with the preamble of claim 1 by integrating an additional second data element into each first block, which contains a descriptor which uniquely identifies each first block.
  • a tree-like or non-linear blockchain structure can be implemented, which comprises a plurality of transaction chains originating from a common root, each transaction chain being uniquely identifiable by means of the descriptor provided in its first block and directly linked to the root .
  • the core idea of the invention thus comprises a blockchain structure with at least one first block that immediately follows the root (often also referred to as a “Genesis block”) and is linked to this, which contains a second data element defining a descriptor, the descriptor is valid for all subsequent blocks contained in the linear transaction chain established by the at least one first block. These subsequent blocks of the same transaction chain therefore do not require any data element containing the descriptor.
  • a context chain can thus be justified by such a first block according to the invention that defines the descriptor. Under a context chain is to be understood as a transaction chain for which all blocks the same descriptor is valid.
  • the data records stored in a blockchain which are in a transaction context to this descriptor, can be structured into linear subchains or context chains and thus at a later point in time without compromising consequences for other subchains or those stored in the block chain Context chains can be deleted as well as without the need to recalculate them.
  • the present invention thus enables the deletion of individual data records in a particularly simple manner without violating the basic principles of block chains, which are constructed according to the aforementioned “append-only principle”, and considerably reduces the effort required for operating a block chain.
  • data can also be stored in the structure of a blockchain, for which an unrestricted deletion option (so-called "right to be forgotten") must be ensured, for example, for overriding legal reasons.
  • an unrestricted deletion option so-called "right to be forgotten”
  • this goal could not be reasonably achieved, since this actually contradicts the basic concept of a blockchain, which is designed for maximum transparency and maximum prevention of subsequent changes or deletions of data records or blocks.
  • the invention further provides that when a block is newly to be integrated into the blockchain structure, its content is based on the existence of a certain transaction context to one of the descriptors already stored in the second data elements of the first blocks of all subchains already existing in the blockchain structure is analyzed and this block is added to the sub- or context chain defined by the respective descriptor in the second data element (or appended to its most recent block) if the result of the analysis is positive (ie if a transaction context is valid for an existing descriptor) ) becomes.
  • a new first block of an additional subchain of the blockchain structure is created, the second data element of which contains a new descriptor (that is, it can be distinguished from the descriptors of the other subchains) and this block to be reinserted is added to this additional subchain.
  • the invention further provides that the descriptor is designed in several elements. This is to be understood to mean that each descriptor of a sub-chain comes from a closed set of identifiers; in such a way that the descriptors of two subchains are different or distinguishable in pairs.
  • a transaction which is to be stored in the blockchain structure can be analyzed in a particularly advantageous manner by means of the method according to the invention and a unique or distinctive descriptor suitable for the transaction can be determined. If a subchain with such a descriptor already exists, the transaction is saved in this subchain. Otherwise, a new subchain is added to the root or the Genesis block of the blockchain by generating a new first block according to the invention and the transaction is stored in this new subchain.
  • the descriptor is designed as a standardized name-based identifier.
  • descriptors can also be implemented as a UUID (so-called “universally unique identifier”) in accordance with the ISO / I EC 9834-8: 2014 standard.
  • UUID universalally unique identifier
  • the individual entities e.g. natural or legal persons
  • relevant data records are stored in structured person-specific context chains of a blockchain. These data records can then be used if necessary, e.g. at the request of the respective entity or person, without being invalidated by the block information on other entities or persons.
  • Such a name-based identifier can also be a unique identifier, for example of a context relation between two entities (e.g. two people), without explicitly listing the identities of both entities. The scope of such a descriptor can then be administered outside the first block attached to the root or to the Genesis block of the blockchain structure.
  • Figure 2 Structure of a blockchain created according to the inventive method with a tree structure constructed from two context chains (the number of context chains is not limited to two).
  • each transaction to be stored in a block chain structure is inserted as a useful data (1.2) in a first block (1), which is followed by further blocks (2, 3, 4) in a linear chain , whose user data describe transactions between other institutions and / or other people, the chaining using hash references (2.1, 3.1, 4.1) to the respective previous block.
  • the first block (1) is also linked via a hash reference (1.1) with the “Genesis Block” (0) which forms the linear chain.
  • FIG. 2 shows the structure of a blockchain created according to the inventive method, which has a tree structure composed of at least two sub-chains or context chains. Both sub-chains or context chains each have a first block (101, 102), each of which is a first Data element (101.1, 102.1) with a test value or hash value for concatenating the first block (101, 102) with the common root (100), which forms the "Genesis Block” initiating the blockchain.
  • the first two blocks have the feature of an additional data element (101.2, 102.2) that is essential for the invention and which uniformizes a subsequent block (103, 104) of the same sub- or context chain for the first and each further subsequent block (103, 104) Contains descriptor.
  • This descriptor-defining first block (101, 102) therefore establishes a single linear sub- or context chain, so that the entire blockchain has a plurality of linear sub- or context chains with a common root (100) and in which Type of a tree or is structured in a non-linear manner.
  • the blocks of each sub- or context chain are both free of incoming concatenations from blocks of other sub- or context chains as well as free of concatenations in the direction of such blocks of other sub- or context chains.
  • the blocks of each sub- or context chain are therefore free of dependencies on blocks of other sub- or context chains, which are deleted when a single sub- or context chain is deleted. chain would go into an unfulfilled or unfulfillable state.
  • the transactions between a first natural person (P1) and a legal person or company (F) are, for example, in the first sub- or context chain and the transactions between a second natural person in a second sub- or context chain (P2) and the same company (F).
  • the branches of the blockchain structure formed by the two sub- or context chains can be deleted independently of one another, without such deletion having repercussions on the blocks of the other branch not affected by the deletion.
  • the deletion of one of the branches or a sub- or context chain of the blockchain formed according to the invention is therefore free of side effects on other branches or sub- or context chains of the same blockchain.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Bioethics (AREA)
  • Health & Medical Sciences (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to a method for generating a linked blockchain structure in an electronic memory which comprises a root (100) initiating the blockchain and at least one first block (101, 102) linked directly to the root (100) of the blockchain by means of a first data element (101.1, 102.1). This is intended to enable simple and economical deletion of data records or blocks from the blockchain. This is achieved according to the invention in that an additional second data element (101.2, 102.2) is integrated in each first block (101, 102) and contains a descriptor uniquely identifying each first block.

Description

Verfahren zum Erzeugen einer verketteten Blockchain-Struktur in einem elektronischen Speicher Method for creating a linked blockchain structure in an electronic memory
Die Erfindung betrifft ein Verfahren zum Erzeugen einer verketteten Blockchain- Struktur in einem elektronischen Speicher , welche eine die Blockchain initiierende Wurzel und mindestens einen mittels eines ersten Datenelements unmittelbar mit der Wurzel der Blockchain verketteten ersten Block umfasst. The invention relates to a method for generating a chained blockchain structure in an electronic memory, which comprises a root initiating the blockchain and at least one first block chained directly to the root of the blockchain by means of a first data element.
Das Speichern von Daten unter Verwendung von Blockchain-Strukturen ist aus dem Stand der Technik in großem Umfang bekannt. Unter einer Blockchain ist hierbei eine kontinuierlich erweiterbare Liste von Datensätzen bzw. sog.„Blöcken“ zu verstehen, welche mittels kryptographischer Verfahren miteinander verkettet sind. Jeder Block enthält dabei einen kryptographisch sicheren Prüfwert (sog. „Hashwert“) des vorhergehenden Blocks sowie Transaktionsdaten und Zeitstem pel. Eines der Grundprinzipien einer Blockchain-Struktur besteht darin, dass neu hinzukommende Datensätze bzw. Blöcke grundsätzlich an den jüngsten bzw. letz ten Block angehängt werden (sog. ,,append-only“-Prinzip). Spätere Datensätze bauen also stets auf zeitlich früheren Datensätzen auf und bestätigen diese, in dem sie die Kenntnis des früheren Datensatzes beweisen. Frühere Datensätze können deshalb nicht mehr gelöscht oder verändert werden, ohne dass hierdurch spätere Datensätze zerstört bzw. kompromittiert werden, da ihre jeweiligen Hash- Verweise auf den gelöschten oder veränderten Block nicht mehr gültig sind. Diese Invalidierung pflanzt sich dann transitiv in alle nachfolgenden Blöcke fort. Sofern einzelne Datensätze bzw. Blöcke aus einer Blockchain gelöscht werden sollen, müssen alle auf diesen Block folgenden und direkt oder indirekt auf diesen zu lö schenden Block referenzierenden Datensätze neu berechnet und gespeichert werden. Dies ist extrem aufwändig. The storage of data using blockchain structures is known to a large extent from the prior art. A blockchain is to be understood here as a continuously expandable list of data records or so-called “blocks”, which are linked together using cryptographic methods. Each block contains a cryptographically secure check value (so-called “hash value”) of the previous block as well as transaction data and time stamps. One of the basic principles of a blockchain structure is that newly added data records or blocks are always appended to the most recent or last block (so-called “append-only” principle). Later data records always build on earlier data records and confirm them by proving knowledge of the previous data record. Earlier data records can therefore no longer be deleted or changed without later data records being destroyed or compromised, since their respective hash references to the deleted or changed block are no longer valid. This invalidation then transits into all subsequent blocks. If individual data records or blocks are to be deleted from a blockchain, all data records following this block and directly or indirectly referring to the block to be deleted must be recalculated and saved. This is extremely complex.
Aus der WO 2017/202757 A1 ist ein auf einer Blockchain basierendes System bekannt, bei dem eine manipulative Veränderung von Daten durch ein System verteilter Schlüssel verhindert werden soll, so dass nur mehrere Parteien eine Veränderung von Daten durchführen können. Ein nachträgliches Löschen von Daten ohne Zerstörung oder Kompromittierung anderer Daten wäre nur möglich, wenn zusätzlich auch der Prüfwert bzw. Hash-Wert des auf den (durch Löschen der Nutzdaten) veränderten Block folgenden Blocks so manipuliert würde, dass er trotz dieser Veränderung des verketteten Blocks unverändert bleibt. Ein solches Vorgehen wäre extrem aufwändig, weil nicht nur der zu ändernde bzw. zu lö schende Block gesucht, sondern auch die entsprechende Modifizierung des Hash- Werts in sämtlichen direkten Nachfolgern dieses zu ändernden bzw. zu löschen den Blockes durchzuführen wäre. Zudem würde es den Einsatz von Prüfwerten erforderlich machen, die mit entsprechenden Zugangsmöglichkeiten für einen än dernden Zugriff ausgestattet wären. Dies bringt zusätzliche Sicherheitsrisiken mit sich. A system based on a blockchain is known from WO 2017/202757 A1, in which manipulative change of data by a system of distributed keys is to be prevented, so that only several parties can change the data. Subsequent deletion of data without destroying or compromising other data would only be possible if the check value or hash value of the block following the block (which was deleted by deleting the user data) was also manipulated so that it despite this change in the chained block remains unchanged. Such a procedure would be extremely complex, because not only would the block to be changed or deleted be searched, but also the corresponding modification of the hash value in all direct successors of this block to be changed or deleted would have to be carried out. In addition, it would require the use of test values that would be equipped with appropriate access options for changing access. This entails additional security risks.
Der Erfindung liegt daher die Aufgabe zugrunde, ein Verfahren zum Erzeugen einer verketteten Blockchain-Struktur in einem elektronischen Speicher , welche eine die Blockchain initiierende Wurzel und mindestens einen mittels eines ersten Datenelements unmittelbar mit der Wurzel der Blockchain verketteten ersten Block umfasst, bereitzustellen, welches ein einfaches und aufwandsarmes Löschen von Datensätzen bzw. Blöcken aus der Blockchain ermöglicht. The invention is therefore based on the object of providing a method for generating a chained blockchain structure in an electronic memory, which comprises a root initiating the blockchain and at least one first block chained directly to the root of the blockchain by means of a first data element, which method comprises a Simple and effortless deletion of data records or blocks from the blockchain enables.
Erfindungsgemäß wird diese Aufgabe in Verbindung mit dem Oberbegriff des Pa tentanspruches 1 dadurch gelöst, dass in jeden ersten Block ein zusätzliches zweites Datenelement integriert wird, welches einen jeden ersten Block eindeutig identifizierenden Deskriptor enthält. According to the invention, this object is achieved in connection with the preamble of claim 1 by integrating an additional second data element into each first block, which contains a descriptor which uniquely identifies each first block.
Auf diese Weise ist eine baumartig bzw. nicht-linear aufgebaute Blockchain- Struktur realisierbar, welche eine Mehrzahl von aus einer gemeinsamen Wurzel ausgehenden Transaktionsketten umfasst, wobei jede Transaktionskette mittels des in ihrem ersten und unmittelbar mit der Wurzel verketteten Block vorgesehe nen Deskriptors eindeutig identifizierbar ist. In this way, a tree-like or non-linear blockchain structure can be implemented, which comprises a plurality of transaction chains originating from a common root, each transaction chain being uniquely identifiable by means of the descriptor provided in its first block and directly linked to the root .
Die Kernidee der Erfindung umfasst somit eine Blockchain-Struktur mit mindes tens einem unmittelbar auf die Wurzel (oftmals auch als„Genesis-Block“ bezeich net) folgenden und auf diesen verketteten ersten Block, der ein einen Deskriptor definierendes zweites Datenelement enthält, wobei der Deskriptor für alle in der durch den mindestens einen ersten Block begründeten linearen Transaktionskette enthaltenen nachfolgenden Blöcke gültig ist. Diese nachfolgenden Blöcke dersel ben Transaktionskette benötigen also kein den Deskriptor enthaltendes Daten element. Durch einen solchen erfindungsgemäßen, den Deskriptor definierenden ersten Block kann also eine Kontextkette begründet werden. Unter einer Kontext- kette ist eine solche Transaktionskette zu verstehen, für deren sämtliche Blöcke derselbe Deskriptor gültig ist. Auf diese Weise sind die in einer Blockchain gespei cherten Datensätze, die in einem Transaktions-Kontext zu diesem Deskriptor ste hen, zu linearen Subketten bzw. Kontextketten strukturierbar und dadurch zu ei nem späteren Zeitpunkt ohne kompromittierende Folgen für andere in der Block chain gespeicherte Subketten bzw. Kontextketten sowie ohne Erfordernis zu deren Neuberechnung löschbar. The core idea of the invention thus comprises a blockchain structure with at least one first block that immediately follows the root (often also referred to as a “Genesis block”) and is linked to this, which contains a second data element defining a descriptor, the descriptor is valid for all subsequent blocks contained in the linear transaction chain established by the at least one first block. These subsequent blocks of the same transaction chain therefore do not require any data element containing the descriptor. A context chain can thus be justified by such a first block according to the invention that defines the descriptor. Under a context chain is to be understood as a transaction chain for which all blocks the same descriptor is valid. In this way, the data records stored in a blockchain, which are in a transaction context to this descriptor, can be structured into linear subchains or context chains and thus at a later point in time without compromising consequences for other subchains or those stored in the block chain Context chains can be deleted as well as without the need to recalculate them.
Die vorliegende Erfindung ermöglicht also in besonders einfacher Weise das Lö schen einzelner Datensätze ohne Verletzung der Grundprinzipien von Block- chains, die nach dem vorgenannten„append-only-Prinzip“ aufgebaut sind, und reduziert den Aufwand für die Betriebsführung einer Blockchain ganz erheblich. Somit können auch solche Daten in der Struktur einer Blockchain gespeichert werden, für die beispielsweise aus übergeordneten rechtlichen Gründen eine un eingeschränkte Löschungs-Möglichkeit (sog.„Recht auf Vergessen“) sichergestellt sein muss. Mit bisherigen Verfahren zur Speicherung von Daten in Blockchains war dieses Ziel nicht sinnvoll erreichbar, da dies eigentlich der Grundkonzeption einer Blockchain widerspricht, die ja auf maximale Transparenz und maximales Verhindern von nachträglichen Änderungen bzw. Löschungen von Datensätzen bzw. Blöcken ausgelegt ist. The present invention thus enables the deletion of individual data records in a particularly simple manner without violating the basic principles of block chains, which are constructed according to the aforementioned “append-only principle”, and considerably reduces the effort required for operating a block chain. This means that data can also be stored in the structure of a blockchain, for which an unrestricted deletion option (so-called "right to be forgotten") must be ensured, for example, for overriding legal reasons. With previous methods for storing data in blockchains, this goal could not be reasonably achieved, since this actually contradicts the basic concept of a blockchain, which is designed for maximum transparency and maximum prevention of subsequent changes or deletions of data records or blocks.
Die Erfindung sieht hierzu ferner vor, dass bei der Erzeugung eines neu in die Blockchain-Struktur einzugliedernden Blocks dessen Inhalt auf Existenz eines bestimmten Transaktions- Kontextes zu einem der in den zweiten Datenelementen der ersten Blöcke aller in der Blockchain-Struktur bereits existierenden Subketten abgespeichterten Deskriptoren analysiert wird und dieser Block bei positivem Er gebnis der Analyse (d.h. bei Vorliegen eines für einen existierenden Deskriptor gültigen Transaktions- Kontextes) der durch den jeweiligen Deskriptor im zweiten Datenelement definierten Sub- bzw. Kontextkette hinzugefügt (bzw. an deren zeit lich jüngsten Block angehängt) wird. Bei negativem Ergebnis der Analyse wird ein neuer erster Block einer zusätzlichen Subkette der Blockchain-Struktur angelegt, dessen zweites Datenelement einen neuen (d.h. von den Deskriptoren der übrigen Subketten unterscheidbaren) Deskriptor enthält und dieser neu einzugliedernde Block an diese zusätzliche Subkette hinzugefügt. Die Erfindung sieht ferner vor, dass der Deskriptor mehrelementig ausgeführt ist. Hierunter ist zu verstehen, der jeder Deskriptor einer Subkette einer abgeschlos sene Menge von Bezeichneren bzw. Identifiern entstammt; und zwar derart, dass die Deskriptoren zweier Subkette paarweise verschieden bzw. unterscheidbar sind. Auf diese Weise kann eine Transaktion, die in der Blockchain-Struktur ge speichert werden soll, mittels des erfindungsgemäßen Verfahrens in besonders vorteilhafter Weise analysiert und ein zur Transaktion passender eindeutiger bzw. unterscheidungsfähiger Deskriptor bestimmt werden. Existiert bereits eine Subket te mit einem solchen Deskriptor, wird die Transaktion in dieser Subkette gespei chert. Andernfalls wird durch Erzeugen eines neuen erfindungsgemäßen ersten Blocks eine neue Subkette an die Wurzel bzw. den Genesis-Block der Blockchain angehängt und die Transaktion in dieser neuen Subkette gespeichert. For this purpose, the invention further provides that when a block is newly to be integrated into the blockchain structure, its content is based on the existence of a certain transaction context to one of the descriptors already stored in the second data elements of the first blocks of all subchains already existing in the blockchain structure is analyzed and this block is added to the sub- or context chain defined by the respective descriptor in the second data element (or appended to its most recent block) if the result of the analysis is positive (ie if a transaction context is valid for an existing descriptor) ) becomes. If the result of the analysis is negative, a new first block of an additional subchain of the blockchain structure is created, the second data element of which contains a new descriptor (that is, it can be distinguished from the descriptors of the other subchains) and this block to be reinserted is added to this additional subchain. The invention further provides that the descriptor is designed in several elements. This is to be understood to mean that each descriptor of a sub-chain comes from a closed set of identifiers; in such a way that the descriptors of two subchains are different or distinguishable in pairs. In this way, a transaction which is to be stored in the blockchain structure can be analyzed in a particularly advantageous manner by means of the method according to the invention and a unique or distinctive descriptor suitable for the transaction can be determined. If a subchain with such a descriptor already exists, the transaction is saved in this subchain. Otherwise, a new subchain is added to the root or the Genesis block of the blockchain by generating a new first block according to the invention and the transaction is stored in this new subchain.
In besonders sinnvoller Weise sieht die Erfindung vor, dass der Deskriptor als standardisierter namensbasierter Bezeichner ausgeführt ist. Solche Deskriptoren können auch als UUID (sogenannter„Universally Unique Identifier“) gemäß dem Standard ISO/I EC 9834-8:2014 ausgeführt sein. Auf diese Weise können die zu einzelnen Entitäten, wie z.B. natürlichen oder juristischen Personen, relevanten Datensätze in strukturierte personenindividuelle Kontextketten einer Blockchain gespeichert werden. Diese Datensätze können dann im Bedarfsfall, z.B. auf An forderung der jeweiligen Entität bzw. Person, gelöscht werden, ohne dass hier durch die Blockinformationen zu anderen Entitäten bzw. Personen invalidiert wer den. Ein solcher namensbasierter Bezeichner kann aber auch ein eindeutiger Identifier beispielsweise einer Kontext- Relation zweier Entitäten (z.B. zweier Per sonen) sein, ohne hierbei die Identitäten beider Entitäten explizit aufzulisten. Der Umfang eines solchen Deskriptors ist dann außerhalb des ersten an der Wurzel bzw. am Genesis-Block der Blockchain-Struktur hängenden Blocks administrier bar. In a particularly meaningful way, the invention provides that the descriptor is designed as a standardized name-based identifier. Such descriptors can also be implemented as a UUID (so-called “universally unique identifier”) in accordance with the ISO / I EC 9834-8: 2014 standard. In this way, the individual entities, e.g. natural or legal persons, relevant data records are stored in structured person-specific context chains of a blockchain. These data records can then be used if necessary, e.g. at the request of the respective entity or person, without being invalidated by the block information on other entities or persons. Such a name-based identifier can also be a unique identifier, for example of a context relation between two entities (e.g. two people), without explicitly listing the identities of both entities. The scope of such a descriptor can then be administered outside the first block attached to the root or to the Genesis block of the blockchain structure.
Die vorliegende Erfindung wird nachfolgend anhand eines Ausführungsbeispiels näher erläutert, welches exemplarisch die Speicherung von Transaktionen zwi schen einer ersten Menge von natürlichen Personen und einer zweiten Menge von juristischen Institutionen beschreibt. Es zeigen Figur 1 : Struktur einer gemäß bekanntem Stand der Technik erstellten Blockchain The present invention is explained in more detail below on the basis of an exemplary embodiment which exemplarily describes the storage of transactions between a first set of natural persons and a second set of legal institutions. Show it Figure 1: Structure of a blockchain created according to known prior art
Figur 2: Struktur einer gemäß des erfinderischen Verfahrens erstellten Blockchain mit einer aus zwei Kontextketten aufgebauten Baumstruktur (wobei die Anzahl der Kontextketten nicht auf zwei beschränkt ist). Figure 2: Structure of a blockchain created according to the inventive method with a tree structure constructed from two context chains (the number of context chains is not limited to two).
Gemäß des in Figur 1 dargestellten Standes der Technik ist jede in einer Block- chain-Struktur abzuspeichernde Transaktion als Nutzdate (1.2) in einen ersten Block (1) eingefügt, auf den in einer linearen Kette weitere Blöcke (2, 3, 4) folgen, deren Nutzdaten Transaktionen zwischen jeweils anderen Institutionen und / oder anderen Personen beschreiben, wobei die Verkettung über Hash-Verweise (2.1 , 3.1 , 4.1) auf den jeweils vorherigen Block erfolgt. Der erste Block (1) ist ebenfalls über einen Hash-Verweis (1.1) mit dem die lineare Kette begründenden„Genesis Block“ (0) verkettet. According to the prior art shown in FIG. 1, each transaction to be stored in a block chain structure is inserted as a useful data (1.2) in a first block (1), which is followed by further blocks (2, 3, 4) in a linear chain , whose user data describe transactions between other institutions and / or other people, the chaining using hash references (2.1, 3.1, 4.1) to the respective previous block. The first block (1) is also linked via a hash reference (1.1) with the “Genesis Block” (0) which forms the linear chain.
In Figur 2 ist die Struktur einer gemäß des erfinderischen Verfahrens erstellten Blockchain dargestellt, welche eine aus mindestens zwei Subketten bzw. Kontext ketten aufgebaute Baumstruktur aufweist Beide Sub- bzw. Kontextketten weisen jeweils einen ersten Block (101 , 102) auf, welcher jeweils ein erstes Datenelement (101.1 , 102.1) mit einem Prüfwert bzw. Hash-Wert zum Verketten des ersten Blocks (101 , 102) mit der gemeinsamen Wurzel (100), welche den die Blockchain initiierenden„Genesis Block“ bildet, aufweist. Ebenso weisen die beiden ersten Blöcke das für die Erfindung wesentliche Merkmal eines zusätzlichen Datenele ments (101.2, 102.2) auf, welches einen für den ersten und jeden weiteren auf den ersten Block verketteten nachfolgenden Block (103, 104) derselben Sub- bzw. Kontextkette einheitlichen Deskriptor enthält. Dieser Deskriptor-definierende erste Block (101 , 102) begründet also jeweils eine einzelne in sich lineare Sub- bzw. Kontextkette, so dass die gesamte Blockchain eine Mehrzahl von linearen Sub- bzw. Kontextketten mit einer gemeinsamen Wurzel (100) aufweist und in der Art eines Baumes bzw. in nicht-linearer Weise strukturiert ist. Die Blöcke einer jeden Sub- bzw. Kontextkette sind sowohl frei von eingehenden Verkettungen aus Blö cken anderer Sub- bzw. Kontextketten als auch frei von Verkettungen in Richtung zu solchen Blöcken anderer Sub- bzw. Kontextketten. Somit sind die Blöcke einer jeden Sub- bzw. Kontextkette frei von Abhängigkeiten zu Blöcken anderer Sub- bzw. Kontextketten, welche bei der Löschung einer einzelnen Sub- bzw. Kontext- kette in einen unerfüllten bzw. unerfüllbaren Zustand übergehen würden. FIG. 2 shows the structure of a blockchain created according to the inventive method, which has a tree structure composed of at least two sub-chains or context chains. Both sub-chains or context chains each have a first block (101, 102), each of which is a first Data element (101.1, 102.1) with a test value or hash value for concatenating the first block (101, 102) with the common root (100), which forms the "Genesis Block" initiating the blockchain. Likewise, the first two blocks have the feature of an additional data element (101.2, 102.2) that is essential for the invention and which uniformizes a subsequent block (103, 104) of the same sub- or context chain for the first and each further subsequent block (103, 104) Contains descriptor. This descriptor-defining first block (101, 102) therefore establishes a single linear sub- or context chain, so that the entire blockchain has a plurality of linear sub- or context chains with a common root (100) and in which Type of a tree or is structured in a non-linear manner. The blocks of each sub- or context chain are both free of incoming concatenations from blocks of other sub- or context chains as well as free of concatenations in the direction of such blocks of other sub- or context chains. The blocks of each sub- or context chain are therefore free of dependencies on blocks of other sub- or context chains, which are deleted when a single sub- or context chain is deleted. chain would go into an unfulfilled or unfulfillable state.
Auf diese Weise sind in der ersten Sub- bzw. Kontextkette beispielsweise die Transaktionen zwischen einer ersten natürlichen Person (P1) und einer juristi schen Person bzw. Firma (F) sowie in einer zweiten Sub- bzw. Kontextkette die Transaktionen zwischen einer zweiten natürlichen Person (P2) und derselben Fir ma (F) abgespeichert. Die durch die beiden Sub- bzw. Kontextketten gebildeten Äste der Blockchain-Struktur sind unabhängig voneinander löschbar, ohne dass eine solche Löschung Rückwirkungen auf die Blöcke des jeweils anderen, nicht von der Löschung betroffenen Astes hat. Die Löschung eines der Äste bzw. einer Sub- bzw. Kontextkette der erfindungsgemäß gebildeten Blockchain ist also frei von Seiteneffekten auf andere Äste bzw. Sub- bzw. Kontextketten derselben Blockchain. In this way, the transactions between a first natural person (P1) and a legal person or company (F) are, for example, in the first sub- or context chain and the transactions between a second natural person in a second sub- or context chain (P2) and the same company (F). The branches of the blockchain structure formed by the two sub- or context chains can be deleted independently of one another, without such deletion having repercussions on the blocks of the other branch not affected by the deletion. The deletion of one of the branches or a sub- or context chain of the blockchain formed according to the invention is therefore free of side effects on other branches or sub- or context chains of the same blockchain.
Bezugszeichenliste: Reference symbol list:
0 Genesis Block (gern. Stand der Technik) 0 Genesis Block (state of the art)
1 erster Block (gern. Stand der Technik) 1 first block (gladly. State of the art)
2, 3, 4 weitere Blöcke (gern. Stand der Technik) 2, 3, 4 further blocks (gladly. State of the art)
1.1 Hash-Verweis des ersten Blocks (1) 1.1 hash reference of the first block (1)
2.1 , 3.1 , 4.1 Hash-Verweise der weiteren Blöcke (2, 3, 4) 2.1, 3.1, 4.1 hash references of the other blocks (2, 3, 4)
1.2 Nutzdate des ersten Blocks 1.2 User data of the first block
2.2, 3.2, 4.2 Nutzdaten der weiteren Blöcke 2.2, 3.2, 4.2 User data of the other blocks
100 Genesis-Block (gern. Erfindung) 100 Genesis block (gladly. Invention)
101 erster Block einer ersten Subkette (gern. Erfindung) 101 first block of a first subchain (gladly. Invention)
102 erster Block einer zweiten Subkette (gern. Erfindung)102 first block of a second subchain (gladly. Invention)
103, 104 weitere Blöcke der ersten bzw. zweiten Subkette 101.1 Hash-Verweis des ersten Blocks (101) der ersten Subkette 103, 104 further blocks of the first or second subchain 101.1 hash reference of the first block (101) of the first subchain
102.1 Hash-Verweis des ersen Blocks (102) der zweiten Subkette 102.1 hash reference of the first block (102) of the second subchain
103.1 , 104.1 Hash-Verweise der weiteren Blöcke (103, 104) 101.2 Deskriptor des ersten Blocks (101) der ersten Sub- kette 103.1, 104.1 hash references of the further blocks (103, 104) 101.2 descriptor of the first block (101) of the first subchain
102.2 Deskriptor des ersten Blocks (102) der zweiten Sub- kette 102.2 Descriptor of the first block (102) of the second sub-chain
103.3, 104.3 Nutzdaten der weiteren Blöcke (103, 104) 103.3, 104.3 User data of the further blocks (103, 104)

Claims

Patentansprüche Claims
1. Verfahren zum Erzeugen einer verketteten Blockchain-Struktur in einem elektronischen Speicher, welche eine die Blockchain initiierende Wurzel (100) und mindestens einen mittels eines ersten Datenelements (101.1 , 102.1) unmittelbar mit der Wurzel (100) der Blockchain verketteten ersten Block (101 , 102) umfasst, dadurch gekennzeichnet, dass in jeden ersten Block (101 , 102) ein zusätzliches zweites Datenelement (101.2, 102.2) integriert wird, welches einen jeden ersten Block eindeutig identifizierenden Deskriptor enthält. 1. A method for generating a chained blockchain structure in an electronic memory which has a root (100) initiating the blockchain and at least one first block (101) chained directly to the root (100) of the blockchain by means of a first data element (101.1, 102.1) , 102), characterized in that an additional second data element (101.2, 102.2) is integrated in each first block (101, 102), which contains a descriptor which uniquely identifies each first block.
2. Verfahren zum Erzeugen einer verketteten Blockchain-Struktur in einem elektronischen Speicher nach Patentanspruch 1 , dadurch gekennzeichnet, dass der Deskriptor mehrelementig ausgeführt ist. 2. The method for generating a chained blockchain structure in an electronic memory according to claim 1, characterized in that the descriptor is made up of several elements.
3. Verfahren zum Erzeugen einer verketteten Blockchain-Struktur in einem elektronischen Speicher nach Patentanspruch 1 oder 2, dadurch gekenn zeichnet, dass der Deskriptor als standardisierter namensbasierter Be zeichner ausgeführt ist. 3. A method for generating a chained blockchain structure in an electronic memory according to claim 1 or 2, characterized in that the descriptor is designed as a standardized name-based identifier.
PCT/DE2019/101012 2018-11-26 2019-11-26 Method for generating a linked blockchain structure in an electronic memory WO2020108702A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
DE112019005859.2T DE112019005859A5 (en) 2018-11-26 2019-11-26 METHOD OF CREATING A CHAINED BLOCKCHAIN STRUCTURE IN AN ELECTRONIC MEMORY

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102018220224.9A DE102018220224A1 (en) 2018-11-26 2018-11-26 Method for tamper-proof storage of data in an electronic memory using a chained blockchain structure
DE102018220224.9 2018-11-26

Publications (1)

Publication Number Publication Date
WO2020108702A1 true WO2020108702A1 (en) 2020-06-04

Family

ID=68965588

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2019/101012 WO2020108702A1 (en) 2018-11-26 2019-11-26 Method for generating a linked blockchain structure in an electronic memory

Country Status (2)

Country Link
DE (2) DE102018220224A1 (en)
WO (1) WO2020108702A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020133648A1 (en) * 2000-12-29 2002-09-19 Zarlink Semiconductor Limited Data queue system
WO2016015041A1 (en) * 2014-07-25 2016-01-28 Blockchain Technologies Corporation System and method for creating a multi-branched blockchain with configurable protocol rules
WO2017202757A1 (en) 2016-05-23 2017-11-30 Accenture Global Solutions Limited Distributed key secret for cryptologic rewritable blockchain
US20180018723A1 (en) * 2016-07-18 2018-01-18 Royal Bank Of Canada Distributed ledger platform for vehicle records
WO2018103850A1 (en) * 2016-12-08 2018-06-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for creating a finite blockchain

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7203691B2 (en) * 2002-09-27 2007-04-10 Ncr Corp. System and method for retrieving information from a database
US20070255846A1 (en) * 2006-04-28 2007-11-01 Wee Susie J Distributed storage of media data
US7899800B2 (en) * 2006-08-18 2011-03-01 Isilon Systems, Inc. Systems and methods for providing nonlinear journaling

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020133648A1 (en) * 2000-12-29 2002-09-19 Zarlink Semiconductor Limited Data queue system
WO2016015041A1 (en) * 2014-07-25 2016-01-28 Blockchain Technologies Corporation System and method for creating a multi-branched blockchain with configurable protocol rules
WO2017202757A1 (en) 2016-05-23 2017-11-30 Accenture Global Solutions Limited Distributed key secret for cryptologic rewritable blockchain
US20180018723A1 (en) * 2016-07-18 2018-01-18 Royal Bank Of Canada Distributed ledger platform for vehicle records
WO2018103850A1 (en) * 2016-12-08 2018-06-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for creating a finite blockchain

Also Published As

Publication number Publication date
DE112019005859A5 (en) 2021-08-19
DE102018220224A1 (en) 2020-05-28

Similar Documents

Publication Publication Date Title
DE102014204834A1 (en) Computer-implemented systems and methods for comparing and associating objects
DE102014204830A1 (en) Computer-implemented systems and methods for comparing and associating objects
DE3523237A1 (en) Arrangement for protecting the transportation of chip cards
EP1196902B1 (en) Method for operating a portable data carrier configured for executing reloadable functional programs
EP3552141B1 (en) Server computer system for providing datasets
EP3735650A1 (en) Personal document block chain structure
EP3576001B1 (en) Computer-implemented method for transferring a data string from an application to a data protection device
WO2018122269A1 (en) Bit-sequence-based data classification system
WO2020108702A1 (en) Method for generating a linked blockchain structure in an electronic memory
DE69913152T2 (en) Replace special characters in a data stream
EP3719651A1 (en) Method for characterizing the operating state of a computer system
DE19538448A1 (en) Database management system and data transmission process
DE19962902A1 (en) Device for password-protected handling of an electronic document
EP3686080B1 (en) Method for securely operating a railway engineering system and network node of a data network
WO2018130426A1 (en) Anonymization of a block chain
WO2014029389A1 (en) Method for secured use of transportable data storage media in closed networks
DE60220020T2 (en) BIOMETRIC IDENTIFICATION OR AUTHENTICATION SYSTEM
WO2004017182A2 (en) Accepting a set of data in a computer unit
EP4345723A1 (en) Detecting misused payment transactions
AT410489B (en) ARRANGEMENT FOR CHECKING THE USER AUTHORIZATION FOR DEVICES SECURED BY USER IDS
DE10041514C2 (en) Process for maintaining the confidentiality of user data when it is stored and processed on an operator's central computer
DE102013108309A1 (en) Method for connecting objects in a software application
DE102010010035A1 (en) Method for construction of objects e.g. control box, of object oriented database, involves generating objects with containment relations and single relations, and replacing placeholders by appropriate reciprocal relations
EP2290561B1 (en) Method and device for saving and restoring electronic documents and databases
DE102020127853A1 (en) Method for personalizing an ID document, personalized ID document and method for authenticating a personalized ID document

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: 19823896

Country of ref document: EP

Kind code of ref document: A1

REG Reference to national code

Ref country code: DE

Ref legal event code: R225

Ref document number: 112019005859

Country of ref document: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19823896

Country of ref document: EP

Kind code of ref document: A1