Electronic reader data sharing method based on block chain

Through the blockchain-based encryption mechanism and the secure identification of deep learning models, combined with the use of temporary session keys, the problem of low security in electronic reader data sharing is solved, and efficient data privacy protection and security protection is achieved.

CN119088883AInactive Publication Date: 2024-12-06HAITIANDI DIGITAL TECH (BEIJING) CO LTD +1
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411578113.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-07
Publication Date
2024-12-06
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The existing e-reader data sharing methods have low security problems, especially during the sharing process, which makes it difficult to effectively ensure the privacy and security of data.

Method used

Using a blockchain-based data sharing method, the encryption and decryption mechanism between the data holder and the data requester is used to combine the deep learning model to securely identify network features, ensure behavioral security, and use temporary session key pairs. Data is transmitted encrypted to ensure the privacy and security of the data.

Benefits of technology

Effectively improves the security of the data sharing process of e-reader, prevents unauthorized data access and leakage, ensures that only registered data holders and requesters can know and access the key data of the e-reader, and realizes privacy search and behavioral monitoring.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119088883A_ABST
    Figure CN119088883A_ABST
Patent Text Reader

Abstract

The invention discloses an electronic reader data sharing method based on a block chain, and belongs to the technical field of data processing, the characteristic that the block chain cannot be tampered is adopted, key phrases are encrypted through a system public key, and therefore privacy search is achieved. Other people cannot know the key data of the electronic reader and cannot realize search, so that the security of the electronic reader in the data sharing process can be effectively improved, and meanwhile, after the data sharing task is triggered, the security of the electronic reader in the data sharing process can be further guaranteed by monitoring the behavior security.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of data processing, and in particular relates to an electronic reader data sharing method based on blockchain. Background Art

[0002] An e-book is a digitized book that generally stores text content in electronic text or image format for people to read on electronic display devices. With the development of the information industry, the increasing popularity of electronic devices and the Internet, e-books have gradually become an indispensable part of people's lives as a substitute for traditional paper books, and have even gradually replaced traditional reading methods. With the promotion of high-speed broadband services of the Internet and 3G / 4G networks, the use environment of smart mobile terminals has become more and more convenient, so the demand for reading e-books on the Internet and smart mobile terminals has also increased. With the popularization of e-readers, users' demand for reading resources is growing. However, the existing e-reader data sharing method has the problem of low security. Summary of the invention

[0003] The present invention provides an electronic reader data sharing method based on blockchain, which is used to solve the technical problem of low security in the sharing process existing in the prior art.

[0004] A blockchain-based electronic reader data sharing method, comprising: The data holder generates an association between the keyword group and the e-book reader data, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted keyword group to the blockchain for storage; The data requester generates a data query request, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server. At the same time, the data server collects the network characteristics of the data requester during the data request process; The data server identifies the network features in the data request process in real time to determine the behavior safety, and ends the sharing process when the behavior safety is unsafe; and continues the sharing process when the behavior safety is safe; The data query request is matched in the blockchain by the data server to determine the target keyword group and the target data holder, and the target keyword group is transmitted to the corresponding target data holder; According to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server; The encrypted target e-book reader data is transmitted to the data requester through the data server, and the data requester publishes its own public key to the blockchain; The data holder obtains the public key of the data requester in the blockchain, encrypts the temporary session private key in the temporary session key pair using the public key of the data requester, and forwards the encrypted temporary session private key to the data requester through the data server to complete the sharing of the e-book reader data.

[0005] In a possible implementation, a data holder generates an association relationship between a keyword group and e-book reader data, and uses a system public key of a data server to encrypt the keyword group, and transmits the encrypted keyword group to a blockchain for storage, including: Generate a system public key and a system private key corresponding to the system public key through a data server, and publish the system private key in the blockchain; Generate associations between keyword groups and e-book reader data through data holders; The data holder queries the system public key in the blockchain, and encrypts the keywords in the keyword group stored in the data holder one by one through the system public key to obtain the encrypted keyword group; wherein the keyword group at least includes the subject name of the e-book reader data; The encrypted keyword group is transmitted to the blockchain for storage.

[0006] In a possible implementation, a data requester generates a data query request, and uses a system public key of a data server to encrypt a keyword group, transmits the encrypted data query request to a data server, and collects network features of the data requester in the process of requesting data through the data server, including: A data query request is generated by a data requester; wherein the data query request includes at least one keyword; The data requester queries the system public key in the blockchain, uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server; After the data server receives the data query request, the data server also collects the network characteristics of the data requester during the data request process.

[0007] In a possible implementation, the network features in the data request process are identified in real time by the data server to determine the behavior security, including: The network features in the data request process are identified through the security identification model pre-deployed on the data server to obtain behavioral security.

[0008] In a possible implementation, the method for pre-deploying the security identification model includes: A deep learning model is used to build a security identification model, and the model parameters of the security identification model are initialized to obtain individuals, and multiple different individuals are repeatedly obtained; Obtain the fitness value corresponding to each individual, and determine the optimal individual according to the fitness value corresponding to each individual; According to the optimal individual, performing global adaptive guided update on all individuals to obtain individuals after global adaptive guided update; For the individuals after global adaptive guidance update, all individuals are subjected to neighborhood adaptive guidance update to obtain individuals after neighborhood adaptive guidance update; For the individuals after the neighborhood adaptive guided update, all individuals are subjected to random adaptive guided update to obtain individuals after the random adaptive guided update; The optimal individual is re-determined with the individual after the random adaptive guidance update, and before the maximum number of updates is reached, the step of global adaptive guidance update is returned until the maximum number of updates is reached, and the model parameters contained in the optimal individual are used as the final parameters of the security identification model to achieve the pre-deployment of the security identification model.

[0009] In a possible implementation, according to the optimal individual, all individuals are globally adaptively guided and updated, and the individuals after the global adaptive guidance and update are obtained as follows:

[0010]

[0011] in, Indicates the first i Individuals, i =1,2,…,H, H represents the total number of individuals, represents the individual after global adaptive guidance update , represents the first random number between (0,1), represents the second random number between (0,1), represents the adaptive step size in the t+1th update process; Indicates individual is the center, the reference position within the neighborhood; Indicates the reference position With individuals The Euclidean distance between the two; the radius of the neighborhood is set to R. When the distance between them is less than R, it is considered that the individual within the neighborhood of; , Represents an individual The first k Neighborhood individuals, M represents the total number of neighborhood individuals, represents the optimal individual, The optimal individual With individuals The Euclidean distance between represents the step size adjustment factor, and T represents the maximum number of training times.

[0012] In a possible implementation, for the individuals after the global adaptive guidance update, the neighborhood adaptive guidance update is performed on all individuals, and the individuals after the neighborhood adaptive guidance update are obtained as follows:

[0013] in, Indicates n individuals after global adaptive guidance update, n =1,2,…,H, represents the third random number between (0,1), represents the fourth random number between (0,1), Represents an individual The optimal neighbor individual with the largest fitness value in the neighborhood of represents the best neighbor individual With individuals The Euclidean distance of represents the individual after the neighborhood adaptive guided update .

[0014] In a possible implementation, for individuals after neighborhood adaptive guidance update, performing random adaptive guidance update on all individuals to obtain individuals after random adaptive guidance update includes: For the individuals after the neighborhood adaptive guided update, random adaptive guided update is performed on the individuals to determine the update value:

[0015]

[0016]

[0017] in, Indicates m The individuals after the neighborhood adaptive guidance update, m =1,2,…,H, represents the fifth random number between (0,1), represents the sixth random number between (0,1), represents the first random individual, represents the second random individual, and , as well as Different from each other, represents the adaptive guidance factor, represents the initial value corresponding to the adaptive guidance factor, represents a natural constant, represents the position influence factor, represents the maximum value of the position influence factor, represents the minimum value of the position influence factor, Represents an individual The fitness value of represents the minimum fitness value among all individuals after the neighborhood adaptive guided update, represents the average fitness value of individuals after all neighborhood adaptive guided updates, Represents an individual The corresponding updated value; Determine the update value Whether the fitness value of increases, if so, accept the random adaptive guided update and obtain the individual after the random adaptive guided update, otherwise directly replace the individual as individuals after random adaptive bootstrap updates.

[0018] In a possible implementation, the data server matches the data query request in the blockchain to determine a target keyword group and a target data holder, and transmits the target keyword group to the corresponding target data holder, including: The data query request is matched in the blockchain by the data server, and the N keyword groups with the highest similarity to the data query request are queried to obtain the target keyword group and the target data holder corresponding to the target keyword group; Transmitting the subject name of the e-book reader data in the target keyword group to the data requester to obtain a determination instruction of the data request method; wherein the determination instruction is used to represent a selection instruction of the target subject name; Parse the determined instruction of the data request method to obtain the target subject name; The target keyword group corresponding to the target subject name is transmitted to the corresponding target data holder.

[0019] In a possible implementation, according to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server, including: According to the association between the keyword group and the e-book reader data, the target e-book reader data is determined through the target data holder; Generate a temporary session key pair by using an asymmetric encryption algorithm through the target data holder; wherein the temporary session key pair includes a temporary session public key and a temporary session private key; After encrypting the target e-book reader data corresponding to the target keyword group by using the temporary session public key, the encrypted target e-book reader number is obtained; The target e-book reader number is uploaded to a data server.

[0020] The present invention provides an electronic reader data sharing method based on blockchain, which utilizes the tamper-proof characteristic of blockchain and encrypts key words through a system public key, thereby realizing private search. Except for the registered data holder and the data requester, other people cannot know the key data of the electronic reader and cannot realize search, which can effectively improve the security of the electronic reader data sharing process. At the same time, after the data sharing task is triggered, the security of the electronic reader data sharing process can be further guaranteed by monitoring the behavior security. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and, together with the description, serve to explain the principles of the invention.

[0022] Figure 1 A flowchart of a blockchain-based electronic reader data sharing method provided in an embodiment of the present invention.

[0023] The above drawings have shown clear embodiments of the present invention, which will be described in more detail below. These drawings and text descriptions are not intended to limit the scope of the present invention in any way, but to illustrate the concept of the present invention for those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0024] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Instead, they are merely examples of devices and methods consistent with some aspects of the present invention as detailed in the appended claims.

[0025] The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0026] In order to facilitate those skilled in the art to understand the technical solutions described in the embodiments of the present invention more conveniently, the architecture involved is introduced below.

[0027] It may include data holders, data requesters, data servers and blockchains. Data holders, data requesters and data servers may all access the blockchain, but data holders and data requesters cannot interact directly and can only communicate indirectly through the data server, thereby effectively controlling the security of the data sharing process of the e-book reader.

[0028] like Figure 1 As shown, an embodiment of the present invention provides an electronic reader data sharing method based on blockchain, comprising: S101, generating an association relationship between a keyword group and e-book reader data through a data holder, encrypting the keyword group using a system public key of a data server, and transmitting the encrypted keyword group to a blockchain for storage; The keyword group must include the subject name of the e-book reader data, and may also include multiple keywords of the e-book reader data. There is a corresponding association relationship between the keyword group and the e-book reader data, so that data search can be achieved.

[0029] By using the system public key of the data server to encrypt the keyword group, unreadable encrypted data is formed. This data can be matched with data encrypted with the system public key, and only the data server can view it in plain text, thus effectively avoiding resource leakage.

[0030] S102, a data requester generates a data query request, and uses a system public key of a data server to encrypt a keyword group, transmits the encrypted data query request to a data server, and collects network features of the data requester in the process of requesting data through the data server; The data query request may be a subject name or a combination of multiple keywords. By matching the corresponding keyword group with the data query request, the required data can be found based on the corresponding association between the keyword group and the e-book reader data.

[0031] In order to further ensure the security during data sharing, the embodiment of the present invention collects network characteristics, which may be network traffic characteristics. By identifying network traffic characteristics, it is possible to effectively monitor whether the operations of the data requester are compliant, thereby avoiding network intrusion.

[0032] S103, identifying the network features in the data request process in real time through the data server to determine the behavior security, and ending the sharing process when the behavior security is unsafe; and continuing the sharing process when the behavior security is safe; The deep learning model can be used to pre-learn the relationship between network traffic features and corresponding behavioral security, so as to form rules that can identify data. For example, the network traffic features when the network is normal can be collected. Since the network is normal at this time, the behavioral security is safe; at the same time, the network traffic features when the network is abnormal can be collected. Since the network is abnormal at this time, the behavioral security is unsafe. After pre-learning these data through the deep learning model, the behavioral security detection can be realized.

[0033] S104, matching the data query request in the blockchain by the data server to determine the target keyword group and the target data holder, and transmitting the target keyword group to the corresponding target data holder; The data query request can be matched by a keyword similarity matching method to determine the target keyword group and the target data holder.

[0034] S105, according to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server; During each data sharing process of an e-book reader, a temporary session key pair is generated, thus forming a dynamic data security protection mechanism, which can effectively improve the security of the data sharing process.

[0035] S106, transmitting the encrypted target e-book reader data to the data requester through the data server, and publishing the data requester's own public key to the blockchain; The encrypted target e-book reader data is transmitted to the data requester through the data server. The data requester cannot view the data directly and needs the temporary session private key of the data holder. Therefore, the data holder can put its own public key into the blockchain and transmit the message of the received data to the data server, so that the data holder can obtain the public key of the data requester in the blockchain and transmit the temporary session private key through the public key of the data requester.

[0036] S107. Obtain the public key of the data requester in the blockchain through the data holder, encrypt the temporary session private key in the temporary session key pair using the public key of the data requester, and forward the encrypted temporary session private key to the data requester through the data server to complete the sharing of the e-book reader data.

[0037] The present invention provides an electronic reader data sharing method based on blockchain, which utilizes the tamper-proof characteristic of blockchain and encrypts key words through a system public key, thereby realizing private search. Except for the registered data holder and the data requester, other people cannot know the key data of the electronic reader and cannot realize search, which can effectively improve the security of the electronic reader data sharing process. At the same time, after the data sharing task is triggered, the security of the electronic reader data sharing process can be further guaranteed by monitoring the behavior security.

[0038] In a possible implementation, a data holder generates an association relationship between a keyword group and e-book reader data, and uses a system public key of a data server to encrypt the keyword group, and transmits the encrypted keyword group to a blockchain for storage, including: Generate a system public key and a system private key corresponding to the system public key through a data server, and publish the system private key in the blockchain; Generate associations between keyword groups and e-book reader data through data holders; The data holder queries the system public key in the blockchain, and encrypts the keywords in the keyword group stored in the data holder one by one through the system public key to obtain the encrypted keyword group; wherein the keyword group at least includes the subject name of the e-book reader data; The encrypted keyword group is transmitted to the blockchain for storage.

[0039] In a possible implementation, a data requester generates a data query request, and uses a system public key of a data server to encrypt a keyword group, transmits the encrypted data query request to a data server, and collects network features of the data requester in the process of requesting data through the data server, including: A data query request is generated by a data requester; wherein the data query request includes at least one keyword; The data requester queries the system public key in the blockchain, uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server; After the data server receives the data query request, the data server also collects the network characteristics of the data requester during the data request process.

[0040] In a possible implementation, the network features in the data request process are identified in real time by the data server to determine the behavior security, including: The network features in the data request process are identified through the security identification model pre-deployed on the data server to obtain behavioral security.

[0041] In the prior art, deep learning models are often optimized through intelligent optimization algorithms such as gradient descent and particle swarm optimization, which easily leads to local optimality, and ultimately leads to poor recognition ability of the security recognition model. Therefore, the embodiment of the present invention proposes a pre-deployment method to solve the technical problems existing in the prior art.

[0042] In a possible implementation, the method for pre-deploying the security identification model includes: A deep learning model is used to build a security identification model, and the model parameters of the security identification model are initialized to obtain individuals, and multiple different individuals are repeatedly obtained; Using a deep learning model to construct a security identification model can include: using a deep learning model such as a convolutional neural network to construct a security identification model, and at the same time initializing the model parameters using a random initialization or chaos mapping initialization method, thereby achieving solution space initialization.

[0043] Obtain the fitness value corresponding to each individual, and determine the optimal individual according to the fitness value corresponding to each individual; For example, the error function value corresponding to each individual can be obtained first, and the error function value can be added to a constant and then the inverse can be taken to obtain the fitness value corresponding to each individual. The greater the fitness, the better its position in the solution space, and the more it can improve the recognition ability of the security recognition model. Therefore, the individual with the largest fitness can be determined as the optimal individual.

[0044] According to the optimal individual, performing global adaptive guided update on all individuals to obtain individuals after global adaptive guided update; For the individuals after global adaptive guidance update, all individuals are subjected to neighborhood adaptive guidance update to obtain individuals after neighborhood adaptive guidance update; For the individuals after the neighborhood adaptive guided update, all individuals are subjected to random adaptive guided update to obtain individuals after the random adaptive guided update; The optimal individual is re-determined with the individual after the random adaptive guidance update, and before the maximum number of updates is reached, the step of global adaptive guidance update is returned until the maximum number of updates is reached, and the model parameters contained in the optimal individual are used as the final parameters of the security identification model to achieve the pre-deployment of the security identification model.

[0045] In a possible implementation, according to the optimal individual, all individuals are globally adaptively guided and updated, and the individuals after the global adaptive guidance and update are obtained as follows:

[0046]

[0047] in, Indicates the first i Individuals, i =1,2,…,H, H represents the total number of individuals, represents the individual after global adaptive guidance update , represents the first random number between (0,1), represents the second random number between (0,1), represents the adaptive step size in the t+1th update process; Indicates individual is the center, the reference position within the neighborhood; Indicates the reference position With individuals The Euclidean distance between the two; the radius of the neighborhood is set to R. When the distance between them is less than R, it is considered that the individual within the neighborhood of; , Represents an individual The first k Neighborhood individuals, M represents the total number of neighborhood individuals, represents the optimal individual, The optimal individual With individuals The Euclidean distance between represents the step size adjustment factor, and T represents the maximum number of training times.

[0048] The global adaptive guided update provided by the embodiment of the present invention can be centered on the individual, and learn and integrate the individual position information within the neighborhood range, thereby helping to explore more locations within the individual's domain, which can greatly improve the convenience of the solution space and maintain population diversity.

[0049] In a possible implementation, for the individuals after the global adaptive guidance update, the neighborhood adaptive guidance update is performed on all individuals, and the individuals after the neighborhood adaptive guidance update are obtained as follows:

[0050] in, Indicates n individuals after global adaptive guidance update, n =1,2,…,H, represents the third random number between (0,1), represents the fourth random number between (0,1), Represents an individual The optimal neighbor individual with the largest fitness value in the neighborhood of represents the best neighbor individual With individuals The Euclidean distance of represents the individual after the neighborhood adaptive guided update .

[0051] The neighborhood adaptive guided update provided by the embodiment of the present invention can enable individuals to learn the local optimal position within the neighborhood and the information of the global optimal position among all individuals, which can make the algorithm converge quickly and improve the accuracy of the algorithm. The setting of adaptive update can take into account both search efficiency and global search in the early stage, and improve the search accuracy of the algorithm in the later stage of the algorithm.

[0052] In a possible implementation, for individuals after neighborhood adaptive guidance update, performing random adaptive guidance update on all individuals to obtain individuals after random adaptive guidance update includes: For the individuals after the neighborhood adaptive guided update, random adaptive guided update is performed on the individuals to determine the update value:

[0053]

[0054]

[0055] in, Indicates m The individuals after the neighborhood adaptive guidance update, m =1,2,…,H, represents the fifth random number between (0,1), represents the sixth random number between (0,1), represents the first random individual, represents the second random individual, and , as well as Different from each other, represents the adaptive guidance factor, represents the initial value corresponding to the adaptive guidance factor, represents a natural constant, represents the position influence factor, represents the maximum value of the position influence factor, represents the minimum value of the position influence factor, Represents an individual The fitness value of represents the minimum fitness value among all individuals after the neighborhood adaptive guided update, represents the average fitness value of individuals after all neighborhood adaptive guided updates, Represents an individual The corresponding updated value; Determine the update value Whether the fitness value of increases, if so, accept the random adaptive guided update and obtain the individual after the random adaptive guided update, otherwise directly replace the individual as individuals after random adaptive bootstrap updates.

[0056] The neighborhood adaptive guided update provided by the embodiment of the present invention uses random positions as references and position influencing factors for searching, which can effectively achieve position transitions and maintain the diversity of the population to enhance the global search capability of the algorithm.

[0057] The combination of the three search methods can ensure the search speed and search accuracy of the algorithm, and can effectively avoid the problem of easily falling into local optimality in the prior art.

[0058] In a possible implementation, the data server matches the data query request in the blockchain to determine a target keyword group and a target data holder, and transmits the target keyword group to the corresponding target data holder, including: The data query request is matched in the blockchain by the data server, and the N keyword groups with the highest similarity to the data query request are queried to obtain the target keyword group and the target data holder corresponding to the target keyword group; Transmitting the subject name of the e-book reader data in the target keyword group to the data requester to obtain a determination instruction of the data request method; wherein the determination instruction is used to represent a selection instruction of the target subject name; Parse the determined instruction of the data request method to obtain the target subject name; The target keyword group corresponding to the target subject name is transmitted to the corresponding target data holder.

[0059] In a possible implementation, according to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server, including: According to the association between the keyword group and the e-book reader data, the target e-book reader data is determined through the target data holder; Generate a temporary session key pair by using an asymmetric encryption algorithm through the target data holder; wherein the temporary session key pair includes a temporary session public key and a temporary session private key; After encrypting the target e-book reader data corresponding to the target keyword group by using the temporary session public key, the encrypted target e-book reader number is obtained; The target e-book reader number is uploaded to a data server.

[0060] Those skilled in the art will readily appreciate other embodiments of the present invention after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art that are not disclosed by the present invention. It should be understood that the present invention is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.

Claims

1. A blockchain-based electronic reader data sharing method, characterized in that: include: The data holder generates an association between the keyword group and the e-book reader data, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted keyword group to the blockchain for storage; The data requester generates a data query request, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server. At the same time, the data server collects the network characteristics of the data requester during the data request process; The data server identifies the network features in the data request process in real time to determine the behavior safety, and ends the sharing process when the behavior safety is unsafe; When it is safe to behave, continue the sharing process; The data query request is matched in the blockchain by the data server to determine the target keyword group and the target data holder, and the target keyword group is transmitted to the corresponding target data holder; According to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server; The encrypted target e-book reader data is transmitted to the data requester through the data server, and the data requester publishes its own public key to the blockchain; The data holder obtains the public key of the data requester in the blockchain, encrypts the temporary session private key in the temporary session key pair using the public key of the data requester, and forwards the encrypted temporary session private key to the data requester through the data server to complete the sharing of the e-book reader data.

2. The electronic reader data sharing method based on blockchain according to claim 1 is characterized in that: The data holder generates an association between the keyword group and the e-book reader data, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted keyword group to the blockchain for storage, including: Generate a system public key and a system private key corresponding to the system public key through a data server, and publish the system private key in the blockchain; Generate associations between keyword groups and e-book reader data through data holders; The data holder queries the system public key in the blockchain, and encrypts the keywords in the keyword group stored in the data holder one by one through the system public key to obtain the encrypted keyword group; wherein the keyword group at least includes the subject name of the e-book reader data; The encrypted keyword group is transmitted to the blockchain for storage.

3. The electronic reader data sharing method based on blockchain according to claim 1, characterized in that: The data requester generates a data query request, and uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server. At the same time, the data server collects the network characteristics of the data requester during the data request process, including: A data query request is generated by a data requester; wherein the data query request includes at least one keyword; The data requester queries the system public key in the blockchain, uses the system public key of the data server to encrypt the keyword group, and transmits the encrypted data query request to the data server; After the data server receives the data query request, the data server also collects the network characteristics of the data requester during the data request process.

4. The electronic reader data sharing method based on blockchain according to claim 3 is characterized in that: The network features of the data request process are identified in real time by the data server to determine the safety of the behavior, including: The network features in the data request process are identified through the security identification model pre-deployed on the data server to obtain behavioral security.

5. The electronic reader data sharing method based on blockchain according to claim 4 is characterized in that: The pre-deployment method of the security identification model includes: A deep learning model is used to build a security identification model, and the model parameters of the security identification model are initialized to obtain individuals, and multiple different individuals are repeatedly obtained; Obtain the fitness value corresponding to each individual, and determine the optimal individual according to the fitness value corresponding to each individual; According to the optimal individual, performing global adaptive guided update on all individuals to obtain individuals after global adaptive guided update; For the individuals after global adaptive guidance update, all individuals are subjected to neighborhood adaptive guidance update to obtain individuals after neighborhood adaptive guidance update; For the individuals after the neighborhood adaptive guided update, all individuals are randomly adaptive guided updated to obtain the individuals after the random adaptive guided update; The optimal individual is re-determined with the individual after the random adaptive guidance update, and before the maximum number of updates is reached, the step of global adaptive guidance update is returned until the maximum number of updates is reached, and the model parameters contained in the optimal individual are used as the final parameters of the security identification model to achieve the pre-deployment of the security identification model.

6. The electronic reader data sharing method based on blockchain according to claim 5 is characterized in that: According to the optimal individual, all individuals are globally adaptively guided and updated, and the individuals after the global adaptive guidance update are obtained as follows: in, Indicates the first i Individuals, i =1,2,…,H, H represents the total number of individuals, represents the individual after global adaptive guidance update , represents the first random number between (0,1), represents the second random number between (0,1), represents the adaptive step size in the t+1th update process; Indicates individual is the center, the reference position within the neighborhood; Indicates the reference position With individuals The Euclidean distance between the two; the radius of the neighborhood is set to R. When the distance between them is less than R, it is considered that the individual within the neighborhood of; , Represents an individual The first k Neighborhood individuals, M represents the total number of neighborhood individuals, represents the optimal individual, The optimal individual With individuals The Euclidean distance between represents the step size adjustment factor, and T represents the maximum number of training times.

7. The electronic reader data sharing method based on blockchain according to claim 6 is characterized in that: For the individuals after global adaptive guidance update, all individuals are updated with neighborhood adaptive guidance, and the individuals after neighborhood adaptive guidance update are: in, Indicates n individuals after global adaptive guidance update, n =1,2,…,H, represents the third random number between (0,1), represents the fourth random number between (0,1), Represents an individual The optimal neighbor individual with the largest fitness value in the neighborhood of represents the best neighbor individual With individuals The Euclidean distance of represents the individual after the neighborhood adaptive guided update .

8. The electronic reader data sharing method based on blockchain according to claim 7 is characterized in that: For the individuals after the neighborhood adaptive guided update, all individuals are randomly adaptive guided updated to obtain the individuals after the random adaptive guided update, including: For the individuals after the neighborhood adaptive guided update, random adaptive guided update is performed on the individuals to determine the update value: in, Indicates m The individuals after the neighborhood adaptive guidance update, m =1,2,…,H, represents the fifth random number between (0,1), represents the sixth random number between (0,1), represents the first random individual, represents the second random individual, and , as well as Different from each other, represents the adaptive guidance factor, represents the initial value corresponding to the adaptive guidance factor, represents a natural constant, represents the position influence factor, represents the maximum value of the position influence factor, represents the minimum value of the position influence factor, Represents an individual The fitness value of represents the minimum fitness value among all individuals after the neighborhood adaptive guided update, represents the average fitness value of individuals after all neighborhood adaptive guided updates, Represents an individual The corresponding updated value; Determine the update value Whether the fitness value of increases, if so, accept the random adaptive guided update and obtain the individual after the random adaptive guided update, otherwise directly replace the individual as individuals after random adaptive bootstrap updates.

9. The electronic reader data sharing method based on blockchain according to claim 2, characterized in that: The data query request is matched in the blockchain by the data server to determine the target keyword group and the target data holder, and the target keyword group is transmitted to the corresponding target data holder, including: The data query request is matched in the blockchain by the data server, and the N keyword groups with the highest similarity to the data query request are queried to obtain the target keyword group and the target data holder corresponding to the target keyword group; Transmitting the subject name of the e-book reader data in the target keyword group to the data requester to obtain a determination instruction of the data request method; wherein the determination instruction is used to represent a selection instruction of the target subject name; Parse the determined instruction of the data request method to obtain the target subject name; The target keyword group corresponding to the target subject name is transmitted to the corresponding target data holder.

10. The electronic reader data sharing method based on blockchain according to claim 9, characterized in that: According to the association between the keyword group and the e-book reader data, a temporary session key pair is generated by the target data holder, and the target e-book reader data corresponding to the target keyword group is encrypted using the temporary session public key in the temporary session key pair, and the encrypted target e-book reader data is uploaded to the data server, including: According to the association between the keyword group and the e-book reader data, the target e-book reader data is determined through the target data holder; Generate a temporary session key pair by using an asymmetric encryption algorithm through the target data holder; wherein the temporary session key pair includes a temporary session public key and a temporary session private key; After encrypting the target e-book reader data corresponding to the target keyword group by using the temporary session public key, the encrypted target e-book reader number is obtained; The target e-book reader number is uploaded to a data server.

Citation Information

Patent Citations

  • Data sharing method and system

    CN113239123A

  • Virtual power plant data security protection method based on block chain

    CN116756772A

  • Retrievable decentralized fine-grained secure knowledge sharing method

    CN118337417A

  • Searchable encrypted data sharing method and system based on blockchain and homomorphic encryption

    US20220368545A1