Railway data sharing system based on alliance chain

Abstract

The invention relates to the technical field of data sharing, and discloses a railway data sharing system based on an alliance chain, comprising an alliance chain network comprising a data demander node and a data owner node; the data grading and sharing module is used for dividing the railway data into four grades according to the sensitivity degree; the intelligent contract module is used for storing a content identifier and data element information returned by the interstellar file system through a data intelligent contract, executing attribute strategy verification of second-level data and third-level data through an access control intelligent contract, and managing and sharing incentive integral dynamic adjustment through an incentive intelligent contract; and the interstellar file system is used for storing the encrypted data under the chain. The railway data grading sharing model provided by the invention can realize data security sharing under relatively high efficiency.

Description

Technical Field

[0001] The present invention relates to the technical field of data sharing, and in particular to a railway data sharing system based on an alliance chain. Background Art

[0002] During railway transportation, data sharing and circulation have a significant impact on the operating efficiency and service quality of the transportation system. As the scale of railway transportation business continues to grow, railway data has shown characteristics such as scale, complexity, and diversity. How to achieve efficient sharing and reliable circulation of railway data is the key to promoting the modernization and digital development of the railway industry.

[0003] Railway data includes dynamic information such as train schedules, passenger flow, and freight transportation status, as well as static information such as track maintenance records, vehicle inspection reports, and safety supervision data. Much of this data involves passenger privacy and corporate trade secrets. Effectively managing and sharing this data can significantly improve the operational efficiency of the railway system, reduce delays and accidents caused by information asymmetry, promote cross-organizational cooperation within the railway system and with other means of transportation, and provide passengers with a more convenient and safe service experience.

[0004] Currently, railway data sharing faces two challenges. First, the railway industry suffers from data silos, with much valuable data generated and accumulated by various departments or systems. Lacking unified data standards and trusted exchange pathways, data flow between departments is inefficient, making efficient information integration and utilization difficult. Second, railway data contains sensitive information, posing significant privacy and security risks during its circulation. Unauthorized access, information tampering, and data leaks can compromise business operations, infringe on passenger privacy, and even public safety. Therefore, a new solution is needed to address these issues, improving data sharing efficiency while ensuring data security. Summary of the Invention

[0005] In view of the above-mentioned deficiencies in the prior art, the present invention provides a railway data sharing system based on alliance chain.

[0006] In order to achieve the above-mentioned object of the invention, the technical solution adopted by the present invention is: A railway data sharing system based on alliance chain, including: Consortium chain network, including data demander nodes and data owner nodes; The data hierarchical sharing module is used to classify railway data into four levels according to their sensitivity. The first level of data includes public service information and is stored in plain text in the InterPlanetary File System. The second level of data includes train operation information and is stored in the InterPlanetary File System using attribute-based encryption. The third level of data includes train operation information and is stored in the InterPlanetary File System using proxy re-encryption. The fourth level of data includes railway network security operation information and is stored in the InterPlanetary File System using symmetric encryption and is prohibited from being shared. The smart contract module is used to store the content identifier and data metadata returned by the InterPlanetary File System through the data smart contract, perform attribute policy verification of second-level data and third-level data through the access control smart contract, and manage the dynamic adjustment of shared incentive points through the incentive smart contract; InterPlanetary File System, for storing encrypted data off-chain.

[0007] Furthermore, the first level data includes train schedules, ticket availability, and station floor plan information; The second level of data includes passenger ticket purchase records, train operation status, station passenger flow statistics, train delay cause analysis, and ticketing equipment maintenance information; The third level of data includes train dispatch information, train diagram compilation parameters, freight customer waybills, EMU maintenance records, and transportation safety incident report information; The fourth level of data includes the source code of the train control system, the track circuit parameter configuration table, and the operation log information of the centralized dispatching system.

[0008] Furthermore, the first-level data is uploaded to the InterPlanetary File System by the data owner, and the InterPlanetary File System returns a unique content identifier based on the data content. The data description information and content identifier are then uploaded to the chain through the data smart contract; The data demander then queries the data description information through the data smart contract, selects the data to be downloaded, obtains the data content identifier, and then downloads the corresponding data from the InterPlanetary File System through the content identifier; finally, after the data is downloaded, the data smart contract records the sharing process of the first-level data and uploads the download process to the chain.

[0009] Furthermore, for the second-level data, the data owner submits an application form to apply for data sharing, and the data management staff reviews the application request and reviews it. If the review is passed, the next step is taken; otherwise, the process is terminated. During the initialization phase, the data manager generates a public key and a master key. The data owner then defines an access policy before uploading the data. This policy is then saved in an access control smart contract. The data is then encrypted using the public key and access policy. The encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description returned by the InterPlanetary File System are uploaded to the blockchain via the data smart contract. The data demander submits the user attributes to the data manager, who then returns the attribute-related user private key. The data demander then checks whether the required data is available through the data smart contract. If so, it first determines through the access control contract whether its own attributes meet the access policy of the data. If so, it performs subsequent operations; otherwise, the data download request is rejected. The data demander then downloads the data from the InterPlanetary File System based on the data's content identifier and decrypts it using the attribute-related user private key to obtain the original data. Finally, the download process is recorded on-chain in the data smart contract to achieve traceability.

[0010] Furthermore, for the third level of data, the data owner submits an application form to apply for data sharing, and the data manager reviews the application request and reviews it. If the review is passed, the next step is taken; otherwise, the process is terminated. The data manager initializes the system parameters, and the data owner and data demander generate corresponding public and private keys respectively. The data owner then defines the access policy before uploading the data, and saves the access policy to the access control smart contract. The data is then encrypted with the public key to obtain the first layer of encrypted data. The first layer of encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description information returned by the InterPlanetary File System are uploaded to the chain through the data smart contract. The data demander uses the access control smart contract to check whether its own attributes meet the data access policy. If so, the public key is provided to the data owner. The data owner uses its own private key and the public key provided by the data demander to generate a unique re-encryption key and submit it to the data manager. The data manager then uses the re-encryption key to re-encrypt the first layer of encrypted data, converting the data into data that can only be decrypted by the data demander's private key. The re-encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description information returned by the InterPlanetary File System are uploaded to the chain through the data smart contract. The data demander downloads the data from the Interstellar File System based on the data's content identifier, and uses its own private key to decrypt the data to obtain the original data; finally, the download process is recorded on the chain in the data smart contract to achieve traceability.

[0011] Furthermore, for the fourth level of data, the data owner sets their own key, uses the key to encrypt their own data using a symmetric encryption algorithm, and then uploads the encrypted data to the InterPlanetary File System, and also uploads the content identifier and description information returned by the InterPlanetary File System to the blockchain; When data needs to be used, the data owner downloads the data from the InterPlanetary File System based on the data's content identifier, and then decrypts the data with its own key.

[0012] Furthermore, it also includes a sharing incentive module, which is used to detect contribution-type access behaviors of uploading first-level data, second-level data and third-level data and give sharing incentive points, detect non-contribution-type access behaviors of downloading data without uploading data and deduct sharing incentive points, and adopt an incentive cost strategy to give additional sharing incentive points to the nodes participating in sharing when the proportion of users participating in sharing is lower than the set threshold, and charge sharing cost points to the nodes participating in sharing when the proportion of users participating in sharing is higher than the set threshold.

[0013] Furthermore, the sharing incentive module first constructs a railway data sharing incentive model based on evolutionary game theory, then constructs the profit matrix of the railway data sharing incentive model based on evolutionary game, and finally constructs a replication dynamic equation based on the profit matrix, and performs evolutionary stability strategy analysis based on the replication dynamic equation.

[0014] Furthermore, based on the railway data sharing incentive model of evolutionary game, the profit function of both users participating in data sharing is:

[0015]

[0016] in, is the rate of return of shared incentive points, l is the data sensitivity level parameter, The reward coefficient for the shared incentive points obtained by uploading data, The amount of data uploaded by user P1, is the rate of return of using data, The amount of data uploaded by user P2, The reward coefficient for the shared incentive points obtained by reviewing the data, Incentive cost; The profit function of two users, one of whom participates in data sharing and the other does not, is:

[0017]

[0018] in, is the penalty coefficient for non-contributory access behavior.

[0019] Furthermore, the replication dynamic equation for users choosing to participate in data sharing is:

[0020]

[0021] in, The replication dynamic equation for user P1 to choose to participate in data sharing, The probability of user P1 choosing to participate in data sharing, The replication dynamic equation for user P2 to choose to participate in data sharing, The probability of user P2 choosing to participate in data sharing.

[0022] The present invention has the following beneficial effects: The railway data hierarchical sharing model proposed in this invention can realize data security sharing with higher efficiency, and the proposed incentive mechanism can improve the enthusiasm of internal and external railway departments for data sharing. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 This is a schematic diagram of the structure of a railway data sharing system based on alliance chain in an embodiment of the present invention; Figure 2 This is a diagram of the operation process of the railway data sharing strategy based on the alliance chain in an embodiment of the present invention; Figure 3 This is an overall flow chart of the railway data hierarchical sharing strategy in an embodiment of the present invention; Figure 4 This is a flow chart of L1 data sharing in an embodiment of the present invention; Figure 5 This is a flow chart of L2 data sharing in an embodiment of the present invention; Figure 6 This is a flow chart of L3 data sharing in an embodiment of the present invention; Figure 7 This is a flowchart of L4 data storage in an embodiment of the present invention; Figure 8 This is a diagram showing the railway data sharing incentive principle in an embodiment of the present invention; Figure 9 Schematic diagram of the equilibrium point phase of the railway data sharing game model in an embodiment of the present invention. DETAILED DESCRIPTION

[0024] The specific embodiments of the present invention are described below to facilitate understanding of the present invention by those skilled in the art. However, it should be clear that the present invention is not limited to the scope of the specific embodiments. For those skilled in the art, as long as various changes are within the spirit and scope of the present invention as defined and determined by the appended claims, these changes are obvious, and all inventions and creations utilizing the concepts of the present invention are protected.

[0025] In current railway data sharing scenarios, internal data exchange relies on centralized systems, exposing data to risks of leakage and tampering. External data exchange relies on one-to-one communication channels, which is costly and inefficient. This paper selects a consortium blockchain as the underlying platform, combining technologies such as the Interplanetary File System (IPFS), smart contracts, and cryptography to address the risks of data leakage and tampering. Based on this, a sharing incentive mechanism based on evolutionary game theory is proposed to improve data sharing efficiency and security.

[0026] The innovation of the present invention is mainly reflected in the following two aspects: (1) This paper proposes a hierarchical sharing strategy for railway data. Railway data is divided into four levels, L1-L4, according to its sensitivity and the impact caused by leakage. The challenges faced by railway data include privacy protection, access control, data traceability, and data approval. Based on this, the functions of access control, data traceability, and data approval are realized through smart contract technology; for data of different levels, attribute-based encryption, proxy re-encryption, and symmetric encryption are used to achieve hierarchical data privacy protection; using the InterPlanetary File System, the data is stored off-chain, and the content identifier (CID) returned after storage is stored in the blockchain to improve data sharing efficiency. Finally, based on the requirements of railway data sharing business, hierarchical sharing of internal and external railway data is realized.

[0027] (2) This paper designs a railway data sharing incentive mechanism based on evolutionary game theory. Although there is a hierarchical railway data sharing strategy, the railway department and relevant external organizations may be reluctant to participate in data sharing due to their own interests. To solve this problem, sharing incentive points are introduced as incentives. Users can obtain points after uploading data, but if there is a non-contributory access behavior of "free riding", that is, only downloading data without sharing data, the sharing incentive points will be deducted. Finally, considering that continuous incentives will lead to point inflation, additional points will be awarded in the early stage when users are not very motivated to share, and a certain cost will be charged for data sharing in the middle and late stages. The change in this part of sharing incentive points is called incentive / cost.

[0028] like Figure 1As shown, an embodiment of the present invention provides a railway data sharing system based on a consortium chain, including: Consortium chain network, including data demander nodes and data owner nodes; The data hierarchical sharing module is used to classify railway data into four levels according to their sensitivity. The first level of data includes public service information and is stored in plain text in the InterPlanetary File System. The second level of data includes train operation information and is stored in the InterPlanetary File System using attribute-based encryption. The third level of data includes train operation information and is stored in the InterPlanetary File System using proxy re-encryption. The fourth level of data includes railway network security operation information and is stored in the InterPlanetary File System using symmetric encryption and is prohibited from being shared. The smart contract module is used to store the content identifier and data metadata returned by the InterPlanetary File System through the data smart contract, perform attribute policy verification of second-level data and third-level data through the access control smart contract, and manage the dynamic adjustment of shared incentive points through the incentive smart contract; InterPlanetary File System, for storing encrypted data off-chain.

[0029] This embodiment is based on consortium chain technology, using symmetric encryption, attribute-based encryption and proxy re-encryption technology, and designs sharing strategies for data of different levels. It combines the InterPlanetary File System and smart contract technology to implement data access control and traceability records, thereby achieving efficient and secure data sharing.

[0030] In an optional embodiment of the present invention, within the railway data sharing platform, data from different railway groups accumulates in significant quantities and is dispersed across various departments, leading to data silos. Currently, railway data sharing utilizes centralized servers internally and one-to-one dedicated lines externally. However, this sharing model can lead to data privacy leaks, high sharing costs, and low efficiency. Railway data encompasses a wide range of information, including passenger personal information, train operation dynamics, geographic and geological information, and equipment status information. These data vary in sensitivity and require varying degrees of protection. Referring to the classification rules in the "Data Security Technical Data Classification and Grading Rules" (GB / T 43697-2024), data is categorized into public data (L1), general data (L2), important data (L3), and core data (L4), based on their sensitivity and the potential impact of damage or leakage. The grading rules are shown in Table 1. Different levels of data sharing and protection require different requirements, with each subsequent level strengthening the protection requirements of the previous level.

[0031] Table 1 Railway data classification rules

[0032] Core data refers to critical data directly related to the safe operation of the national railway network, such as train control system source code, track circuit parameter configuration tables, and centralized dispatching system operation logs. Important data primarily includes train timetable compilation parameters, freight customer waybill information, and EMU maintenance records. All data queries require the recording of operator information, time, and equipment number. General data involves operational information such as station passenger flow statistics, train delay analysis, and ticketing equipment maintenance. The processing of this type of data must be filed with the information center. Public data includes public service information such as train timetables, ticket availability, and station floor plans.

[0033] Protecting data privacy is crucial in the data sharing process. The consequences of unauthorized access and use are immeasurable. Privacy protection technology prevents others from accessing raw data during sharing. Only the data requester can decrypt the data using relevant algorithms, effectively maintaining the privacy and security of railway data. Therefore, adopting different privacy protection methods for different levels of data, allowing for hierarchical sharing, combined with consortium blockchain technology, can mitigate various security issues, such as data tampering, collusion attacks, and unauthorized access.

[0034] Railway data sharing can be divided into internal data sharing and external data sharing based on the subject of sharing. Internal data sharing refers to sharing between railway-related enterprises, such as passenger data, freight data, and train scheduling data; external data sharing refers to sharing between railway-related enterprises and external organizations, such as meteorological data, tourism data, and logistics data.

[0035] Railway bureau group companies' systems are mostly deployed vertically, making it difficult to connect data between different levels. Even within railway bureau group companies at the same level, data generated by each railway bureau group company's stations is directly aggregated to the China Railway Corporation, making cross-bureau group company and cross-departmental data difficult to leverage. Furthermore, currently, open data sharing within railways is primarily limited to the railway sector, preventing large-scale data exchange with external railway-related institutions, businesses, and the public, leading to low enthusiasm for sharing.

[0036] Currently, data sharing within the railway group relies on a traditional centralized system architecture, which presents security risks such as tampering and loss during data storage and transmission. Sharing data with external organizations lacks a trusted platform and requires one-to-one dedicated lines, which is both costly and inefficient.

[0037] In order to promote sharing among multiple parties, multiple parties are formed into an alliance through the alliance chain. The tamper-proof nature of the alliance chain is utilized to build a unified data sharing trusted platform, and an incentive mechanism is introduced to promote sharing enthusiasm within and outside the railway and improve data utilization efficiency.

[0038] Data sharing involves many entities, including most railway industry group companies and their subsidiaries, including railway bureaus, stations, data centers, and research institutes. Failure to control access rights for these entities could lead to data misuse. By introducing access control technology, data owners can limit the scope of data requesters, preventing unauthorized misuse.

[0039] After data is shared, data owners may not know which departments have used the shared data, creating a regulatory blind spot. The chain structure and immutability of the consortium blockchain can achieve data traceability and store data usage information on the chain, ensuring data traceability.

[0040] Data must undergo multiple levels of manual approval before it can be shared. For example, when a railway bureau needs to access freight dispatch data from a neighboring bureau, it often requires special approval from senior management. This process is lengthy, non-replicable, and takes a long time on average. By putting the data approval process on-chain in consortium blockchain-based data sharing, the process becomes open and transparent, meeting business needs.

[0041] Based on the analysis of railway data sharing requirements, we can summarize the requirements and corresponding implementation ideas for railway data sharing as shown in Table 2.

[0042] Table 2 Railway data sharing requirements and implementation ideas

[0043] Therefore, a railway data sharing strategy based on alliance chain is designed, such as Figure 2 As shown in the figure, this strategy mainly consists of two parts: a hierarchical railway data sharing strategy and a railway data sharing incentive mechanism. In the hierarchical railway data sharing strategy, relevant privacy protection methods are used, combined with the business needs of fine-grained access control, data auditing, and data traceability, to achieve full-process data sharing from data owners to data demanders, and achieve unified sharing of internal and external data and data at different levels. In the railway data sharing incentive mechanism, based on evolutionary game theory, shared incentive points are introduced as a form of currency in the alliance chain, rewarding users who actively share data and punishing users who "free ride" (downloading data without sharing it), ultimately promoting data sharing among internal and external railway departments.

[0044] Railway data is categorized into four levels, L1-L4, based on its sensitivity and the potential impact of a leak. Data sharing strategies are designed for each data level, taking into account business requirements for access control, data traceability, and data approval. Given the large volume of railway data, storing it directly on the blockchain would be inefficient. Therefore, a hybrid on-chain and off-chain approach is adopted: railway data is stored off-chain in the InterPlanetary File System (IPFS), while the content identifiers returned by the IPFS are stored on-chain. L1 data is public data, accessible to all users, such as high-speed train departure schedules. This level of data requires no privacy protection, leadership approval, or access rights, but data traceability is necessary. L2 data is general data, such as passenger ticket purchase records and train operation status data. This type of data uses attribute-based encryption for privacy protection, but can be accessed through configuration, requires leadership approval, and requires data traceability. The use of attribute-based encryption algorithms enables fine-grained access control. L3 data is important data, such as train dispatch data, transportation safety incident reports, etc. This type of data has high privacy requirements, so it needs to be approved by the National Railway Administration. As a third-party trusted institution, the National Railway Administration uses a proxy re-encryption algorithm for privacy protection, and requires access control and data traceability. L4 data is core data, such as confidential design drawings, railway technology patents involving national security, etc. This type of data is not shared, but can be securely stored using a symmetric encryption algorithm, and only the data owner can access this data. The relevant information of the railway data hierarchical sharing strategy is shown in Table 3, and the overall data sharing process flowchart is shown in Figure 3 shown.

[0045] Table 3 Sharing strategy for L1-L4 level data

[0046] The entities involved in L1 data sharing are as follows: (1) Data owner: This can be a user who needs to share data in the national railway bureau, road bureau, or subordinate units or departments of external institutions that have joined the alliance chain and is responsible for uploading the data they own.

[0047] (2) Data demanders: These can be users who need data from subordinate units or departments of the National Railway Administration, Railway Administration, or external organizations that have joined the alliance chain. They can download data uploaded by the data owner.

[0048] (3) InterPlanetary File System: A distributed file storage system. After data is uploaded to the InterPlanetary File System, a unique content identifier is calculated based on its content. Users need to access the data through this content identifier. The InterPlanetary File System has parallel storage capabilities and can efficiently store large amounts of data, thereby reducing the network burden of the blockchain.

[0049] (4) Data Smart Contract: This smart contract implements data-related logical functions and is responsible for storing data-related information, such as data description information, content identifiers returned by the InterPlanetary File System, and data download records. The logical functions mainly include: uploading data information to the chain, uploading traceability information to the chain, querying data information, and querying traceability information.

[0050] The L1 data sharing process is divided into two parts: data upload and data download. The flow chart is as follows: Figure 4 shown.

[0051] (1) Data upload: The data owner uploads the data to the InterPlanetary File System. The InterPlanetary File System returns a unique content identifier based on the content of the data, and then uploads the data description information (such as data name, upload time, etc.) together with the content identifier to the chain through the data smart contract.

[0052] (2) Data download: The data demander queries the data description information through the data smart contract, selects the data they want to download, and obtains the data content identifier; then downloads the corresponding data from the InterPlanetary File System using the content identifier. After the data is downloaded, the data smart contract records the process and uploads the download process (including user attribute information, timestamp, etc.) to the chain. In this way, the data owner can see who has used their data.

[0053] In addition to the entities involved in L1 data sharing, L2 data sharing also includes the following entities.

[0054] (1) National Railway Administration: The National Railway Administration acts as the attribute authority, responsible for generating the public key and master key used in attribute-based encryption. The public key is public and can be viewed by everyone, while the master key is managed by the attribute authority and is not disclosed to the public. When a user registers, the National Railway Administration generates the user's private key based on the user's attributes and the master key, and sends it to the user through a secure channel.

[0055] (2) Department leaders: They act as data reviewers and review the data upload requests of data owners. Only after the review is passed can the data owner upload the data. They can only review the data sharing requests of their own subordinate departments and cannot review the data sharing requests of other departments.

[0056] (3) Access Control Smart Contract: Logical functions related to access control are implemented in this smart contract. Functions include: storing access control policies, querying access control policies, modifying access control policies, and verifying access control policies (i.e., verifying whether the attributes of the data requester meet the access control policy).

[0057] The L2 data sharing process is divided into three parts: data approval, data upload, and data download. The flow chart is as follows: Figure 5 shown.

[0058] (1) Data review: First, the data owner needs to submit an application form to apply for data sharing. The application request will be reviewed by the leader of the user's unit or department. If the review is passed, the next step can be taken; otherwise, the process will be terminated.

[0059] (2) Data upload: During the initialization phase, the National Railway Administration generates a public key and a master key. Before uploading data, the data owner can define an access policy, which is then saved in the access control smart contract. The data owner then encrypts the data using the public key and access policy, and uploads the encrypted data to the InterPlanetary File System. Finally, the content identifier returned by the InterPlanetary File System, along with the data description, is uploaded to the blockchain through the data smart contract.

[0060] (3) Data download: The data demander gives its own attributes to the National Railway Administration, and the National Railway Administration returns the private key related to its attributes. The data demander uses the data smart contract to check whether the data it needs is available. If so, it first uses the access control contract to determine whether its own attributes meet the access policy of the data. If so, it can proceed with subsequent operations. Otherwise, the data download request will be rejected. The data demander then downloads the data from the Interstellar File System based on the content identifier of the data. The downloaded data is encrypted, and the original data can be obtained after decrypting it with the private key related to the attributes. Finally, the download process (including user attribute information, timestamp, etc.) is recorded on the chain in the data smart contract to achieve traceability.

[0061] The entities involved in L3 data sharing are the same as those in L2 data sharing, so we will not repeat them here. The L3 data sharing process is divided into four parts: data approval, data upload, data re-encryption, and data download. The flow chart is as follows: Figure 6 shown.

[0062] (1) Data approval: This process is similar to the data approval process in L2 data sharing. The difference is that because L3 data has a higher degree of privacy, it is directly reviewed by the National Railway Administration.

[0063] (2) Data upload: The process is similar to L2 data sharing, except that the encryption algorithm is different. First, the National Railway Administration initializes the system parameters, and the data owner and data demander generate their own public and private keys. The data owner generates and encrypts their own data using the public key, obtaining the first layer of encrypted data.

[0064] (3) Data re-encryption: The data demander checks whether its attributes meet the data access policy through the access control contract. If so, it provides the public key to the data owner. The data owner uses its own private key and the data demander's public key to generate a unique re-encryption key and gives it to the National Railway Administration. The National Railway Administration uses the re-encryption key to re-encrypt the first layer of encrypted data. After re-encryption, the data is converted into data that can only be decrypted by the data demander's private key.

[0065] (4) Data download: The data demander downloads the re-encrypted data from the InterPlanetary File System and uses the data after decrypting it with the private key. Finally, the download process (including user attribute information, timestamp, etc.) will be recorded in the data smart contract to achieve traceability.

[0066] Due to its special nature, L4 data cannot be shared, but the system provides a secure storage function for it. The L4 data storage solution process is as follows: Figure 7 As shown in the figure, it is divided into two parts: data upload and data download.

[0067] (1) Data upload: First, the data owner sets a key known only to them and uses this key to encrypt their data using a symmetric encryption algorithm. Since only they know the key required for decryption, others cannot decrypt it. The encrypted data is then uploaded to the InterPlanetary File System, and the data's content identifier and description information are uploaded to the chain.

[0068] (2) Data download: When data is needed, it is downloaded from the InterPlanetary File System and then decrypted using one’s own key. No other party is involved in the entire process, and the data can only be accessed and used by the data owner.

[0069] To summarize, the data hierarchical sharing strategy combines the business needs of access control, data traceability, and data approval to achieve the sharing of data at different levels.

[0070] The hierarchical data sharing strategy proposed in this embodiment uses relevant cryptographic algorithms to achieve privacy protection, including attribute-based encryption, proxy re-encryption, and symmetric encryption. If these algorithms can ensure that only the data requester can decrypt the encrypted data, then the strategy proposed in this embodiment is proven to be secure.

[0071] (1) Security of attribute-based encryption: Attribute-based encryption is an algorithm that encrypts and decrypts data based on access policies and user attributes. Only users whose attributes meet the access policy can decrypt the data. Even if an adversary obtains the system public parameters and the attribute private keys of multiple users, they cannot construct the private key of unauthorized attributes through collusion, and thus cannot decrypt the target data. Therefore, attribute-based encryption is also resistant to collusion attacks. In the strategy proposed in this embodiment, the private key of the data demander is provided by the National Railway Administration. Only when the data demander's attributes meet the access policy can decryption be performed.

[0072] (2) Security of proxy re-encryption: Proxy re-encryption is a technology that allows a third-party semi-trusted organization to re-encrypt data without decrypting it. Even if an adversary controls the third-party semi-trusted organization, they cannot reverse-derive the data owner's private key or original data from the re-encryption key. In addition, even if the third-party semi-trusted organization and the data demander collude, they cannot derive the data owner's private key and original data. Therefore, proxy re-encryption is also resistant to collusion attacks. In this strategy, the National Railway Administration provides re-encryption services as a third-party semi-trusted organization. The National Railway Administration cannot obtain the original data, and only the data demander can decrypt the re-encrypted data.

[0073] (3) Security of symmetric encryption: Symmetric encryption algorithms use the same key for data encryption and decryption. An adversary cannot obtain any original data information or key information from the encrypted data. In this strategy, the key is known only to the data owner, so only the data owner can encrypt and decrypt the data.

[0074] In summary, attribute-based encryption, proxy re-encryption, and symmetric encryption can all achieve effective privacy protection, ensuring that only qualified users can decrypt the encrypted data.

[0075] In an optional embodiment of the present invention, a railway data sharing system based on an alliance chain provided by an embodiment of the present invention further includes a sharing incentive module, which is used to detect contribution-type access behaviors of uploading first-level data, second-level data and third-level data and give sharing incentive points, detect non-contributory access behaviors of downloading data without uploading data and deduct sharing incentive points, and adopt an incentive cost strategy to give additional sharing incentive points to the nodes participating in sharing when the proportion of users participating in sharing is lower than a set threshold, and charge sharing cost points to the nodes participating in sharing when the proportion of users participating in sharing is higher than the set threshold.

[0076] In this example, evolutionary game theory combines Darwin's theory of biological evolution with game theory and assumes bounded rationality among participants. Bounded rationality refers to the limited cognitive and computational capabilities of participants, who rely on learning, imitation, and trial and error in different environments, dynamically adjusting their strategies in this process to find the optimal strategy. In the railway data sharing scenario, railway departments and related external organizations exhibit bounded rationality. Due to their own self-interest, they may be less willing to share data and may not participate.

[0077] The data sharing process can be viewed as an evolutionary game process. By introducing a reward and punishment mechanism and using sharing incentive points as rewards, the railway data sharing incentive principle diagram is designed as follows: Figure 8 As shown in the figure. User data uploads are the primary source of sharing incentive points, and each upload earns a certain number of sharing incentive points as a reward. Users who engage in "free riding" behavior, downloading others' data without actively sharing their own, will be penalized by having certain sharing incentive points deducted. The incentive / cost ratio is a dynamic design. Initially, additional rewards are offered to boost user enthusiasm for sharing. Later, as more users share, additional incentives are eliminated to prevent point inflation, and a fixed cost of sharing incentive points is charged. Users who earn sharing incentive points can benefit from points monetization, data exchange, reputation enhancement, unlocking more data access rights, and access to high-speed data sharing channels.

[0078] The ultimate goal of the incentive mechanism is to build a trust relationship between railway departments and between railway departments and external institutions, so that each user can dynamically adjust their decisions under incentives and ultimately make the decision to participate in data sharing.

[0079] We now construct a railway data sharing incentive model based on evolutionary game theory. For convenience, we assume that all uploaded data can be reviewed and approved by department heads. The parameter symbols involved in the railway data sharing incentive model are shown in Table 4.

[0080] Table 4 Symbols and meanings of railway data sharing incentive model

[0081] Consider the following: 1. Strategy selection: Each railway department and related external organizations are bounded rational entities. They will choose the strategy that maximizes their own interests. The strategies they can choose include participating in data sharing and not participating in data sharing, and they have the same strategy selection set. Therefore, the strategy selection space is {participate in data sharing, do not participate in data sharing}. Indicates the participants P 1Probability of participating in sharing, For participants P 2The probability of participating in sharing, then for P 1 is the probability of not participating in data sharing, then for P 2 The probability of not participating in data sharing. x, y ∈[0, 1].

[0082] 2. Benefits from shared incentive points: Shared incentive points are a form of points, which are mainly obtained by participating in data sharing. Shared incentive points will bring indirect benefits to users. Let the shared incentive point rate of return be , then, if the number of shared incentive points held by the user is N , then the benefits of sharing incentive points are .

[0083] 3. Data upload income: Participants who upload data will receive a certain amount of shared incentive points, which are related to the uploaded data. P i The amount of data uploaded is D i , the sensitivity level parameter is l Since data sensitivity includes 4 levels: L1, L2, L3, and L4, and L4 level data does not participate in data sharing, l ∈{ l 1, l 2, l 3}, where l 1, l 2, l 3 represents the sensitivity level parameters of L1, L2, and L3 data respectively. Assume that the shared incentive points reward coefficient of the data upload process is , then the shared incentive points obtained by uploading data can be expressed as , the indirect benefit of uploading data is .

[0084] 4. Data upload cost: Since data needs to be reviewed by department leaders, if department leaders review for free, this will reduce the efficiency of the review and lead to slow data sharing. Therefore, a portion of the sharing incentive points obtained when uploading data will be deducted as review incentives. This value is also related to the data volume. Suppose the shared incentive points coefficient deducted by data review is , then the shared incentive points deducted by data audit can be expressed as The indirect cost of the audit is .

[0085] 5. Data download income: After downloading data uploaded by other departments, you can obtain direct income by using the data or exploring the potential value of the data. It should be noted that the above 1-4 points are discussing the changes in income indirectly caused by the change of shared incentive points, and the income obtained from downloading data has nothing to do with shared incentive points. Assume that the shared data downloaded is The rate of return of the data is , then the revenue of data downloading can be expressed as .

[0086] 6. Penalty factor: Some railway departments may engage in "free riding" behavior, that is, they only download data from other departments to obtain benefits without actively sharing data. A penalty coefficient is introduced to address this situation. , and deduct the illegal railway departments The shared incentive points will eventually result in a loss of .

[0087] 7. Incentives / Costs: Considering that users are not very willing to share in the early stages, nodes participating in sharing will be given additional sharing incentive points. I , to encourage users to share data. When the proportion of users participating in sharing increases, continuously giving additional incentives will lead to inflation of sharing incentive points, so the incentive I It becomes the cost of sharing data. I is the incentive / cost. The change in revenue caused by this part is , here is the initial I <0 means the change in earnings is positive. I >0 indicates a negative change in returns.

[0088] Next, we construct the profit matrix of the railway data sharing incentive model based on evolutionary game. P 1 and P 2. There are three situations in the game between them.

[0089] Case 1: P 1 and P 2 Both parties participate in sharing. Both parties in the game will gain benefits from data uploading and downloading, but will pay a certain cost for uploading data. P 1 and P The profit function of 2 is:

[0090]

[0091] in, is the rate of return of shared incentive points, is the data sensitivity level parameter, The reward coefficient for the shared incentive points obtained by uploading data, The amount of data uploaded by user P1, is the rate of return of using data, The amount of data uploaded by user P2, The reward coefficient for the shared incentive points obtained by reviewing the data, Incentive cost; Case 2: P 1 and P 2 One participates in data sharing, and the other does not. P 1 participation, P 2 does not participate as an example, P 1 can get the income from data upload, but cannot get the income from data download, because P 2 No data uploaded. P 1 also needs to pay the cost of uploading data. Therefore, P The profit function of 1 is

[0092] P 2. No data uploading benefits are obtained, and no data uploading costs need to be paid. If there is no free-riding behavior, there is no data downloading benefit and no penalty, and the profit function is 0. Here, considering the free-riding behavior, the data downloading benefit can be obtained, and at the same time, it is punished. The profit function is:

[0093] in, is the penalty coefficient for non-contributory access behavior.

[0094] Case 3: P 1 and P 2. If neither party participates in data sharing, there will be no data available for download in the network, and there will be no data download income, nor data upload income. P 1 and P The profit function of 2 is 0.

[0095] In summary, the benefit matrix of railway data sharing incentive based on evolutionary game can be obtained as shown in Table 3-5, where the cells above are P 1's income, below is P 2 of income.

[0096] Table 5 Evolutionary game payoff matrix of railway data sharing

[0097] Next, we analyze the evolutionary stable strategy.x , y Participants P 1, P 2. The probability of participating in the sharing. As the game progresses, participants will dynamically adjust their strategies, so x , y is a function of time. P 1 The expected benefit of choosing to participate in data sharing is:

[0098] The expected benefit of choosing not to share data is:

[0099] The average return is therefore:

[0100] The replication dynamics equation is used in evolutionary games to describe the dynamic process of the frequency evolution of different strategies in a population over time. Here, x That is, the frequency of choosing to participate in sharing, the replication dynamic equation is:

[0101] make .

[0102] Similarly, P 2 The expected benefits of participating in data sharing are:

[0103] The expected benefit of choosing not to participate in data sharing is:

[0104] The average return is:

[0105] The copied dynamic equation is:

[0106] make .

[0107] make , we can see that the model has 5 local equilibrium points, namely: (0, 0), (0, 1), (1,0), (1, 1), ( x* , y* ).in, , .because x , y ∈[0, 1], so we have , . And you can get, , , , .

[0108] This model is a 2x2 symmetric game. If the Jacobian matrix trace of the internal equilibrium point is negative and the determinant is positive, the point is an evolutionarily stable strategy. The Jacobian matrix of this model is:

[0109] According to the above-mentioned method for determining the evolutionary stable strategy, the stability analysis results of the five equilibrium points are shown in Table 6.

[0110] Table 6 Analysis results of the stable state of railway data sharing game evolution

[0111] The phase diagram of the equilibrium point is as follows Figure 9 As shown in Figure 2. It can be seen that (0, 0) and (1, 1) are two stable strategy points in the evolution, and the system will evolve towards these two points. ( x* , y* ) is a saddle point, (0, 1) and (1, 0) are unstable points. These points divide the space into two parts: ABCP and APCO. When the initial state of the system ( x 0, y 0) is in the ABCP area, the model will evolve to point B, that is, all railway departments participate in data sharing; when ( x 0, y 0) When it is in the APCO area, the model will evolve to point O, that is, all railway departments do not share data. In order to make the model converge to point B, the area of ​​ABCP area needs to be as large as possible, so that ( x 0, y 0) is more likely to be in ABCP, so we need to make ( x *, y *) The closer to the origin O, the more I 、 l 、 α 、 β 、 δ To implement.

[0112] In terms of implementing the incentive mechanism, an incentive mechanism smart contract is written to implement the functions of uploading data rewards, "free-riding" behavior penalties, and additional incentives / costs. Since performing complex mathematical operations in smart contracts will increase the overhead of the blockchain, the relevant calculations are performed off-chain. The smart contract mainly records and manages the shared incentive points on the chain. The smart contract will record the data sharing activity of each railway department in the system, from which the incentives / costs can be calculated. I On this basis, users who upload data will be rewarded and users who "free ride" will be punished.

[0113] In the railway data hierarchical sharing strategy of the present invention, data is divided into four levels, L1-L4, according to relevant standards. L1 data is public data, and the data is stored in the interstellar file system off-chain, and then the data identifier is uploaded to the chain; L2 data uses an attribute-based encryption algorithm based on L1 to protect privacy while achieving fine-grained access control; L3 data uses a proxy re-encryption algorithm, and the National Railway Administration re-encrypts the data to further protect data privacy; L4 is core data, which is not shared and is stored in the interstellar file system using a symmetric algorithm for personal use by users. Then, in order to address the problem of internal and external departments of the railway not actively sharing data, an incentive mechanism is designed based on evolutionary game theory, and data upload incentives, free-rider penalties, and incentives / costs are introduced into the model to conduct an evolutionary strategy stability analysis. Experimental results show that the railway data hierarchical sharing model proposed by the present invention can achieve data security sharing with high efficiency, and the proposed incentive mechanism can improve the enthusiasm of internal and external departments of the railway for data sharing.

[0114] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0115] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1The function specified in one or more boxes.

[0116] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 The steps for the function specified in one or more boxes.

[0117] Specific embodiments are used in the present invention to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core ideas. At the same time, for those skilled in the art, according to the ideas of the present invention, there may be changes in the specific implementation methods and application scopes. In summary, the contents of this specification should not be understood as limiting the present invention.

[0118] Those skilled in the art will appreciate that the embodiments described herein are intended to help readers understand the principles of the present invention, and it should be understood that the scope of protection of the present invention is not limited to such specific descriptions and embodiments. Those skilled in the art can make various other specific variations and combinations based on the technical teachings disclosed in the present invention without departing from the essence of the present invention, and such variations and combinations are still within the scope of protection of the present invention.

Claims

1. A railway data sharing system based on alliance chain, characterized by: include: Consortium chain network, including data demander nodes and data owner nodes; The data hierarchical sharing module is used to classify railway data into four levels according to their sensitivity. The first level of data includes public service information and is stored in plain text in the InterPlanetary File System. The second level of data includes train operation information and is stored in the InterPlanetary File System using attribute-based encryption. The third level of data includes train operation information and is stored in the InterPlanetary File System using proxy re-encryption. The fourth level of data includes railway network security operation information and is stored in the InterPlanetary File System using symmetric encryption and is prohibited from being shared. The smart contract module is used to store the content identifier and data metadata returned by the InterPlanetary File System through the data smart contract, perform attribute policy verification of second-level data and third-level data through the access control smart contract, and manage the dynamic adjustment of shared incentive points through the incentive smart contract; InterPlanetary File System, for storing encrypted data off-chain.

2. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: The first level of data includes train schedules, ticket availability, and station floor plan information; The second level of data includes passenger ticket purchase records, train operation status, station passenger flow statistics, train delay cause analysis, and ticketing equipment maintenance information; The third level of data includes train dispatch information, train diagram compilation parameters, freight customer waybills, EMU maintenance records, and transportation safety incident report information; The fourth level of data includes the source code of the train control system, the track circuit parameter configuration table, and the operation log information of the centralized dispatching system.

3. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: First-level data is uploaded to the InterPlanetary File System by the data owner, and the InterPlanetary File System returns a unique content identifier based on the data content. The data description information and content identifier are then uploaded to the chain through the data smart contract; The data demander then queries the data description information through the data smart contract, selects the data to be downloaded, obtains the data content identifier, and then downloads the corresponding data from the InterPlanetary File System through the content identifier; finally, after the data is downloaded, the data smart contract records the sharing process of the first-level data and uploads the download process to the chain.

4. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: For the second level of data, the data owner submits an application form to apply for data sharing. The data management staff will then review the application request and review it. If the review is passed, the next step will be taken; otherwise, the process will be terminated. During the initialization phase, the data manager generates a public key and a master key. The data owner then defines an access policy before uploading the data. This policy is then saved in an access control smart contract. The data is then encrypted using the public key and access policy. The encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description returned by the InterPlanetary File System are uploaded to the blockchain via the data smart contract. The data demander submits the user attributes to the data manager, who then returns the attribute-related user private key. The data demander then checks whether the required data is available through the data smart contract. If so, it first determines through the access control contract whether its own attributes meet the access policy of the data. If so, it performs subsequent operations; otherwise, the data download request is rejected. The data demander then downloads the data from the InterPlanetary File System based on the data's content identifier and decrypts it using the attribute-related user private key to obtain the original data. Finally, the download process is recorded on-chain in the data smart contract to achieve traceability.

5. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: For the third level of data, the data owner submits an application form to apply for data sharing, and the data manager reviews the application request and reviews it. If the review is passed, the next step will be taken; otherwise, the process will be terminated. The data manager initializes the system parameters, and the data owner and data demander generate corresponding public and private keys respectively. The data owner then defines the access policy before uploading the data, and saves the access policy to the access control smart contract. The data is then encrypted with the public key to obtain the first layer of encrypted data. The first layer of encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description information returned by the InterPlanetary File System are uploaded to the chain through the data smart contract. The data demander uses the access control smart contract to check whether its own attributes meet the data access policy. If so, the public key is provided to the data owner. The data owner uses its own private key and the public key provided by the data demander to generate a unique re-encryption key and submit it to the data manager. The data manager then uses the re-encryption key to re-encrypt the first layer of encrypted data, converting the data into data that can only be decrypted by the data demander's private key. The re-encrypted data is then uploaded to the InterPlanetary File System. Finally, the content identifier and data description information returned by the InterPlanetary File System are uploaded to the chain through the data smart contract. The data demander downloads the data from the Interstellar File System based on the data's content identifier, and decrypts it using the user's own private key to obtain the original data; finally, the download process is recorded on the chain in the data smart contract to achieve traceability.

6. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: For level 4 data, the data owner sets their own key, uses the key to encrypt their own data using a symmetric encryption algorithm, and then uploads the encrypted data to the InterPlanetary File System, and also uploads the content identifier and description information returned by the InterPlanetary File System to the chain; When data needs to be used, the data owner downloads the data from the InterPlanetary File System based on the data's content identifier, and then decrypts the data with its own key.

7. The railway data sharing system based on alliance chain according to claim 1 is characterized in that: It also includes a sharing incentive module, which is used to detect contribution-type access behaviors of uploading first-level data, second-level data and third-level data and give sharing incentive points, detect non-contribution-type access behaviors of downloading data without uploading data and deduct sharing incentive points, and adopt an incentive cost strategy to give additional sharing incentive points to the nodes participating in sharing when the proportion of users participating in sharing is lower than the set threshold, and charge sharing cost points to the nodes participating in sharing when the proportion of users participating in sharing is higher than the set threshold.

8. The railway data sharing system based on alliance chain according to claim 7 is characterized in that: The sharing incentive module first constructs a railway data sharing incentive model based on evolutionary game theory, then constructs the payoff matrix of the railway data sharing incentive model based on evolutionary game, and finally constructs a replication dynamic equation based on the payoff matrix, and performs evolutionary stability strategy analysis based on the replication dynamic equation.

9. The railway data sharing system based on alliance chain according to claim 8 is characterized in that: Based on the railway data sharing incentive model of evolutionary game, the revenue function of both users participating in data sharing is: in, is the rate of return of shared incentive points, is the data sensitivity level parameter, The reward coefficient for the shared incentive points obtained by uploading data, The amount of data uploaded by user P1, is the rate of return of using data, The amount of data uploaded by user P2, The reward coefficient for the shared incentive points obtained by reviewing the data, Incentive cost; The profit function of two users, one of whom participates in data sharing and the other does not, is: in, is the penalty coefficient for non-contributory access behavior.

10. A railway data sharing system based on alliance chain according to claim 9, characterized in that: The replication dynamic equation for users choosing to participate in data sharing is: in, The replication dynamic equation for user P1 to choose to participate in data sharing, The probability of user P1 choosing to participate in data sharing, The replication dynamic equation for user P2 to choose to participate in data sharing, The probability of user P2 choosing to participate in data sharing.

Images