CN116049318A - Data storage method and communication device - Google Patents

Data storage method and communication device Download PDF

Info

Publication number
CN116049318A
CN116049318A CN202310148216.1A CN202310148216A CN116049318A CN 116049318 A CN116049318 A CN 116049318A CN 202310148216 A CN202310148216 A CN 202310148216A CN 116049318 A CN116049318 A CN 116049318A
Authority
CN
China
Prior art keywords
data
written
identification
blockchain
storing
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
CN202310148216.1A
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.)
Shanghai 100me Network Technology Co ltd
Original Assignee
Shanghai 100me Network 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 Shanghai 100me Network Technology Co ltd filed Critical Shanghai 100me Network Technology Co ltd
Priority to CN202310148216.1A priority Critical patent/CN116049318A/en
Publication of CN116049318A publication Critical patent/CN116049318A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2255—Hash tables
    • 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
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

A data storage method and a communication device, the method comprising: receiving a data writing request, wherein the data writing request comprises data to be written; storing the data to be written into a mass storage node, and determining the identification of the data to be written; the identity of the data to be written is stored to the blockchain. On the one hand, the data to be written is stored to the large-capacity storage node, so that the data can be effectively stored when the amount of the data to be accessed is large; on the other hand, the identification of the data to be written is stored in the blockchain, and the characteristic of non-tampering of the blockchain is utilized, so that the identification of the data to be written is safer and not tampered, and therefore the identification of the data to be written cannot be tampered to illegally acquire the data from a mass storage node or illegally modify the data, and the storage safety of the data is ensured.

Description

Data storage method and communication device
Technical Field
The present disclosure relates to the field of computers, and in particular, to a data storage method and a communication device.
Background
With the rapid development of the information age, a large amount of data is generated every day, and some data are critical to individuals or enterprises, such as some banking records, certificate files and the like, and once lost or tampered, the data bring about an unpredictable loss to the individuals or enterprises.
When a large amount of data needs to be stored, how to realize safe storage of the data needs to be solved.
Disclosure of Invention
The application provides a data storage method and a communication device, which are used for realizing safe storage of a large amount of data.
In a first aspect, embodiments of the present application provide a data storage method, which may be performed by a communication device, which may be a terminal device or a module for a terminal device, or a server or a module for a server. The subject matter of the implementation of the method is not limited in this application. The method comprises the following steps: receiving a data writing request, wherein the data writing request comprises data to be written; storing the data to be written into a mass storage node, and determining the identification of the data to be written; the identity of the data to be written is stored to the blockchain.
According to the scheme, on one hand, the data to be written is stored to the large-capacity storage node, so that the data can be effectively stored when the amount of the data to be accessed is large; on the other hand, the identification of the data to be written is stored in the blockchain, and the characteristic of non-tampering of the blockchain is utilized, so that the identification of the data to be written is safer and not tampered, and therefore the identification of the data to be written cannot be tampered to illegally acquire the data from a mass storage node or illegally modify the data, and the storage safety of the data is ensured.
In one possible implementation, an identification of the encrypted data to be written is stored to the blockchain.
According to the scheme, the encrypted identification of the data to be written is stored in the blockchain, other users sharing the same blockchain can only inquire the encrypted identification of the data to be written, the decrypted identification of the data to be written cannot be obtained, and further the data to be written stored by the users cannot be read according to the identification of the data to be written, so that the safety of data storage is improved.
In a possible implementation method, the mass storage node includes a plurality of interstellar file system IPFS nodes, storing data to be written to the mass storage node, including: the data to be written is stored to the plurality of IPFS nodes in a decentralized manner.
According to the scheme, the data to be written are stored to the IPFS nodes in a scattered mode, the size of the data to be written is not limited, and therefore storage of a large amount of data can be achieved. IPFS is a content addressable peer-to-peer hypermedia distribution protocol, that is, data for a plurality of identical contents can be stored in one IPFS node, so that not only can the resource cost be saved, but also more data can be stored, and further, the storage of a large amount of data can be realized.
In one possible implementation method, the identifier of the data to be written is a hash value obtained after performing a hash operation on the data to be written.
According to the scheme, the hash value obtained by carrying out hash operation on the same data content is unique, the data to be written in the same content is stored in the IPFS node only once, the hash value is used as the identifier of the data to be written in, the corresponding relationship between the identifier of the data to be written in and the IPFS node can be accurately established, and the corresponding data to be written in can be rapidly and accurately determined according to the identifier of the data to be written in.
In one possible implementation, storage result information from a blockchain is received, the storage result information being used to indicate a storage condition of an identification of data to be written.
According to the scheme, the storage result information is used for indicating the storage condition of the identifier of the data to be written, if the storage is successful, the identifier of the data to be written can be queried by the access block chain according to the storage result information, and the data to be written stored in the mass storage node can be accurately acquired according to the identifier of the data to be written; if the storage fails, the storage failure reason can be determined according to the storage result information, and the problem of storage failure is solved in time according to the storage failure reason positioning problem.
In one possible implementation method, the check information corresponding to the data to be written is stored in the mass storage node, and the check information is used for recovering the data when the data to be written is lost.
According to the scheme, the verification information corresponding to the data to be written is stored to the large-capacity storage node, and when the data to be written is damaged or lost, the data to be written can be recovered according to the verification information, so that the safety of the stored data is improved.
In one possible implementation method, the data writing request further includes an identifier of a user corresponding to the data to be written.
In one possible implementation, the identity of the user is written to the blockchain.
In a second aspect, embodiments of the present application provide a communication device, including: a receiving and transmitting unit and a processing unit. The receiving and transmitting unit is used for receiving a data writing request, wherein the data writing request comprises data to be written; the processing unit is used for storing the data to be written into the mass storage node and determining the identification of the data to be written; the identity of the data to be written is stored to the blockchain.
In a possible implementation method, the processing unit is specifically configured to store the encrypted identifier of the data to be written to the blockchain.
In a possible implementation method, the mass storage node includes a plurality of interstellar file system IPFS nodes, and the processing unit is specifically configured to store data to be written to the plurality of IPFS nodes in a decentralized manner.
In one possible implementation method, the identifier of the data to be written is a hash value obtained after performing a hash operation on the data to be written.
In a possible implementation method, the transceiver unit is further configured to receive storage result information from the blockchain, where the storage result information is used to indicate a storage condition of an identifier of data to be written.
In a possible implementation method, the processing unit is further configured to store, to the mass storage node, check information corresponding to data to be written, where the check information is used to perform data recovery when the data to be written is lost.
In one possible implementation method, the data writing request further includes an identifier of a user corresponding to the data to be written.
In a possible implementation, the processing unit is further configured to write the identification of the user to the blockchain.
In a third aspect, embodiments of the present application further provide a computing device, including:
a memory for storing program instructions;
and the processor is used for calling the program instructions stored in the memory and executing any method for realizing the first aspect according to the obtained program instructions.
In a fourth aspect, embodiments of the present application further provide a computer-readable storage medium having stored therein computer-readable instructions which, when read and executed by a computer, implement any of the methods of the first aspect described above.
In a fifth aspect, embodiments of the present application provide a computer program product comprising a computer program executable by a computer device, the program, when run on the computer device, causing the computer device to perform any of the methods of implementing the first aspect.
Drawings
Fig. 1 is a schematic flow chart of a data storage method according to an embodiment of the present application;
fig. 2 is a schematic flow chart of a data storage method according to an embodiment of the present application;
fig. 3 is a flowchart of a method for determining an identifier of data to be written according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a computing device according to an embodiment of the present application.
Detailed Description
Fig. 1 is a schematic flow chart of a data storage method according to an embodiment of the present application, where the method may be performed by a communication device, and the communication device may be a terminal device or a module for a terminal device, or a server or a module for a server. The subject matter of the implementation of the method is not limited in this application.
The method comprises the following steps:
step 101, a data write request is received.
Wherein the data write request includes data to be written.
In one possible implementation method, a data writing request sent by a user is received, where the data writing request includes data to be written, where the data to be written may be transaction records, certificate files, pictures, or other data, and the type of the data to be written is not limited in the application. Illustratively, a user wishes to store a banking record over the years, and then sends a data write request containing the banking record over the years of the user.
In a possible implementation method, the data writing request further includes an identifier of a user corresponding to the data to be written, where the identifier of the user refers to identification information that can uniquely represent the user, such as an identification card number of the user, a mobile phone number, or ID information generated according to the user information, and the application does not limit the identifier of the user.
In one possible implementation method, after receiving a data writing request sent by a user, verifying whether the data writing request is legal, the application does not limit the verification method and verification content, for example, whether the user has writing authority or whether the type of the data to be written is a text document or a picture, and the like can be verified.
Step 102, storing the data to be written to the mass storage node, and determining the identification of the data to be written.
In one possible implementation, the mass storage node includes one or more interstellar file system (Inter Planetary File System, IPFS) nodes, and when the data to be written is less than a threshold, such as 256KB, the data to be written is stored in one IPFS node; when the data to be written is larger than a certain threshold value, the data to be written is partitioned, and then the partitioned data to be written is respectively stored in a plurality of IPFS nodes. For example, when the size of data to be written is 260KB, the data to be written is divided into 256KB sized block data and 4KB sized block data, the 256KB sized block data is stored in one IPFS node, and the 4KB sized block data is stored in another IPFS node. According to the scheme, the data to be written is stored to the IPFS nodes in a scattered mode, the size of the data to be written is not limited, and therefore storage of a large amount of data can be achieved. IPFS is a content addressable peer-to-peer hypermedia distribution protocol, that is, data for a plurality of identical contents can be stored in one IPFS node, so that not only can the resource cost be saved, but also more data can be stored, and further, the storage of a large amount of data can be realized.
In one possible implementation, the identification of the data to be written may be determined by the mass storage node and then sent to the communication device, or may be determined by the communication device itself.
In a possible implementation method, the identifier of the data to be written is a hash value obtained after hash operation is performed on the data to be written, and the identifier of the data to be written can be determined by other methods, and the identifier of the data to be written can only refer to the data to be written. According to the scheme, the hash value obtained by carrying out hash operation on the same data content is unique, the data to be written in the same content is stored in the IPFS node only once, the hash value is used as the identifier of the data to be written in, the corresponding relationship between the identifier of the data to be written in and the IPFS node can be accurately established, and the corresponding data to be written in can be rapidly and accurately determined according to the identifier of the data to be written in.
In one possible implementation method, the check information corresponding to the data to be written is stored in the mass storage node, and the check information is used for recovering the data when the data to be written is lost. The verification information may include part or all of the data to be written, or may be some index information, from which the content of the data to be written that is lost can be determined. The specific content of the verification information is not limited in the application. According to the scheme, the verification information corresponding to the data to be written is stored to the large-capacity storage node, and when the data to be written is damaged or lost, the data to be written can be recovered according to the verification information, so that the safety of the stored data is improved.
Step 103, the identification of the data to be written is stored to the blockchain.
In one possible implementation, the identity of the data to be written is stored directly to the blockchain.
In another possible implementation method, the identifier of the data to be written is stored in the blockchain after being encrypted. The encryption method is not limited, and the identifier of the data to be written and the identifier information of the user can be subjected to hash operation to obtain the identifier of the encrypted data to be written; or, carrying out hash operation on the identification of the data to be written and the key of the user to obtain the identification of the encrypted data to be written. According to the scheme, the encrypted identification of the data to be written is stored in the blockchain, other users sharing the same blockchain can only inquire the encrypted identification of the data to be written, the decrypted identification of the data to be written cannot be obtained, and further the data to be written stored by the users cannot be read according to the identification of the data to be written, so that the safety of data storage is improved.
In one possible implementation, storage result information from a blockchain is received, the storage result information being used to indicate a storage condition of an identification of data to be written. If the storage is successful, the returned storage result information comprises an identification of the successful storage, and the user can inquire the identification of the data to be written stored in the blockchain according to the identification of the successful storage; if the storage fails, the returned storage result information includes the reason of the storage failure and the like. According to the scheme, the storage result information is used for indicating the storage condition of the identification of the data to be written, if the storage is successful, the identification of the data to be written can be queried by the access block chain according to the storage result information, and the data to be written stored in the mass storage node can be accurately acquired according to the identification of the data to be written; if the storage fails, the storage failure reason can be determined according to the storage result information, and the problem of storage failure is solved in time according to the storage failure reason positioning problem.
In the above scheme, although the blockchain has the characteristic of non-falsification, the capacity of the blockchain for storing data is limited, if the data to be written is stored in the blockchain, when the data to be written is large, not only the waste of resources is caused, but also the storage failure is possible. Therefore, on one hand, the data to be written is stored to the mass storage node, so that the data can be effectively stored when the amount of the data to be accessed is large; on the other hand, the identification of the data to be written is stored in the blockchain, and the characteristic of non-tampering of the blockchain is utilized, so that the identification of the data to be written is safer and not tampered, and therefore the identification of the data to be written cannot be tampered to illegally acquire the data from a mass storage node or illegally modify the data, and the storage safety of the data is ensured. Tampering is performed on the identification of the data to be written, on the one hand, the user cannot access the data corresponding to the identification of the data to be written stored in the mass storage node; on the other hand, the data to be written is tampered with the identifier of the data to be written after tampering, which may be used to illegally obtain data not belonging to the user, or illegally modify the data after obtaining the data by using the identifier of the data to be written after tampering, which results in unsafe data storage.
In a possible implementation, the interaction procedure between the user, the communication device, the IPFS node and the blockchain is shown in fig. 2, and the method includes the following steps:
in step 201, the communication device receives a data write request from a user.
In step 202, the communication device sends data to be written to the IPFS node.
In one possible implementation method, the communication device sends data to be written to the IPFS node, and after the IPFS node receives the data to be written, the data to be written is encrypted, and the encrypted data to be written is stored to the IPFS node. If the data to be written is larger than a certain threshold, for example, the threshold is 256KB, the data to be written is partitioned according to the size of the threshold, the data to be written after the partitioning is respectively encrypted, and the encrypted partitioned data are respectively stored in a plurality of IPFS nodes.
In one possible implementation method, the communication device determines the verification information by adopting an erasure code fault tolerance method, and stores the verification information corresponding to the data to be written into the IPFS node. For example, the communication device divides the data to be written into K data blocks, and determines M check data blocks according to the K data blocks, where M is less than or equal to K, and M and K are positive integers. The check information includes the M check data blocks containing part or all of the data to be written. And respectively storing the K data blocks and the M check data blocks into a plurality of IPFS nodes. The method for determining the verification information is not limited in this application, and may also be used to determine the verification information by using methods such as Array erasure codes (RAID 5, RAID6, etc.), RS (Reed-Solomon) Reed-Solomon erasure codes, LDPC (LowDensity Parity Check Code), etc. Likewise, the IPFS node may also implement recovery of the data stored in the IPFS node by using the method for determining the verification information described above.
In step 203, the ipfs node sends an identification of the data to be written to the communication device.
In a possible implementation method, an IPFS node receives data to be written, determines an identifier of the data to be written according to the data to be written, and exemplarily performs a hash operation on the data to be written to obtain a hash value, where the hash value is the identifier of the data to be written, and sends the identifier of the data to be written to a communication device; similarly, other methods may be used to determine the identity of the data to be written, as this application is not limited.
In a possible implementation method, when data to be written is greater than a certain threshold, for example, the threshold is 256kb, the ipfs node blocks the data to be written according to the size of the threshold, determines the identifier of each block of data respectively, and then determines the identifier of the data to be written according to the identifier of each block of data.
The following is a specific example to illustrate how the IPFS node determines the identity of the data to be written when the data to be written is greater than a certain threshold. For example, the size of the data to be written is 1024KB, the data to be written is divided into 4 blocks, the size of the data of each block is 256KB, as shown in fig. 3, hash operation is performed on the data in each block node of fig. 3, so as to obtain hash values of 4 block nodes, namely hash value 00, hash value 01, hash value 10 and hash value 11. Then, hash operations are respectively carried out on hash values of the 4 block nodes, for example, hash operations are carried out on hash value 00 and hash value 01 to obtain hash value 0; hash operation is carried out on the hash value 10 and the hash value 11 to obtain a hash value 1, and hash operation is carried out on the hash value 0 and the hash value 1 to obtain a root hash value, wherein the root hash value is the identification of the data to be written.
In step 204, the communication device encrypts an identification of the data to be written.
In a possible implementation method, the communication device receives the identifier of the data to be written sent by the IPFS node, encrypts the identifier of the data to be written, for example, encrypts according to the key of the user and the identifier of the data to be written, and obtains the encrypted identifier of the data to be written.
In step 205, the communication device sends an identification of the encrypted data to be written to the blockchain.
In one possible implementation, the communication device sends the encrypted identification of the data to be written, the identification information of the user, the time stored to the blockchain, and the like to the blockchain.
At step 206, the blockchain stores the identification of the encrypted data to be written.
In one possible implementation, the encrypted identification of the data to be written, the identification information of the user, the time of storing in the blockchain, and the like are stored in the blockchain.
In another possible implementation method, the encrypted identifier of the data to be written, the identifier information of the user, the time stored in the blockchain and the like are digitally signed, and are stored in the blockchain in the form of an intelligent contract.
In step 207, the communication device receives the stored result information from the blockchain.
In one possible implementation method, after the block link receives a request for storing the encrypted identifier of the data to be written into the block chain, the digital signature is verified, and after the verification is passed, the encrypted identifier of the data to be written into the block chain is stored and the storage result information is returned. If the storage is successful, returning a storage success identifier, and inquiring the identifier of the data to be written stored in the blockchain after encryption by a user according to the storage success identifier; if the storage fails, the cause of the storage failure is returned.
The communication device sends 208 the stored result information to the user.
In one possible implementation, the user wants to read the data stored in the mass storage node, and sends a data read request to the communication device, where the data read request includes an identifier of the data to be written, for example, the identifier of the successful storage contained in the storage result information may be decrypted, and the identifier of the data to be written is obtained. The communication device determines data corresponding to the identification of the data to be written in the mass storage node according to the identification of the data to be written contained in the data reading request, and sends the data to the user.
Based on the same technical concept, fig. 4 exemplarily shows a communication apparatus 400 provided in an embodiment of the present application. As shown in fig. 4, the communication apparatus 400 includes: a transceiver unit 401 and a processing unit 402. Wherein, the transceiver unit 401 is configured to receive a data writing request, where the data writing request includes data to be written; a processing unit 402, configured to store data to be written to a mass storage node, and determine an identifier of the data to be written; the identity of the data to be written is stored to the blockchain.
In a possible implementation, the processing unit 402 is specifically configured to store the encrypted identifier of the data to be written to the blockchain.
In a possible implementation, the mass storage node includes a plurality of interstellar file system IPFS nodes, and the processing unit 402 is specifically configured to store data to be written to the plurality of IPFS nodes in a decentralized manner.
In one possible implementation method, the identifier of the data to be written is a hash value obtained after performing a hash operation on the data to be written.
In a possible implementation method, the transceiver unit 401 is further configured to receive storage result information from the blockchain, where the storage result information is used to indicate a storage condition of an identifier of data to be written.
In a possible implementation method, the processing unit 402 is further configured to store, to the mass storage node, check information corresponding to data to be written, where the check information is used to perform data recovery when the data to be written is lost.
In one possible implementation method, the data writing request further includes an identifier of a user corresponding to the data to be written.
In a possible implementation, the processing unit 402 is further configured to write the identification of the user to the blockchain.
Based on the same technical concept, the embodiment of the present application provides a computing device 500, as shown in fig. 5, where the computing device 500 includes at least one processor 501 and a memory 502 connected to the at least one processor, and in the embodiment of the present application, a specific connection medium between the processor 501 and the memory 502 is not limited, and in fig. 5, the processor 501 and the memory 502 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.
In the embodiment of the present application, the memory 502 stores instructions executable by the at least one processor 501, and the at least one processor 501 may perform a method for storing data by executing the instructions stored in the memory 502.
Wherein the processor 501 is a control center of the computing device 500, various interfaces and lines may be utilized to connect various portions of the computer device for resource setup by executing or executing instructions stored in the memory 502 and invoking data stored in the memory 502. Alternatively, the processor 501 may include one or more determination units, and the processor 501 may integrate an application processor and a modem processor, wherein the application processor primarily processes an operating system, a user interface, an application program, etc., and the modem processor primarily processes wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 501. In some embodiments, processor 501 and memory 502 may be implemented on the same chip, or they may be implemented separately on separate chips in some embodiments.
The processor 501 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, and may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.
The memory 502, as a non-volatile computer readable storage medium, may be used to store non-volatile software programs, non-volatile computer executable programs, and modules. The Memory 502 may include at least one type of storage medium, and may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 502 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 502 in the present embodiment may also be circuitry or any other device capable of implementing a memory function for storing program instructions and/or data.
The embodiments of the present application also provide a computer-readable storage medium storing a computer-executable program for causing a computer to perform a method for storing data as set forth in any one of the above-described modes.
Embodiments of the present application provide a computer program product comprising a computer program executable by a computer device, the program, when run on the computer device, causing the computer device to perform a method of data storage as set out in any of the above-mentioned modes.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.

Claims (10)

1. A method of data storage, comprising:
receiving a data writing request, wherein the data writing request comprises data to be written;
storing the data to be written to a mass storage node, and determining the identification of the data to be written;
and storing the identification of the data to be written into a blockchain.
2. The method of claim 1, wherein storing the identification of the data to be written to a blockchain comprises:
storing the encrypted identification of the data to be written to the blockchain.
3. The method of claim 1 or 2, wherein the mass storage node comprises a plurality of interplanetary file system, IPFS, nodes;
the storing the data to be written to a mass storage node comprises:
and storing the data to be written in a scattered manner to the plurality of IPFS nodes.
4. A method according to any one of claims 1 to 3, wherein the identification of the data to be written is a hash value obtained by hashing the data to be written.
5. The method of any one of claims 1 to 4, wherein the method further comprises:
and receiving storage result information from the blockchain, wherein the storage result information is used for indicating the storage condition of the identification of the data to be written.
6. The method of any one of claims 1 to 5, wherein the method further comprises:
and storing the verification information corresponding to the data to be written into the mass storage node, wherein the verification information is used for recovering the data when the data to be written is lost.
7. The method according to any one of claims 1 to 5, wherein the data writing request further includes an identifier of a user corresponding to the data to be written; the method further comprises the steps of:
writing the identification of the user to the blockchain.
8. A communication device, comprising a transceiver unit and a processing unit;
the receiving and transmitting unit is used for receiving a data writing request, wherein the data writing request comprises data to be written;
the processing unit is used for storing the data to be written into a mass storage node and determining the identification of the data to be written; and storing the identification of the data to be written into a blockchain.
9. A computing device, comprising:
a memory for storing program instructions;
a processor for invoking program instructions stored in the memory and performing the method according to any of claims 1-7 in accordance with the obtained program instructions.
10. A computer readable storage medium comprising computer readable instructions which, when read and executed by a computer, cause the method of any one of claims 1 to 7 to be implemented.
CN202310148216.1A 2023-02-21 2023-02-21 Data storage method and communication device Pending CN116049318A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310148216.1A CN116049318A (en) 2023-02-21 2023-02-21 Data storage method and communication device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310148216.1A CN116049318A (en) 2023-02-21 2023-02-21 Data storage method and communication device

Publications (1)

Publication Number Publication Date
CN116049318A true CN116049318A (en) 2023-05-02

Family

ID=86116536

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310148216.1A Pending CN116049318A (en) 2023-02-21 2023-02-21 Data storage method and communication device

Country Status (1)

Country Link
CN (1) CN116049318A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117349880A (en) * 2023-09-12 2024-01-05 泰州历帆科技有限公司 Distributed data storage and recording method based on block chain

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117349880A (en) * 2023-09-12 2024-01-05 泰州历帆科技有限公司 Distributed data storage and recording method based on block chain

Similar Documents

Publication Publication Date Title
EP3474209A1 (en) Storing blockchain private keys in a sim card
CN108833091B (en) Encryption method, decryption method and device for log file
CN110390525B (en) Direct access method for block chain world state and block chain node
CN113079200A (en) Data processing method, device and system
CN113472720B (en) Digital certificate key processing method, device, terminal equipment and storage medium
CN110555293A (en) Method, apparatus, electronic device and computer readable medium for protecting data
CN109145651B (en) Data processing method and device
CN111159657A (en) Application program authentication method and system
CN116049318A (en) Data storage method and communication device
CN111245897A (en) Data processing method, device, system, storage medium and processor
CN111628863B (en) Data signature method and device, electronic equipment and storage medium
US11316841B2 (en) Secure communication between an intermediary device and a network
CN115426106B (en) Identity authentication method, device and system, electronic equipment and storage medium
CN115062330B (en) TPM-based intelligent password key password application interface implementation method
CN113051622B (en) Index construction method, device, equipment and storage medium
CN105574425B (en) Access the method and device of storage data
CN108259490B (en) Client verification method and device
CN113159952A (en) Method, system, device and storage medium for storing digital assets based on block chain
CN202870831U (en) Novel computer and networking certification system
CN111639353A (en) Data management method and device, embedded equipment and storage medium
CN117113437B (en) File tampering detection method and device, computer equipment and storage medium
US11899776B2 (en) Electronic device and method for authenticating software based on blockchain
CN114567483B (en) Data transmission method and device and electronic equipment
CN110209727B (en) Data storage method, terminal equipment and medium
CN117540439B (en) Method and device for automatically authorizing number writing of equipment, storage medium and electronic equipment

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