CN115618382A - Storage method and device for shared data in alliance chain and electronic equipment - Google Patents

Storage method and device for shared data in alliance chain and electronic equipment Download PDF

Info

Publication number
CN115618382A
CN115618382A CN202211234428.3A CN202211234428A CN115618382A CN 115618382 A CN115618382 A CN 115618382A CN 202211234428 A CN202211234428 A CN 202211234428A CN 115618382 A CN115618382 A CN 115618382A
Authority
CN
China
Prior art keywords
data
shared
federation chain
unique identifier
chain
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211234428.3A
Other languages
Chinese (zh)
Inventor
魏明
阮安邦
王佳帅
姜国仁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Octa Innovations Information Technology Co Ltd
Original Assignee
Beijing Octa Innovations Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Octa Innovations Information Technology Co Ltd filed Critical Beijing Octa Innovations Information Technology Co Ltd
Priority to CN202211234428.3A priority Critical patent/CN115618382A/en
Publication of CN115618382A publication Critical patent/CN115618382A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Landscapes

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

Abstract

The application discloses a storage method and a storage device for shared data in a alliance chain and electronic equipment, wherein shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain are obtained; creating an Object set for shared data among federation chain nodes of the federation chain, the Object set comprising a plurality of objects, each Object having a unique identifier; and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from the bilinear circular group to obtain shared ciphertext data, so that the shared ciphertext data is linked to the alliance chain to be shared among alliance chain nodes of the alliance chain, and the safe storage of the shared data is ensured.

Description

Storage method and device for shared data in alliance chain and electronic equipment
Technical Field
The present application relates to the field of alliance chain technologies, and in particular, to a storage method and apparatus for shared data in an alliance chain, and an electronic device.
Background
The alliance link technology does not have an authoritative central node to uniformly manage data in the system. The data in the federation chain is stored in a copy in a disk of each federation chain node, which needs a mechanism for ensuring that the data of each node is consistent by making the nodes in the federation chain coordinate their actions to agree on a block through a consensus process.
However, the federation chains may have shared data shared among the federation chains, and the federation chains are based on the internet essentially, so how to ensure the secure storage of the shared data becomes an urgent technical problem to be solved.
Disclosure of Invention
Based on the foregoing problems, embodiments of the present application provide a storage method and an apparatus for shared data in a federation chain, and an electronic device.
The embodiment of the application discloses the following technical scheme:
1. a method for storing shared data in a federation chain, comprising:
obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain;
creating an Object set for shared data among federation chain nodes of the federation chain, the Object set comprising a plurality of objects, each Object having a unique identifier;
and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain so as to be shared among the alliance chain nodes of the alliance chain.
2. The method for storing shared data in a federation chain according to claim 1, wherein the encrypting the shared data according to the unique identifier of the Object and the generator selected from the bilinear circular group to obtain shared ciphertext data for uploading the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain comprises: and carrying out Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first random number, and encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data according to the unique identifier of the Object and the first random number corresponding to the unique identifier of the Object so as to uplink the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
3. The method for storing shared data in a federation chain according to claim 1, wherein the performing a Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first pseudo-random number comprises: and carrying out Hash operation on the current unique identifier of the Object to generate a random number, and carrying out linear change on the random number to obtain a random number corresponding to the unique identifier of the next Object.
4. The storage method for shared data in alliance chain as claimed in claim 1, wherein the obtaining shared data to be stored in the alliance chain and shared between alliance chain nodes of the alliance chain comprises: obtaining source data corresponding to shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain; analyzing the source data to obtain key code description of the source data; judging whether the source data is shared data or not according to the key code description of the source data; in response to the source data being shared data, performing obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain.
5. A storage method for shared data in a federation chain as claimed in claim 4, wherein said parsing the source data to obtain a key description of the source data comprises: and determining a circulation expression structure of the source data, and analyzing the source data according to the circulation expression structure to obtain key code description of the source data.
6. A storage method for sharing data in a federation chain according to claim 4, wherein the parsing the source data according to the circulation expression structure to obtain a key description of the source data includes: and screening out a field where the key code description of the source data is located according to the field identification code defined by the circulation expression structure, and accessing the value of the field to obtain the key code description of the source data.
7. The method of claim 4, wherein the obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain is performed in response to the source data being shared data comprises: adding the source data into a shared data collection library to perform obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain, obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain from the shared data collection library.
8. The method for storing shared data in federation chain of claim 4, wherein the obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain, and then creating a set of objects for the shared data shared among federation chain nodes of the federation chain, the set of objects including a plurality of objects, each Object having a unique identifier, comprises: slicing the shared data to obtain a plurality of data elements with the same size; generating a data summary for each data element; and constructing one Object for each data element, allocating a unique identifier for each Object, sharing the unique identifier of each Object as the unique identifier of the data element corresponding to the Object, and enabling a plurality of objects to form the Object set.
9. A method for storing shared data in a federation chain as claimed in claim 8, wherein the step of chunking the shared data to obtain a plurality of data elements with the same size comprises: and circularly superposing the data according to a set data segmentation iterator so as to perform the segmentation processing on the shared data to obtain a plurality of data elements with the same size.
10. A method for storing shared data in a federation chain as claimed in claim 8, wherein said generating a data summary for each said data element comprises: and extracting the description features of each data element according to a set data sliding window, distributing corresponding description feature indexes to the extracted description features, and splicing all the extracted description features according to the sequence of the description feature indexes to generate a data summary.
11. A method for storing shared data in a federation chain as claimed in claim 8, wherein said constructing an Object for each said data element and assigning a unique identifier for each said Object comprises: and constructing an Object for each data element, generating a second random number for each Object by means of random number generation, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
12. The method for storing shared data in a federation chain according to claim 11, wherein the constructing one Object for each data element and generating one random number for each Object by means of random number generation and assigning the corresponding Object as a corresponding unique identifier comprises: and constructing an Object for each data element, generating a second random number for each Object in a random number generation mode according to the front-back logic sequence between the data elements, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
13. A storage device for sharing data in a federation chain, comprising:
a first program element for obtaining shared data to be stored into the federation chain and shared between federation chain nodes of the federation chain;
a second program unit, configured to create an Object set for shared data among federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identifier;
and a third program unit, configured to encrypt the shared data according to the unique identifier of the Object and a generator selected from a bilinear cyclic group to obtain shared ciphertext data, so as to uplink the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
14. A storage device for shared data in a federation chain as claimed in claim 13, wherein the third program unit is further to: and carrying out Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first random number, encrypting the shared data according to the unique identifier of the Object and the first random number corresponding to the unique identifier of the Object and the generator selected from the bilinear cyclic group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain for sharing among alliance chain nodes of the alliance chain.
15. A storage device for shared data in a federation chain as claimed in claim 13, wherein the third program unit is further to: and carrying out Hash operation on the current unique identifier of the Object to generate a random number, and carrying out linear change on the random number to obtain a random number corresponding to the unique identifier of the next Object.
16. A storage device for sharing data in a federation chain as claimed in claim 13, wherein the first program unit is further configured to: obtaining source data corresponding to shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain; analyzing the source data to obtain key code description of the source data; judging whether the source data is shared data or not according to the key code description of the source data; in response to the source data being shared data, performing obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain.
17. A storage device for shared data in a federation chain as claimed in claim 16, wherein the first program unit is further to: and determining a circulation expression structure of the source data, and analyzing the source data according to the circulation expression structure to obtain key code description of the source data.
18. A storage device for shared data in a federation chain as claimed in claim 16, wherein the first program unit is further to: and screening out a field where the key code description of the source data is located according to the field identification code defined by the circulation expression structure, and accessing the value of the field to obtain the key code description of the source data.
19. A storage device for sharing data in a federation chain as claimed in claim 16, wherein the first program unit is further configured to: adding the source data into a shared data collection library to perform obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain, obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain from the shared data collection library.
20. A storage device for sharing data in a federation chain as claimed in claim 16, wherein the first program unit is further configured to: slicing the shared data to obtain a plurality of data elements with the same size; generating a data summary for each data element; and constructing one Object for each data element, allocating a unique identifier for each Object, sharing the unique identifier of each Object as the unique identifier of the data element corresponding to the Object, and enabling a plurality of objects to form the Object set.
21. A storage device for shared data in a federation chain as claimed in claim 20, wherein the first program unit is further to: and circularly superposing the data according to a set data segmentation iterator so as to perform the segmentation processing on the shared data to obtain a plurality of data elements with the same size.
22. A storage device for shared data in a federation chain as claimed in claim 20, wherein the first program unit is further to: and extracting the description features of each data element according to a set data sliding window, distributing corresponding description feature indexes to the extracted description features, and splicing all the extracted description features according to the sequence of the description feature indexes to generate a data summary.
23. A storage device for sharing data in a federation chain as claimed in claim 20, wherein the first program unit is further configured to: and constructing an Object for each data element, generating a second random number for each Object in a random number generation mode, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
24. A storage device for shared data in a federation chain as claimed in claim 23, wherein the first program unit is further to: and constructing an Object for each data element, generating a second random number for each Object in a random number generation mode according to the front-back logic sequence between the data elements, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
25. An electronic device, comprising a memory and a processor, wherein the memory stores an executable program, and the processor executes the executable program to perform the following steps:
obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain;
creating an Object set for shared data among federation chain nodes of the federation chain, the Object set comprising a plurality of objects, each Object having a unique identifier;
and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from the bilinear circular group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain so as to be shared among alliance chain nodes of the alliance chain.
In the technical scheme of the embodiment of the application, shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain is obtained; creating an Object set for shared data shared between federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identification; and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from the bilinear circular group to obtain shared ciphertext data, so that the shared ciphertext data is linked to the alliance chain to be shared among alliance chain nodes of the alliance chain, and the safe storage of the shared data is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the description below are only some embodiments of the present application, and for those skilled in the art, other drawings may be obtained according to these drawings without inventive labor.
Fig. 1 is a schematic flowchart illustrating a storage method of shared data in a federation chain according to an embodiment of the present application;
FIG. 2 is a diagram illustrating a structure of a storage device sharing data in a federation chain according to an embodiment of the present application;
FIG. 3 is a schematic structural diagram of an electronic device in an embodiment of the present application;
fig. 4 is a schematic diagram of a hardware structure of an electronic device in the embodiment of the present application.
Detailed Description
It is not necessary for any particular embodiment of the invention to achieve all of the above advantages at the same time.
In order to make those skilled in the art better understand the technical solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without making any creative effort based on the embodiments in the present invention, belong to the protection scope of the present invention.
In the technical scheme of the embodiment of the application, shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain is obtained; creating an Object set for shared data among federation chain nodes of the federation chain, the Object set comprising a plurality of objects, each Object having a unique identifier; and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from the bilinear circular group to obtain shared ciphertext data, so that the shared ciphertext data is linked to the alliance chain to be shared among alliance chain nodes of the alliance chain, and the safe storage of the shared data is ensured.
Fig. 1 is a schematic flowchart illustrating a storage method of shared data in a federation chain according to an embodiment of the present application; as shown in fig. 1, it includes:
s101, obtaining shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain;
s102, creating an Object set aiming at shared data among the alliance chain nodes of the alliance chain, wherein the Object set comprises a plurality of objects, and each Object has a unique identifier;
s103, encrypting the shared data according to the unique identifier of the Object and the generator selected from the bilinear circular group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain to be shared among alliance chain nodes of the alliance chain.
Optionally, the encrypting, according to the unique identifier of the Object, the shared data according to a generator selected from a bilinear circular group to obtain shared ciphertext data, so as to link the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain, includes: and carrying out Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first random number, and encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data according to the unique identifier of the Object and the first random number corresponding to the unique identifier of the Object so as to uplink the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
In this embodiment, the unique identifier corresponding to each Object is converted into a first random number by performing Hash operation on the unique identifier of each Object, so as to perform Hash operation on the unique identifier of each Object, thereby ensuring the security of the unique security identifier. Furthermore, the shared data is encrypted according to the generator selected from the bilinear circular group to obtain shared ciphertext data, and the safety of the shared data is enhanced.
Optionally, the Hash operation is performed on the unique identifier of each Object, so as to convert the unique identifier corresponding to each Object into a first pseudo-random number, where the Hash operation includes: and carrying out Hash operation on the current unique identifier of the Object to generate a random number, and carrying out linear change on the random number to obtain a random number corresponding to the unique identifier of the next Object.
In this embodiment, hash operation is performed on the current unique identifier of the Object to generate a random number, and the random number is linearly changed to obtain a random number corresponding to the unique identifier of the next Object, so that generation of the random number can be completed quickly.
Optionally, the obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain includes: obtaining source data corresponding to shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain; analyzing the source data to obtain key code description of the source data; judging whether the source data is shared data or not according to the key code description of the source data; in response to the source data being shared data, performing obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain.
In this embodiment, whether the source data is shared data can be determined quickly and accurately by the key description of the source data.
Optionally, the parsing the source data to obtain the key description of the source data includes: and determining a circulation expression structure of the source data, and analyzing the source data according to the circulation expression structure to obtain key code description of the source data.
In this embodiment, the circulation expression structure of the source data directly obtains the key description of the source data, thereby avoiding the delay of data processing.
Optionally, the parsing the source data according to the circulation expression structure to obtain a key description of the source data includes: and screening out a field where the key code description of the source data is located according to the field identification code defined by the circulation expression structure, and accessing the value of the field to obtain the key code description of the source data.
In this embodiment, the field identification code defined by the circulation expression structure quickly obtains the key description of the source data, and meanwhile, it is ensured that the key description of the source data is not erroneously obtained.
Optionally, the performing, in response to the source data being shared data, acquiring shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain includes: adding the source data into a shared data collection library to perform obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain, obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain from the shared data collection library.
In the embodiment, the shared data is managed by crying the shared data mobile phone, so that flexible operation and maintenance of the shared data are realized.
Optionally, the acquiring shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain, and then creating an Object set for the shared data among federation chain nodes of the federation chain, where the Object set includes multiple objects, and each Object has a unique identifier, includes: slicing the shared data to obtain a plurality of data elements with the same size; generating a data summary for each data element; and constructing one Object for each data element, allocating a unique identifier for each Object, sharing the unique identifier of each Object as the unique identifier of the data element corresponding to the Object, and enabling a plurality of objects to form the Object set.
In this embodiment, each Object corresponds to one data block, so that implicit processing of the data block is realized, and the security of data is ensured.
Optionally, the dicing the shared data to obtain a plurality of data elements with the same size includes: and circularly overlapping according to a set data segmentation iterator to perform the segmentation processing on the shared data to obtain a plurality of data elements with the same size.
In this embodiment, the data segmentation iterator performs loop superposition to quickly implement the segmentation processing, and the data elements are guaranteed to be the same in size.
Optionally, the generating a data summary for each data element includes: and extracting the description characteristics of each data element according to a set data sliding window, distributing corresponding description characteristic indexes to the extracted description characteristics, and splicing all the extracted description characteristics according to the sequence of the description characteristic indexes to generate a data summary.
In this embodiment, the order based on the description feature index may ensure that the data summary itself has order to match with the logical order between the data elements, so as to avoid data collision caused by out-of-order of the data elements.
Optionally, the constructing an Object for each data element and assigning a unique identifier for each Object includes: and constructing an Object for each data element, generating a second random number for each Object by means of random number generation, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
In this embodiment, a second random number is generated for each Object by means of random number generation and is allocated to the corresponding Object as a corresponding unique identifier, so that the security of the unique identifier is ensured.
Optionally, the constructing an Object for each data element, and generating a random number for each Object by means of random number generation and assigning the random number to the corresponding Object as the corresponding unique identifier includes: and constructing an Object for each data element, generating a second random number for each Object in a random number generation mode according to the front-back logic sequence between the data elements, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
In this embodiment, a second random number is generated based on the front-back logical order between the data elements and is allocated to the corresponding Object as the corresponding unique identifier, so that the unique identifier can reflect the front-back logical order between the data elements, and data disorder and data collision are avoided.
FIG. 2 is a diagram illustrating a structure of a storage device sharing data in a federation chain according to an embodiment of the present application; as shown in fig. 2, it includes:
a first program unit 201 for obtaining shared data to be stored into the federation chain and shared between federation chain nodes of the federation chain;
a second program element 202, configured to create an Object set for shared data among federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identifier;
a third program unit 203, configured to encrypt the shared data according to the unique identifier of the Object and the generator selected from the bilinear circular group to obtain shared ciphertext data, so as to link the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
Optionally, the third program element 203 is further configured to: and carrying out Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first random number, and encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data according to the unique identifier of the Object and the first random number corresponding to the unique identifier of the Object so as to uplink the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
Optionally, the third program element 203 is further configured to: and carrying out Hash operation on the current unique identifier of the Object to generate a random number, and carrying out linear change on the random number to obtain a random number corresponding to the unique identifier of the next Object.
Optionally, the first program element 201 is further configured to: obtaining source data corresponding to shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain; analyzing the source data to obtain key code description of the source data; judging whether the source data is shared data or not according to the key code description of the source data; in response to the source data being shared data, performing obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain.
Optionally, the first program element 201 is further configured to: and determining a circulation expression structure of the source data, and analyzing the source data according to the circulation expression structure to obtain key code description of the source data.
Optionally, the first program element 201 is further configured to: and screening out a field where the key code description of the source data is located according to the field identification code defined by the circulation expression structure, and accessing the value of the field to obtain the key code description of the source data.
Optionally, the first program element 201 is further configured to: adding the source data into a shared data collection library to perform obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain, obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain from the shared data collection library.
Optionally, the first program element 201 is further configured to: slicing the shared data to obtain a plurality of data elements with the same size; generating a data summary for each data element; and constructing one Object for each data element, allocating a unique identifier for each Object, sharing the unique identifier of each Object as the unique identifier of the data element corresponding to the Object, and enabling a plurality of objects to form the Object set.
Optionally, the first program element 201 is further configured to: and circularly overlapping according to a set data segmentation iterator to perform the segmentation processing on the shared data to obtain a plurality of data elements with the same size.
Optionally, the first program element 201 is further configured to: and extracting the description characteristics of each data element according to a set data sliding window, distributing corresponding description characteristic indexes to the extracted description characteristics, and splicing all the extracted description characteristics according to the sequence of the description characteristic indexes to generate a data summary.
Optionally, the first program element 201 is further configured to: and constructing an Object for each data element, generating a second random number for each Object by means of random number generation, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
Optionally, the first program element 201 is further configured to: and constructing an Object for each data element, generating a second random number for each Object in a random number generation mode according to the front-back logic sequence between the data elements, and allocating the second random number to the corresponding Object as a corresponding unique identifier.
Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application; as shown in fig. 3, it includes a memory 301 and a processor 302, the memory stores an executable program, and the processor executes the executable program and executes the following steps:
acquiring shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain;
creating an Object set for shared data shared between federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identification;
and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain so as to be shared among the alliance chain nodes of the alliance chain.
FIG. 4 is a schematic diagram of a hardware structure of an electronic device in an embodiment of the present application; as shown in fig. 4, the hardware structure of the electronic device may include: the electronic device 400 includes a computing unit 401 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 402 or a computer program loaded from a storage unit 406 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data required for the operation of the device 400 can also be stored. The computing unit 401, ROM 402, and RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
A number of components in the electronic device 400 are connected to the I/O interface 405, including: an input unit 406, an output unit 407, a storage unit 408, and a communication unit 409. The input unit 406 may be any type of device capable of inputting information to the electronic device 400, and the input unit 406 may receive input numeric or character information and generate key signal inputs related to user settings and/or function controls of the electronic device. Output unit 407 may be any type of device capable of presenting information and may include, but is not limited to, a display, speakers, a video/audio output terminal, a vibrator, and/or a printer. The storage unit 404 may include, but is not limited to, a magnetic disk, an optical disk. The communication unit 409 allows the electronic device 400 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunications networks, and may include, but is not limited to, modems, network cards, infrared communication devices, wireless communication transceivers and/or chipsets, such as bluetooth (TM) devices, wiFi devices, wiMax devices, cellular communication devices, and/or the like.
Computing unit 401 may be a variety of general and/or special purpose processing components with processing and computing capabilities. Some examples of the computing unit 401 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The calculation unit 401 executes the respective methods and processes described above. For example, in some embodiments, the above-described steps may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 40. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 400 via the ROM 402 and/or the communication unit 409. In some embodiments, the computing unit 401 may be configured to perform the above steps in any other suitable manner (e.g., by means of firmware).
The electronic device of the embodiments of the present application exists in various forms, including but not limited to:
(1) Mobile communication devices, which are characterized by mobile communication capabilities and are primarily targeted at providing voice and data communications. Such terminals include smart phones (e.g., iphones), multimedia phones, functional phones, and low-end phones, among others.
(2) The ultra-mobile personal computer equipment belongs to the category of personal computers, has calculation and processing functions and generally has the characteristic of mobile internet access. Such terminals include PDA, MID, and UMPC devices, such as ipads.
(3) Portable entertainment devices such devices may display and play multimedia content. Such devices include audio and video players (e.g., ipods), handheld game consoles, electronic books, and smart toys and portable car navigation devices.
(4) The server is similar to a general computer architecture, but has higher requirements on processing capability, stability, reliability, safety, expandability, manageability and the like because of the need of providing highly reliable services.
(5) And other electronic devices with data interaction functions.
It should be noted that, in this specification, each embodiment is described in a progressive manner, and the same and similar parts between the embodiments are referred to each other, and each embodiment focuses on differences from other embodiments. In particular, the apparatus and system embodiments, because they are substantially similar to the method embodiments, are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for related points. The above-described embodiments of the apparatus and system are merely illustrative, and the modules illustrated as separate components may or may not be physically separate, and the components suggested as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The above description is only one specific embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. A method for storing shared data in a federation chain, comprising:
obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain;
creating an Object set for shared data shared between federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identification;
and according to the unique identifier of the Object, encrypting the shared data according to a generator selected from the bilinear circular group to obtain shared ciphertext data, and uploading the shared ciphertext data to the alliance chain so as to be shared among alliance chain nodes of the alliance chain.
2. The method for storing shared data in a federation chain of claim 1, wherein the encrypting the shared data according to a generator selected from a bilinear circular group based on the unique identifier of the Object to obtain shared ciphertext data for uploading the shared ciphertext data into the federation chain for sharing among federation chain nodes of the federation chain comprises: and carrying out Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first random number, and encrypting the shared data according to a generator selected from a bilinear cyclic group to obtain shared ciphertext data according to the unique identifier of the Object and the first random number corresponding to the unique identifier of the Object so as to uplink the shared ciphertext data to the federation chain for sharing among federation chain nodes of the federation chain.
3. The method for storing shared data in a federation chain according to claim 1, wherein the performing a Hash operation on the unique identifier of each Object to convert the unique identifier corresponding to each Object into a first pseudo-random number comprises: and carrying out Hash operation on the current unique identifier of the Object to generate a random number, and carrying out linear change on the random number to obtain a random number corresponding to the unique identifier of the next Object.
4. The storage method for shared data in alliance chain as claimed in claim 1, wherein the obtaining shared data to be stored in the alliance chain and shared between alliance chain nodes of the alliance chain comprises: obtaining source data corresponding to shared data to be stored in the alliance chain and shared among alliance chain nodes of the alliance chain; analyzing the source data to obtain key code description of the source data; judging whether the source data is shared data or not according to the key code description of the source data; in response to the source data being shared data, performing obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain.
5. A method for storing shared data in a federation chain as claimed in claim 4, wherein said parsing the source data to obtain a key description of the source data comprises: and determining a circulation expression structure of the source data, and analyzing the source data according to the circulation expression structure to obtain key description of the source data.
6. A storage method for sharing data in a federation chain according to claim 4, wherein the parsing the source data according to the circulation expression structure to obtain a key description of the source data includes: and screening out a field where the key code description of the source data is located according to the field identification code defined by the circulation expression structure, and accessing the value of the field to obtain the key code description of the source data.
7. The method of claim 4, wherein the obtaining shared data to be stored in the federation chain and shared among federation chain nodes of the federation chain is performed in response to the source data being shared data comprises: adding the source data into a shared data collection library to perform obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain, obtaining shared data to be stored into the federation chain and shared among federation chain nodes of the federation chain from the shared data collection library.
8. The method according to claim 4, wherein the obtaining shared data to be stored in the federation chain and shared between federation chain nodes of the federation chain, and then creating an Object set for the shared data shared between federation chain nodes of the federation chain, the Object set including a plurality of objects, each Object having a unique identifier, includes: slicing the shared data to obtain a plurality of data elements with the same size; generating a data summary for each data element; constructing one Object for each data element, allocating a unique identifier for each Object, sharing the unique identifier of each Object as the unique identifier of the data element corresponding to the Object, and enabling a plurality of objects to form the Object set.
9. The method of claim 8, wherein the chunking the shared data to obtain a plurality of data elements with the same size comprises: and circularly superposing the data according to a set data segmentation iterator so as to perform the segmentation processing on the shared data to obtain a plurality of data elements with the same size.
10. A method for storing shared data in a federation chain as claimed in claim 8, wherein said generating a data summary for each of said data elements comprises: and extracting the description features of each data element according to a set data sliding window, distributing corresponding description feature indexes to the extracted description features, and splicing all the extracted description features according to the sequence of the description feature indexes to generate a data summary.
CN202211234428.3A 2022-10-10 2022-10-10 Storage method and device for shared data in alliance chain and electronic equipment Pending CN115618382A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211234428.3A CN115618382A (en) 2022-10-10 2022-10-10 Storage method and device for shared data in alliance chain and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211234428.3A CN115618382A (en) 2022-10-10 2022-10-10 Storage method and device for shared data in alliance chain and electronic equipment

Publications (1)

Publication Number Publication Date
CN115618382A true CN115618382A (en) 2023-01-17

Family

ID=84862364

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211234428.3A Pending CN115618382A (en) 2022-10-10 2022-10-10 Storage method and device for shared data in alliance chain and electronic equipment

Country Status (1)

Country Link
CN (1) CN115618382A (en)

Similar Documents

Publication Publication Date Title
CN108805565B (en) Block chain based commitment presence proving method, device and readable storage medium
CN104133765B (en) The test case sending method of network activity and test case server
CN109376021A (en) The response method and server that interface calls
CN109410083A (en) Information sharing method and device and storage medium
CN111934873A (en) Bidding file encryption and decryption method and device
CN113360217A (en) Rule engine SDK calling method and device and storage medium
CN112134883A (en) Method and device for quickly authenticating trust relationship between nodes based on trusted computing and related products
CN109391473A (en) A kind of method, apparatus and storage medium of Electronic Signature
CN105072212B (en) To code method and to code system
CN113051622A (en) Index construction method, device, equipment and storage medium
CN106161501A (en) The data sharing method of virtual desktop and device
CN115269056A (en) Encryption module plug-in method and device based on class loader and related product
CN115270161A (en) Encryption method and device based on encryption plug-in and related product
CN115618382A (en) Storage method and device for shared data in alliance chain and electronic equipment
CN116257882A (en) Voting method, voting system, electronic equipment and storage medium
CN115391801A (en) Method and device for updating encryption module in block chain system and related products
CN115630393A (en) Storage method and device for shared data in alliance chain and electronic equipment
CN115618411A (en) Access method and device for shared data in alliance chain and electronic equipment
CN113986132A (en) Method, device and related product for sharing storage resources in heterogeneous network
CN112214760A (en) Application program management method and device based on credible root measurement and related products
CN115618383A (en) Method and device for storing sensitive data in alliance chain and electronic equipment
CN115618384A (en) Method and device for encrypting uplink data in alliance chain and electronic equipment
CN115348087B (en) Metadata-based quick encryption method and device and related products
CN116225341A (en) Homomorphic encryption-based data cleaning method and device and related products
CN115248931A (en) Plug-in method and device for encryption algorithm in block chain technology and related product

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination