CN107948253A - Decentralization date storage method and system, electronic equipment, storage medium - Google Patents

Decentralization date storage method and system, electronic equipment, storage medium Download PDF

Info

Publication number
CN107948253A
CN107948253A CN201711106048.0A CN201711106048A CN107948253A CN 107948253 A CN107948253 A CN 107948253A CN 201711106048 A CN201711106048 A CN 201711106048A CN 107948253 A CN107948253 A CN 107948253A
Authority
CN
China
Prior art keywords
file
stored
node
storage
memory
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.)
Granted
Application number
CN201711106048.0A
Other languages
Chinese (zh)
Other versions
CN107948253B (en
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.)
JIANGSU PAY EGIS TECHNOLOGY Co.,Ltd.
Jiangsu tongfudun blockchain Technology Co., Ltd
Original Assignee
Jiangsu Payegis 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 Jiangsu Payegis Technology Co Ltd filed Critical Jiangsu Payegis Technology Co Ltd
Priority to CN201711106048.0A priority Critical patent/CN107948253B/en
Publication of CN107948253A publication Critical patent/CN107948253A/en
Application granted granted Critical
Publication of CN107948253B publication Critical patent/CN107948253B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1804Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for stock exchange and similar applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/06Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a kind of decentralization date storage method and system, electronic equipment, storage medium, wherein, method includes:User node builds the data trade information for carrying file to be stored, and carries out the signature for authentication and broadcast to data Transaction Information;Multiple memory nodes for treating selection are downloaded file to be stored according to the data trade information of broadcast and are preserved;Multiple memory nodes for treating selection carry out the signature for authentication and broadcast to multiple first receipts;Memory node of memory node of the user node according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast as storage file to be stored.By the invention it is possible to effectively avoid since power-off, server reasons such as machine of delaying cause data centralization in prior art Dropbox to lose equivalent risk.Meanwhile a large amount of idle memory spaces are used, more save resource.

Description

Decentralization date storage method and system, electronic equipment, storage medium
Technical field
The present invention relates to field of data storage, more particularly to a kind of decentralization date storage method and system, electronics to set Standby, storage medium.
Background technology
With the development of science and technology, cloud storage is also more and more easily accepted by a user.File can be uploaded to cloud and deposited by user In the Dropbox of storage.Dropbox provides a variety of file management facilities such as the storage of file, access, backup, shared to the user, facilitates user File in management, editor's Dropbox.But this storage mode is there is also problem, such as power-off, server machine reason of delaying cause net Data centralization in disk loses equivalent risk.Further, using Dropbox, there is also transmission speed is slow, redundancy backup, recovery capability It is low, security is poor, enterprise operation is of high cost, user charge it is high the problems such as.On the other hand, due to hardware device, software technology Development so that the price of storage system is also more and more cheaper, and memory capacity is also increasing, and also resulting in ordinary user has greatly The situation that the memory space of amount leaves unused.
Therefore, it is necessary to a kind of a large amount of memory spaces to be left unused using ordinary user, and storage price will be than centralization Dropbox Store less expensive, the safer decentralization date storage method of file storage.
The content of the invention
The present invention goal of the invention be the defects of being directed to the prior art, there is provided a kind of decentralization date storage method and System, electronic equipment, storage medium, leave unused for solving a large amount of memory spaces of ordinary user in the prior art, Dropbox charge is high, There are the problems such as risk for file storage.
According to an aspect of the invention, there is provided a kind of decentralization date storage method, including:
User node builds the data trade information for carrying file to be stored, and data Transaction Information is carried out to be used for body The signature of part certification and broadcast;
Multiple memory nodes for treating selection are downloaded file to be stored according to the data trade information of broadcast and are preserved;
Multiple memory nodes for treating selection carry out the signature for authentication and broadcast to multiple first receipts;Wherein, Multiple first receipts are generated by multiple memory nodes after selection after downloading and having preserved file to be stored respectively;
Memory node of the user node according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast Memory node as storage file to be stored.
According to another aspect of the present invention, a kind of decentralization data-storage system is additionally provided, including:User node With multiple memory nodes for treating selection;
User node is used for:Structure carries the data trade information of file to be stored, and data Transaction Information is carried out Signature and broadcast for authentication;Corresponding to the first receipt for choosing one or more broadcast according to default Algorithms of Selecting Memory node of the memory node as storage file to be stored;
Treat that the memory node of selection is used for:The data trade information broadcasted according to user node is downloaded file to be stored and is protected Deposit;Signature for authentication and broadcast are carried out to multiple first receipts;Wherein, multiple first receipts are respectively by multiple to be selected The memory node selected generates after downloading and having preserved file to be stored.
According to another aspect of the invention, there is provided a kind of electronic equipment, including:Processor, memory, communication interface and Communication bus, the processor, the memory and the communication interface complete mutual communication by the communication bus;
The memory is used to store an at least executable instruction, and it is above-mentioned that the executable instruction performs the processor The corresponding operation of decentralization date storage method.
In accordance with a further aspect of the present invention, there is provided a kind of computer-readable storage medium, be stored with the storage medium to A few executable instruction, the executable instruction make processor perform such as the corresponding behaviour of above-mentioned decentralization date storage method Make.
Decentralization date storage method and system, electronic equipment, the storage medium provided according to the present invention, user node Structure carries the data trade information of file to be stored, and data Transaction Information is carried out for the signature of authentication and wide Broadcast;Multiple memory nodes for treating selection are downloaded file to be stored according to the data trade information of broadcast and are preserved;It is multiple to wait to select Memory node multiple first receipts are carried out with the signature for authentication and broadcast, multiple first receipts are treated by multiple respectively The memory node of selection generates after downloading and having preserved file to be stored;User node chooses one according to default Algorithms of Selecting Or the corresponding memory node of the first receipt of multiple broadcast is as the memory node for storing the file to be stored.By this hair It is bright, can effectively it avoid since power-off, server reasons such as machine of delaying cause the data centralization in prior art Dropbox to lose Equivalent risk.Meanwhile a large amount of idle memory spaces are used, more save resource.
Brief description of the drawings
By reading the detailed description of hereafter preferred embodiment, it is various other the advantages of and benefit it is common for this area Technical staff will be clear understanding.Attached drawing is only used for showing the purpose of preferred embodiment, and is not considered as to the present invention Limitation.And in whole attached drawing, identical component is denoted by the same reference numerals.In the accompanying drawings:
Fig. 1 shows the flow diagram of decentralization date storage method according to an embodiment of the invention;
Fig. 2 shows the flow diagram of decentralization date storage method in accordance with another embodiment of the present invention;
Fig. 3 shows the illustrative view of functional configuration of decentralization data-storage system according to an embodiment of the invention;
Fig. 4 shows the structure diagram of a kind of electronic equipment according to an embodiment of the invention.
Embodiment
The exemplary embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although the disclosure is shown in attached drawing Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here Limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure Completely it is communicated to those skilled in the art.
Fig. 1 shows the flow diagram of decentralization date storage method according to an embodiment of the invention, such as Fig. 1 Shown, this method specifically comprises the following steps:
Step S101, user node build the data trade information for carrying file to be stored, and to data Transaction Information Carry out the signature for authentication and broadcast.
The present invention is based on P2P real-time performances, wherein, user node also refers to the payment transaction amount of money as storage file The terminal device used by a user of expense.Subscriber terminal equipment can be client or server.User node selects The file for wanting storage is selected as file to be stored, and data trade information is built according to file to be stored.Wherein, data trade Information carries file to be stored.To protect the safety of file to be stored, file to be stored can be encrypted in user node, Specific Encryption Algorithm can voluntarily be selected according to performance by user node.Further comprises in data trade information storage duration, Redundancy number, transaction payment amount etc..Store the time that duration, that is, user node prepares to store file to be stored.Redundancy number The number for the file to be stored backup storage specified for user node.Transaction payment amount is that user node is file to be stored branch The storage charges paid is used.Transaction payment amount can use such as bit coin, the ether mill means of payment.Such as by digital signature side The ownership transfer for the amount of money that formula holds user node in itself is to intelligent contract.Wherein, taking-up gold is defined in intelligent contract The condition of volume, it is necessary to send the receipt signed with user node and taking-up person to intelligent contract when such as taking out the amount of money.Transaction branch It is user node total storage charges use that to be file to be stored pays according to redundancy number to pay the amount of money, such as transaction payment amount 500, 10 parts of redundancy number, the expense of 1 part of storage of file to be stored is 500/10=50.
After user node structure data trade information, signed using oneself privately owned private key to data Transaction Information, So as to which the user information using the user's node can be carried in the data trade information, the data trade is believed after convenient Breath carries out authentication.After signature, the data trade information of signature is broadcast to the whole network, facilitates each node of the whole network to receive The data trade information.
Step S102, multiple memory nodes for treating selection are downloaded file to be stored according to the data trade information of broadcast and are protected Deposit.
Memory node preserves file to be stored, the memory space for earning transaction payment amount provides to provide memory space Storage terminal device used in business.Space provider can be common computer user, its memory space provided can Think the disk space of common computer.In this way, transaction payment amount can be well below using needed for centralization storage Dropbox The expense to be paid.The quantity of common computer owns far more than the quantity of centralization storage server (server backup) Common computer powers off, the probability for machine of delaying is very low, has ensured the safety using common computer storage file to be stored.With User node function is identical, when user node as client in use, memory node can also be client;Work as user node As server in use, memory node can also be server.
Memory node has multiple, and multiple memory nodes are the memory node that user node treats selection, and user node is final One or more memory nodes can therefrom be selected as final memory node to store the file to be stored.It is multiple to wait to select Memory node after the data trade information that uppick user node is broadcasted, can according to data trade information download it is to be stored The local of file to memory node is preserved.
Step S103, multiple memory nodes for treating selection carry out multiple first receipts for the signature of authentication and wide Broadcast.
After multiple memory nodes after selection are downloaded and preserve completion file to be stored, multiple memory nodes for treating selection In each memory node for treating selection can generate the first receipt.Wherein, the first receipt includes file to be stored Hash, waits to deposit Store up the information such as the storage time of file.Each treat that the memory node of selection respectively signs the first corresponding receipt, So as to carry the information of the memory space provider using the memory node in first receipt, it is convenient after to this One receipt carries out authentication.Afterwards, the first receipt of signature is broadcasted to the whole network.
Step S104, user node is according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast Memory node is as the memory node for storing the file to be stored.
User node, can be according to default selection after the first receipt that the multiple memory nodes after selection of uppick are broadcasted One or more corresponding memory node of the first receipt of algorithm picks is the final memory node for preserving file to be stored. Default Algorithms of Selecting can be random algorithm, or deterministic algorithm.It is high in view of the computational efficiency of deterministic algorithm, it is excellent Choosing uses deterministic algorithm.If hashing algorithm safe to use (Secure Hash Algorithm, abbreviation SHA) is to multiple to be selected The memory node selected rems, then spaced pick, chooses final memory node.Selected suitably according to actual conditions during implementation Deterministic algorithm, does not limit herein.
The decentralization date storage method provided according to the present invention, user node build the number for carrying file to be stored The signature for authentication and broadcast are carried out according to Transaction Information, and to data Transaction Information;Multiple memory nodes for treating selection File to be stored is downloaded according to the data trade information of broadcast and is preserved;Multiple memory nodes for treating selection are to multiple first receipts The signature for authentication and broadcast are carried out, multiple first receipts are being downloaded and protected by multiple memory nodes for treating selection respectively Generated after having deposited file to be stored;The first receipt institute that user node chooses one or more broadcast according to default Algorithms of Selecting is right The memory node answered is as the memory node for storing the file to be stored.By the invention it is possible to effectively avoid due to disconnected The reasons such as machine of electricity, server delaying cause the data centralization in prior art Dropbox to lose equivalent risk.Meanwhile will be a large amount of idle Memory space is used, and more saves resource.
Fig. 2 shows the flow diagram of decentralization date storage method in accordance with another embodiment of the present invention, such as Shown in Fig. 2, this method specifically comprises the following steps:
Step S201, user node calculate the magnetic force link of file to be stored, and structure data trade letter is linked according to magnetic force Breath.
The magnetic force link of the file to be stored is calculated after it have selected file to be stored in user node.Magnetic force links It may insure that the file to be stored downloaded by the link is accurate.Structure data trade information is linked according to magnetic force.Wherein, Data trade information carries file to be stored.To protect the safety of file to be stored, user node can be to file to be stored It is encrypted, specific Encryption Algorithm can voluntarily be selected according to performance by user node.It further comprises in data trade information Store duration, redundancy number, transaction payment amount etc..
Step S202, user node carry out the signature for authentication and broadcast to data Transaction Information.
After user node structure data trade information, data Transaction Information is carried out using oneself privately owned private key to be used for body The signature of part certification, and the whole network is broadcast to, facilitate each node of the whole network to receive the data trade information.
Step S203, multiple memory nodes for treating selection judge whether to preserve to be stored according to the data trade information of broadcast File.
Multiple memory nodes after selection, can be according to data after the data trade information that uppick user node is broadcasted Transaction Information is to determine whether preserve file to be stored.As multiple memory nodes for treating selection are carried according in data trade information The size of file to be stored, storage duration, transaction payment amount be to determine whether file to be stored will be preserved, if treating selection Memory node thinks to have enough space storage files to be stored, storage duration, transaction payment amount rationally etc. can perform step Rapid S204.Or treat that the memory node of selection does not have enough space storage file to be stored, storage duration and transaction payment gold Volume can not do any place compared to unreasonable (amount of money is too low) etc. after the data trade information that uppick user node is broadcasted Reason.
Step S204, multiple memory nodes for treating selection are downloaded file to be stored and are preserved.
Multiple memory nodes when selection, can be according in data trade information when judging to preserve file to be stored File to be stored is downloaded in magnetic force link, saves it in the local for the memory node for treating selection.
While multiple memory nodes for treating selection download file to be stored, (file byte can be accumulated the byte age The number * times).The accumulation at byte age can be used for weighing the preservation file to be stored whether memory node fulfils the duty, and be additionally operable to count Whether the storage time for calculating file to be stored has reached the storage duration that user node is specified.
Step S205, multiple memory nodes for treating selection carry out multiple first receipts for the signature of authentication and wide Broadcast.
After multiple memory nodes after selection are downloaded and preserve completion file to be stored, multiple memory nodes for treating selection The first receipt can be generated.Wherein, the first receipt includes file to be stored Hash, the storage time of file to be stored, file and deposits Store up the information such as information.Multiple memory nodes for treating selection carry out the first receipt the signature for authentication and broadcast to complete Net.
Step S206, user node are detected multiple memory nodes for treating selection, judge multiple storages for treating selection Whether node completely downloads file to be stored.
User node can be preserved the first receipt after the first receipt of uppick.Then selection is treated to multiple Memory node is detected.Specifically, user node is detected multiple memory nodes for treating selection using detection algorithm, inspection The purpose of survey is used to judge whether multiple memory nodes for treating selection completely download file to be stored, in order to avoid treat the storage section of selection The file to be stored that point is downloaded is imperfect.Detection algorithm can be such as to inquire multiple memory node specified file fragments for treating selection Cryptographic Hash.User node can randomly select offset and length in file to be stored, extract file to be stored This segment data, calculates its cryptographic Hash.The each memory node for treating selection for having downloaded file to be stored is required to provide at the same time same The cryptographic Hash of sample offset and the file to be stored of the length segment data.User node detects each memory node meter for treating selection Whether the cryptographic Hash of calculation and the result oneself calculated are consistent.After random detection above-mentioned several times, if cryptographic Hash is equal every time Equally, it may be considered that file to be stored is downloaded completely by each memory node for treating selection.Alternatively, it can also allow multiple Treat a hash algorithm calculation document Hash (the whole file to be stored calculating that the memory node of selection is specified using user node File Hash), the result obtained with user node oneself calculation document Hash is verified, can be with if result of calculation is consistent Thinking file to be stored has been treated, the memory node of selection is downloaded completely.Complete download the multiple of file to be stored are waited to select Memory node, continue to execute step S207;Multiple memory nodes for treating selection to not downloading file to be stored completely, no Do any processing.
Alternatively, the first receipt of the memory node to not downloading file to be stored completely can abandon, not to it Carry out subsequent treatment.
Further, can also mutually be detected between multiple memory nodes, as randomly selected text to be stored between memory node Offset and length in part, extract this segment data of file to be stored, calculate its cryptographic Hash.Require other storages at the same time Node provides the cryptographic Hash of same offset and the file to be stored of the length segment data, to detect whether the knot calculated with oneself Fruit is consistent.So can in order to reject falseness memory node.Can also be by exchanging each storage between multiple memory nodes The specified portions data message of file, detects whether the presence of false memory node.Pass through the phase between multiple memory nodes Mutually detection, can be supplied to and preferably be serviced to user node.
Step S207, user node is according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast Memory node of the memory node as storage file to be stored.
The memory node that user node can detect to have downloaded file to be stored completely through step S206, further according to Default Algorithms of Selecting chooses final memory node from these memory nodes.User node is therefrom selected according to default Algorithms of Selecting One or more corresponding memory node of the first receipt is taken as the final memory node for preserving file to be stored.Default choosing It can be random algorithm to take algorithm, or deterministic algorithm.It is high in view of the computational efficiency of deterministic algorithm, preferably using Deterministic algorithm.As hashing algorithm safe to use (Secure Hash Algorithm, abbreviation SHA) treats that selection is deposited to multiple Storage node rems, then spaced pick, chooses final memory node.During implementation suitable certainty is selected according to actual conditions Algorithm, does not limit herein.
Step S208, user node carry out the first receipt of selection the signature for authentication, obtain the second receipt And broadcasted.
User node carries out signature for authentication to the first receipt of selection using private key, that is, indicate selection these The corresponding memory node of first receipt is as final memory node.User node is signed to obtain second time to the first receipt Hold.The information such as file to be stored Hash, the storage time of file to be stored, file storage information are contained in second receipt and are deposited Store up the signature of node.Meanwhile second signature that further comprises user node in receipt.User node broadcasts the second receipt to complete Net.Memory node can preserve second receipt according to the signature of oneself in the second receipt.
Step S209, what user node broadcast carried the second receipt fetches instruction.
When user node needs to fetch stored file to be stored, user node broadcast carries the second receipt Instruction is fetched to the whole network.Wherein, the second receipt randomly selected for user node from multiple second receipts one or more the Two receipts, to fetch the file to be stored that corresponding memory node is stored.User node chooses multiple second receipts, to prevent Only problem occurs for some memory nodes, can not return to file to be stored.As memory node releases file to be stored in advance, delays Machine, network signal are bad to be connected.
Step S210, memory node obtain corresponding storage file and return to use according to the second receipt fetched in instruction Family node.
After instruction is fetched in memory node uppick, according to fetch on the second receipt that instruction carries oneself sign, text Part storage information (such as file storage address information) can find the file of corresponding storage from disk, and (i.e. user node is treated Storage file).
The information such as the IP address of user node can also be included by fetching in instruction, facilitate memory node can be with user node Point-to-point connection is established, corresponding storage file is directly returned to user node.Avoid storage file excessive, the whole network broadcast is made The problems such as into network blockage.Further, when user node broadcast fetch instruction in carry multiple second receipts when, Duo Ge The corresponding multiple memory nodes of two receipts return to storage file to user node.User node can according to the needs of oneself, Any one memory node of random selection, preserves the storage file of memory node return, and other memory nodes are returned Storage file no longer preserves;Or the storage file that can also be returned to multiple memory nodes preserves, convenient backup etc. needs Ask.
Step S211, discharges stored file to be stored, obtains the transaction payment amount that user node is paid.
In the case where the storage time of file to be stored exceedes storage duration, memory node can be by broadcasting second time Hold to obtain the expense of file to be stored.If memory node broadcast is for the second receipt of intelligent contract, according in the second receipt The signature of user node and the signature of memory node, can get the transaction payment gold that user node is paid in intelligent contract Volume.Memory node understands the active broadcast after file to be stored reaches storage duration to obtain transaction payment amount.Second receipt In have recorded the storage time of file to be stored, detect the storage time of current time-file to be stored value whether be more than or Equal to storage duration, if more than or equal to store duration, i.e. memory node has completed the storage duration of user node requirement, can To discharge stored file to be stored, and obtain the transaction payment amount of user node payment.It is also assumed that storage section Point gets the transaction not spent output (the Unspent Transaction of a passage time (storage duration) locking Outputs, abbreviation UTXO).After storage duration is reached, the spendable amount of money of memory node is automatically become.Unlock can use The whole network common recognition is unlocked, and effectively prevents memory node from getting transaction payment amount in advance.
The decentralization date storage method provided according to the present invention, effectively have detected whether memory node completely preserves File to be stored, has ensured the integrality of file to be stored.When user node is fetched, memory node can be by point-to-point direct File is returned into user node, reduces network blockage.Memory node can be after storage duration be reached, and active broadcast second returns Hold, to obtain the transaction payment amount of user node payment.
Fig. 3 shows the functional block diagram of decentralization data-storage system according to an embodiment of the invention, such as Fig. 3 institutes Show, user node 310 and multiple memory nodes 320 for treating selection are included in the system.
The present invention is based on P2P real-time performances, wherein, user node 310 also refers to the payment transaction amount of money as storage The subscriber terminal equipment used by a user of Document Charge.Subscriber terminal equipment can be client or server.Deposit Node 320 is stored up to provide memory space, preserves file to be stored, the memory space provider for earning transaction payment amount is used Storage terminal device.Space provider can be common computer user, there is provided memory space can be common meter The disk space of calculation machine.In this way, transaction payment amount can be well below the expense that pays required for using centralization storage Dropbox With.The quantity of common computer is far more than the quantity of centralization storage server (server backup), all common computers Power off, the probability for machine of delaying it is very low, ensured using common computer storage file to be stored safety.And user node 310 functions are identical, when user node 310 as client in use, memory node 320 can also be client;When user saves Point 310 is as server in use, memory node 320 can also be server.
User node 310, which is used to build, carries the data trade information of file to be stored, and to data Transaction Information into Signature and broadcast of the row for authentication.
The selection of user node 310 wants the file of storage and builds data as file to be stored, and according to file to be stored Transaction Information.Wherein, data trade information carries file to be stored.To protect the safety of file to be stored, user node 310 File to be stored can be encrypted, specific Encryption Algorithm can voluntarily be selected according to performance by user node 310.Data It further comprises storage duration, redundancy number, transaction payment amount etc. in Transaction Information.Storage duration, that is, user node 310 prepares The time that file to be stored is stored.The number for the file to be stored backup storage that redundancy number is specified for user node 310.Hand over Easy payment is that user node 310 is that the storage charges that file to be stored is paid is used.Transaction payment amount can use such as bit The means of payment such as coin, ether mill.The ownership for the amount of money for such as being held user node 310 by digital signature mode in itself turns Move on to intelligent contract.Wherein, the condition for taking out the amount of money is defined in intelligent contract, it is necessary to intelligent contract when such as taking out the amount of money Send the receipt signed with user node 310 and taking-up person.Transaction payment amount be user node 310 be file to be stored by Used according to total storage charges that redundancy number is paid, such as transaction payment amount 500,10 parts of redundancy number, 1 part of storage of file to be stored Expense be 500/10=50.
When user node 310 builds data trade information, the file to be stored is calculated in the file to be stored of selection Magnetic force link.It is accurate that magnetic force links the file to be stored that may insure to download by the link.310 basis of user node Magnetic force link structure data trade information.Afterwards, user node 310 carries out data Transaction Information using oneself privately owned private key Signature, so that the user information using the user's node can be carried in the data trade information, it is convenient later to the data Transaction Information carries out authentication.After signature, the data trade information of signature is broadcast to the whole network, facilitates each section of the whole network Point receives the data trade information.
Treat that the data trade information that the memory node 320 of selection is used to broadcast according to user node downloads file to be stored simultaneously Preserve.
Multiple memory nodes 320 after selection are after the data trade information that uppick user node 310 is broadcasted, Ke Yigen According to data trade information to determine whether preserving file to be stored.If multiple memory nodes 320 for treating selection are according to data trade The size of the file to be stored carried in information, storage duration, transaction payment amount to determine whether to preserve file to be stored, If treating, the memory node 320 of selection thinks to have enough space storage files to be stored, storage duration, transaction payment amount reasonable Deng file to be stored can be downloaded and preserve by treating the memory node 320 of selection.Or treat the memory node 320 of selection without foot Enough spaces store file to be stored, storage duration compares unreasonable (amount of money is too low) etc. with transaction payment amount, can receive It is without any processing after hearing the data trade information that user node 310 is broadcasted.
Multiple memory nodes 320 when selection, can be according to data trade information when judging to preserve file to be stored In magnetic force link download file to be stored, save it in the local of the memory node 320 for treating selection.
While multiple memory nodes 320 for treating selection download file to be stored, byte age (file word can be accumulated The joint number * times).The accumulation at byte age can be used for weighing the preservation file to be stored whether memory node 320 fulfils the duty, and also use The storage duration that user node 310 specifies whether is reached in the storage time for calculating file to be stored.
Treat that the memory node 320 of selection is used to carry out the signature for authentication and broadcast to multiple first receipts.
After multiple memory nodes 320 after selection are downloaded and preserve completion file to be stored, multiple storages for treating selection Each memory node 320 for treating selection can generate the first receipt in node 320.Wherein, the first receipt includes text to be stored The information such as part Hash, the storage time of file to be stored, file storage information.Each memory node 320 for treating selection is to respectively Sign to the first corresponding receipt, the carry out authentication signed to each memory node 320.Afterwards, wait to select Memory node 320 first receipt of signature is broadcasted to the whole network.
Depositing corresponding to the first receipt that user node 310 is used to choose one or more broadcast according to default Algorithms of Selecting Node 320 is stored up as the memory node for storing the file to be stored.
User node 310 can be preserved the first receipt after the first receipt of uppick.Then wait to select to multiple Memory node 320 be detected.Specifically, user node 310 using detection algorithm to multiple memory nodes 320 for treating selection It is detected, the purpose of detection is used to judge whether multiple memory nodes 320 for treating selection completely download file to be stored, in order to avoid Treat that the file to be stored that the memory node 320 of selection is downloaded is imperfect.Detection algorithm can be such as to inquire multiple to treat depositing for selection Store up the cryptographic Hash of 320 specified file fragment of node.User node 310 can randomly select offset in file to be stored and Length, extracts this segment data of file to be stored, calculates its cryptographic Hash.Require to have downloaded each of file to be stored at the same time Treat that the memory node 320 of selection provides the cryptographic Hash of the file to be stored of the same offset and length segment data.User node Whether the cryptographic Hash that each memory node 320 for treating selection of 310 detections calculates and the result oneself calculated are consistent.By several times After above-mentioned random detection, if cryptographic Hash is every time, it may be considered that file to be stored has been treated the storage section of selection Point 320 is downloaded completely.Alternatively, one that multiple memory nodes 320 for treating selection can also be allowed to be specified using user node 310 is breathed out Uncommon algorithm calculation document Hash (whole file to be stored calculation document Hash), with user node 310 oneself calculation document Hash Obtained result is verified, if result of calculation is consistent, it may be considered that file to be stored has been treated the memory node of selection 320 download completely.
Alternatively, it is not right to that can not abandon the first receipt of the memory node 320 that file to be stored is downloaded completely It carries out subsequent treatment.
Further, it can also mutually detect between multiple memory nodes 320, be treated as randomly selected between memory node 320 Offset and length in storage file, extract this segment data of file to be stored, calculate its cryptographic Hash.Require it at the same time His memory node 320 provides the cryptographic Hash of the file to be stored of the same offset and length segment data, to detect whether and oneself The result that oneself calculates is consistent.So can in order to reject falseness memory node 320.Can be between multiple memory nodes 320 By exchanging the specified portions data message of respective storage file, the presence of false memory node is detected whether.By multiple Mutual detection between memory node 320, can be supplied to and preferably be serviced to user node 310.
The storage for treating selection that user node 310 can detect to have downloaded file to be stored completely through above-mentioned detection Node 320, final memory node is chosen further according to default Algorithms of Selecting from these memory nodes 320.User node 310 The corresponding memory node 320 of one or more first receipt is therefrom chosen according to default Algorithms of Selecting to wait to deposit for final preserve Store up the memory node of file.Default Algorithms of Selecting can be random algorithm, or deterministic algorithm.Calculated in view of certainty The computational efficiency of method is high, preferably using deterministic algorithm.Such as hashing algorithm safe to use (Secure Hash Algorithm, letter Claim SHA) rem to multiple memory nodes 320 for treating selection, then spaced pick, choose final memory node.Root during implementation Suitable deterministic algorithm is selected according to actual conditions, is not limited herein.
Further, user node 310 carries out signature for authentication to the first receipt of selection using private key, that is, marks It is bright to select the corresponding memory node 320 of these first receipts to be used as final memory node.User node 310 carries out the first receipt Signature for authentication obtains the second receipt.File to be stored Hash is contained in second receipt, file to be stored is deposited Store up the signature of the information such as time, file storage information and memory node.Meanwhile second further comprises user node 310 in receipt Signature.User node 310 broadcasts the second receipt to the whole network.Memory node 320 can according to the signature of oneself in the second receipt, Preserve second receipt.
Further, when user node 310 needs to fetch stored file to be stored, the broadcast of user node 310 is taken Instruction is fetched to the whole network with the second receipt.Wherein, the second receipt randomly selects for user node from multiple second receipts The second receipt of one or more, to fetch the file to be stored that corresponding memory node is stored.User node is chosen more A second receipt, to prevent some memory nodes from problem occurs, can not return to file to be stored.As memory node releases in advance File to be stored, machine of delaying, network signal are bad to be connected.After instruction is fetched in 320 uppick of memory node, memory node 320 according to the signature of oneself on the second receipt for fetching instruction carrying, file storage information (such as believe by file storage address Breath) the corresponding file (i.e. the file to be stored of user node) stored can be found from disk.Fetching can also wrap in instruction The information such as the IP address containing user node 310, facilitate memory node 320 to establish point-to-point connection with user node 310, will Corresponding storage file is directly returned to user node 310.It is excessive to avoid storage file, the whole network broadcast causes network blockage etc. Problem.Further, when user node broadcast fetch instruction in carry multiple second receipts when, multiple second receipts are corresponding Multiple memory nodes return to storage file to user node.User node can appoint according to the needs of oneself, random selection One memory node, preserves the storage file of memory node return, and the storage file returned to other memory nodes is no longer Preserve;Or the storage file that can also be returned to multiple memory nodes preserves, the demand such as convenient backup.
Further, in the case where the storage time of file to be stored exceedes storage duration, memory node 320 can pass through The second receipt is broadcasted to obtain the expense of file to be stored.If the broadcast of memory node 320 is for the second receipt of intelligent contract, root According to the signature of user node 310 in the second receipt and the signature of memory node 320, user node in intelligent contract can be got 310 transaction payment amounts paid.Memory node 320 can be reached in file to be stored and stored to obtain transaction payment amount Active broadcast after duration.It has recorded the storage time of file to be stored in second receipt, detection current time-file to be stored Whether the value of storage time is greater than or equal to storage duration, and if more than or equal to store duration, i.e. memory node 320 has been completed The storage duration of user node requirement, can discharge stored file to be stored, and obtain the friendship of the payment of user node 310 Easy payment.It is also assumed that memory node 320 gets the friendship not spent of a passage time (storage duration) locking Easily output (Unspent Transaction Outputs, referred to as UTXO).After storage duration is reached, storage is automatically become The 320 spendable amount of money of node.Unlock can use the whole network common recognition to be unlocked, and effectively prevent memory node 320 from obtaining in advance Get transaction payment amount.
The decentralization data-storage system provided according to the present invention, user node build the number for carrying file to be stored The signature for authentication and broadcast are carried out according to Transaction Information, and to data Transaction Information;Multiple memory nodes for treating selection File to be stored is downloaded according to the data trade information of broadcast and is preserved;Multiple memory nodes for treating selection are to multiple first receipts The signature for authentication and broadcast are carried out, multiple first receipts are being downloaded and protected by multiple memory nodes for treating selection respectively Generated after having deposited file to be stored;The first receipt institute that user node chooses one or more broadcast according to default Algorithms of Selecting is right The memory node answered is as the memory node for storing the file to be stored.By the invention it is possible to effectively avoid due to disconnected The reasons such as machine of electricity, server delaying cause the data centralization in prior art Dropbox to lose equivalent risk.Meanwhile will be a large amount of idle Memory space is used, and more saves resource.Meanwhile effectively have detected whether memory node completely preserves file to be stored, The integrality of file to be stored is ensured.When user node is fetched, memory node directly can be returned to file by point-to-point To user node, network blockage is reduced.Memory node can be after storage duration be reached, the second receipt of active broadcast, to obtain The transaction payment amount for taking user node to pay.
Present invention also provides a kind of nonvolatile computer storage media, the computer-readable storage medium is stored with least One executable instruction, the computer executable instructions can perform the decentralization data storage side in above-mentioned any means embodiment Method.
Fig. 4 shows the structure diagram of a kind of electronic equipment according to an embodiment of the invention, and the present invention is specific real Specific implementation of the example not to electronic equipment is applied to limit.
As shown in figure 4, the electronic equipment can include:Processor (processor) 402, communication interface (Communications Interface) 404, memory (memory) 406 and communication bus 408.
Wherein:
Processor 402, communication interface 404 and memory 406 complete mutual communication by communication bus 408.
Communication interface 404, for communicating with the network element of miscellaneous equipment such as client or other servers etc..
Processor 402, for executive program 410, can specifically perform above-mentioned decentralization date storage method embodiment In correlation step.
Specifically, program 410 can include program code, which includes computer-managed instruction.
Processor 402 is probably central processor CPU, or specific integrated circuit ASIC (Application Specific Integrated Circuit), or be arranged to implement the embodiment of the present invention one or more integrate electricity Road.The one or more processors that electronic equipment includes, can be same type of processors, such as one or more CPU;Also may be used To be different types of processor, such as one or more CPU and one or more ASIC.
Memory 406, for storing program 410.Memory 406 may include high-speed RAM memory, it is also possible to further include Nonvolatile memory (non-volatile memory), for example, at least a magnetic disk storage.
Program 410 specifically can be used for so that processor 402 performs following operation:
In a kind of optional embodiment, program 410 is used for so that the structure carrying of 402 user node of processor needs to be deposited The data trade information of file is stored up, and the signature for authentication and broadcast are carried out to data Transaction Information;It is multiple to wait to select Memory node downloaded and file to be stored and preserve according to the data trade information of broadcast;Multiple memory nodes for treating selection are to more A first receipt carries out the signature for authentication and broadcast;Wherein, multiple first receipts treat depositing for selection by multiple respectively Storage node generates after downloading and having preserved file to be stored;User node is chosen one or more wide according to default Algorithms of Selecting Memory node of the memory node corresponding to the first receipt broadcast as storage file to be stored.
In a kind of optional embodiment, when program 410 is used for so that 402 data trade information of processor includes storage Long, redundancy number and/or transaction payment amount.
In a kind of optional embodiment, program 410 is used for so that 402 user node of processor calculates file to be stored Magnetic force link, according to magnetic force link structure data trade information.
In a kind of optional embodiment, program 410 is used for so that more than 402 memory node roots for treating selection of processor Judge whether to preserve file to be stored according to the data trade information of broadcast;If so, multiple memory nodes for treating selection are downloaded and wait to deposit Storage file simultaneously preserves.
In a kind of optional embodiment, program 410 is used for so that 402 user node of processor treats selection to multiple Memory node is detected, and judges whether multiple memory nodes for treating selection completely download file to be stored.
In a kind of optional embodiment, program 410 is used for so that 402 user node of processor utilizes detection algorithm pair Multiple memory nodes for treating selection are detected;Detection algorithm includes inquiring multiple memory node specified file fragments for treating selection Cryptographic Hash and/or allow multiple memory nodes for treating selection using hash algorithm calculation document Hash verification result of calculation.
In a kind of optional embodiment, program 410 is used for so that 402 user node of processor is to first time of selection Hold and sign, obtain the second receipt and broadcasted.
In a kind of optional embodiment, program 410 is used for so that the broadcast of 402 user node of processor carries second Receipt fetches instruction;Memory node obtains corresponding storage file and returns to user node according to instruction is fetched.
In a kind of optional embodiment, program 410 is used to cause 402 memory node of processor to broadcast the second receipt, And the file to be stored of storage is discharged, obtain the transaction payment amount that user node is paid.
In a kind of optional embodiment, program 410 be used for so that more than 402 memory nodes for treating selection of processor it Between mutually detect and/or exchange the data message of respective storage file.
In program 410 specific implementation of each step may refer to corresponding steps in above-mentioned encipheror identification embodiment and Corresponding description in unit, this will not be repeated here.It is apparent to those skilled in the art that for description convenience and Succinctly, the specific work process of the equipment of foregoing description and module, the corresponding process that may be referred in preceding method embodiment are retouched State, details are not described herein.
The scheme provided through this embodiment, user node build the data trade information for carrying file to be stored, and Signature for authentication and broadcast are carried out to data Transaction Information;Multiple memory nodes for treating selection are according to the data of broadcast Transaction Information is downloaded file to be stored and is preserved;Multiple memory nodes for treating selection to multiple first receipts for identity recognize The signature of card and broadcast, multiple first receipts are being downloaded by multiple memory nodes for treating selection respectively and are being preserved file to be stored After generate;Memory node of the user node according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast is made To store the memory node of the file to be stored.By the invention it is possible to effectively avoid since power-off, server are delayed machine etc. Reason causes the data centralization in prior art Dropbox to lose equivalent risk.Meanwhile a large amount of idle memory spaces are subject to profit With more saving resource.
Algorithm and display be not inherently related to any certain computer, virtual system or miscellaneous equipment provided herein. Various general-purpose systems can also be used together with teaching based on this.As described above, required by constructing this kind of system Structure be obvious.In addition, the present invention is not also directed to any certain programmed language.It should be understood that it can utilize various Programming language realizes the content of invention described herein, and the description done above to language-specific is to disclose this hair Bright preferred forms.
In the specification that this place provides, numerous specific details are set forth.It is to be appreciated, however, that the implementation of the present invention Example can be put into practice in the case of these no details.In some instances, known method, structure is not been shown in detail And technology, so as not to obscure the understanding of this description.
Similarly, it will be appreciated that in order to simplify the disclosure and help to understand one or more of each inventive aspect, Above in the description to the exemplary embodiment of the present invention, each feature of the invention is grouped together into single implementation sometimes In example, figure or descriptions thereof.However, the method for the disclosure should be construed to reflect following intention:I.e. required guarantor The application claims of shield features more more than the feature being expressly recited in each claim.It is more precisely, such as following Claims reflect as, inventive aspect is all features less than single embodiment disclosed above.Therefore, Thus the claims for following embodiment are expressly incorporated in the embodiment, wherein each claim is in itself Separate embodiments all as the present invention.
Those skilled in the art, which are appreciated that, to carry out adaptively the module in the equipment in embodiment Change and they are arranged in one or more equipment different from the embodiment.Can be the module or list in embodiment Member or component be combined into a module or unit or component, and can be divided into addition multiple submodule or subelement or Sub-component.In addition at least some in such feature and/or process or unit exclude each other, it can use any Combination is disclosed to all features disclosed in this specification (including adjoint claim, summary and attached drawing) and so to appoint Where all processes or unit of method or equipment are combined.Unless expressly stated otherwise, this specification (including adjoint power Profit requires, summary and attached drawing) disclosed in each feature can be by providing the alternative features of identical, equivalent or similar purpose come generation Replace.
In addition, it will be appreciated by those of skill in the art that although some embodiments described herein include other embodiments In included some features rather than further feature, but the combination of the feature of different embodiments means in of the invention Within the scope of and form different embodiments.For example, in the following claims, embodiment claimed is appointed One of meaning mode can use in any combination.
The all parts embodiment of the present invention can be with hardware realization, or to be run on one or more processor Software module realize, or realized with combinations thereof.It will be understood by those of skill in the art that it can use in practice Microprocessor or digital signal processor (DSP) are come one of some or all components in realizing according to embodiments of the present invention A little or repertoire.The present invention is also implemented as setting for performing some or all of method as described herein Standby or system program (for example, computer program and computer program product).Such program for realizing the present invention can deposit Storage on a computer-readable medium, or can have the form of one or more signal.Such signal can be from because of spy Download and obtain on net website, either provide on carrier signal or provided in the form of any other.
It should be noted that the present invention will be described rather than limits the invention for above-described embodiment, and ability Field technique personnel can design alternative embodiment without departing from the scope of the appended claims.In the claims, Any reference symbol between bracket should not be configured to limitations on claims.Word "comprising" does not exclude the presence of not Element or step listed in the claims.Word "a" or "an" before element does not exclude the presence of multiple such Element.The present invention can be by means of including the hardware of some different elements and being come by means of properly programmed computer real It is existing.In if the unit claim of dry systems is listed, several in these systems can be by same hardware branch To embody.The use of word first, second, and third does not indicate that any order.These words can be explained and run after fame Claim.
The invention discloses:A1. a kind of decentralization date storage method, it is characterised in that including:
User node builds the data trade information for carrying file to be stored, and the data trade information is used Signature and broadcast in authentication;
Multiple memory nodes for treating selection are downloaded the file to be stored according to the data trade information of broadcast and are protected Deposit;
Treat that the memory node of selection carries out the signature for authentication and broadcast to multiple first receipts described in multiple;Its In, the multiple first receipt is being downloaded by multiple memory nodes for treating selection respectively and is being preserved the file to be stored After generate;
Storage of the user node according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast Node is as the memory node for storing the file to be stored.
A2. the method according to A1, it is characterised in that the data trade information includes storage duration, redundancy number And/or transaction payment amount.
A3. the method according to A1, it is characterised in that the user node structure carries the data of file to be stored Transaction Information further comprises:
User node calculates the magnetic force link of file to be stored, and structure data trade information is linked according to the magnetic force.
A4. the method according to A1, it is characterised in that treat the memory node of selection according to broadcast described in the multiple The data trade information, which is downloaded the file to be stored and preserved, to be further comprised:
Multiple memory nodes for treating selection are treated according to the data trade information of broadcast judges whether preservation Storage file;
If so, multiple memory nodes for treating selection are downloaded the file to be stored and are preserved.
A5. the method according to A1, it is characterised in that choose one according to default Algorithms of Selecting in the user node Or before memory node of the memory node corresponding to the receipt of multiple broadcast as the storage file to be stored, the method Further include:
User node is detected the multiple memory node for treating selection, judges the multiple storage section for treating selection Whether point completely downloads the file to be stored.
A6. the method according to A5, it is characterised in that the user node is to the multiple memory node for treating selection It is detected and further comprises:
User node is detected the multiple memory node for treating selection using detection algorithm;The detection algorithm bag Include the cryptographic Hash for inquiring the multiple memory node specified file fragment for treating selection and/or allow the multiple storage for treating selection Node utilizes hash algorithm calculation document Hash verification result of calculation.
A7. the method according to any one of A1-A6, it is characterised in that chosen in the user node according to default Memory node corresponding to first receipt of the one or more broadcast of algorithm picks is as the storage for storing the file to be stored After node, the method further includes:
User node carries out the first receipt of selection the signature for authentication, obtains the second receipt and carries out wide Broadcast.
A8. the method according to A7, it is characterised in that the method further includes:
What user node broadcast carried the second receipt fetches instruction;
The memory node fetches the second receipt in instruction according to, obtains corresponding storage file and returns to user Node.
A9. the method according to A7, it is characterised in that the method further includes:
In the case where the storage time of the file to be stored exceedes the storage duration, the memory node release is The file to be stored of storage;
The memory node obtains the transaction payment amount that user node is paid.
A10. the method according to any one of A1-A6, it is characterised in that the method further includes:
The data message of respective storage file is mutually detected and/or exchanged between the multiple memory node for treating selection.
The invention also discloses:B11. a kind of decentralization data-storage system, it is characterised in that including:User node With multiple memory nodes for treating selection;
The user node is used for:Structure carries the data trade information of file to be stored, and to the data trade Information carries out the signature and broadcast for authentication;The first receipt of one or more broadcast is chosen according to default Algorithms of Selecting Corresponding memory node is as the memory node for storing the file to be stored;
The memory node for treating selection is used for:The data trade information broadcasted according to the user node downloads institute State file to be stored and preserve;Signature for authentication and broadcast are carried out to multiple first receipts, wherein, the multiple One receipt is generated by multiple memory nodes after selection after downloading and having preserved the file to be stored respectively.
B12. the system according to B11, it is characterised in that the data trade information further includes storage duration, redundancy Number and/or transaction payment amount.
B13. the system according to B11, it is characterised in that the user node is further used for:Calculate text to be stored The magnetic force link of part, structure data trade information is linked according to the magnetic force.
B14. the system according to B11, it is characterised in that the memory node for treating selection is further used for:
Judge whether to preserve the file to be stored according to the data trade information of broadcast;
If so, download the file to be stored and preserve.
B15. the system according to B11, it is characterised in that the user node is further used for:Treated to the multiple The memory node of selection is detected, and judges whether the multiple memory node for treating selection completely downloads the text to be stored Part.
B16. the system according to B15, it is characterised in that the user node is further used for:Utilize detection algorithm The multiple memory node for treating selection is detected;The detection algorithm includes inquiring the multiple storage section for treating selection Put the cryptographic Hash of specified file fragment and/or allow the multiple memory node for treating selection to utilize hash algorithm calculation document Hash Verify result of calculation.
B17. according to B11-B16 any one of them systems, it is characterised in that the user node is further used for:It is right The first receipt chosen carries out the signature for authentication, obtains the second receipt and is broadcasted.
B18. the system according to B17, it is characterised in that the user node is further used for:Broadcast carries the Two receipts fetch instruction;
The memory node is further used for:According to second receipt fetched in instruction, corresponding storage text is obtained Part returns to user node.
B19. the system according to B17, it is characterised in that the memory node is further used for:Described to be stored In the case that the storage time of file exceedes the storage duration, the stored file to be stored is discharged;Obtain user's section The transaction payment amount that point is paid.
B20. the system according to any one of B11-B16, it is characterised in that the multiple memory node for treating selection Between mutually detect and/or exchange the data message of respective storage file.
The invention also discloses:C21. a kind of electronic equipment, including:Processor, memory, communication interface and communication are total Line, the processor, the memory and the communication interface complete mutual communication by the communication bus;
The memory is used to store an at least executable instruction, and the executable instruction makes the processor perform such as The corresponding operation of decentralization date storage method any one of A1-A10.
The invention also discloses:D22. a kind of computer-readable storage medium, being stored with least one in the storage medium can hold Row instruction, the executable instruction make processor perform the decentralization date storage method pair as any one of A1-A10 The operation answered.

Claims (10)

  1. A kind of 1. decentralization date storage method, it is characterised in that including:
    User node builds the data trade information for carrying file to be stored, and the data trade information is carried out to be used for body The signature of part certification and broadcast;
    Multiple memory nodes for treating selection are downloaded the file to be stored according to the data trade information of broadcast and are preserved;
    Treat that the memory node of selection carries out the signature for authentication and broadcast to multiple first receipts described in multiple;Wherein, The multiple first receipt is respectively by multiple memory nodes after selection after downloading and having preserved the file to be stored Generation;
    Memory node of the user node according to corresponding to the first receipt that default Algorithms of Selecting chooses one or more broadcast As the memory node for storing the file to be stored.
  2. 2. according to the method described in claim 1, it is characterized in that, the data trade information includes storage duration, redundancy part Number and/or transaction payment amount.
  3. 3. according to the method described in claim 1, it is characterized in that, user node structure carries the number of file to be stored Further comprise according to Transaction Information:
    User node calculates the magnetic force link of file to be stored, and structure data trade information is linked according to the magnetic force.
  4. 4. according to the method described in claim 1, it is characterized in that, treat the memory node of selection according to broadcast described in the multiple The data trade information download the file to be stored and preserve and further comprise:
    Multiple memory nodes for treating selection judge whether to preserve described to be stored according to the data trade information of broadcast File;
    If so, multiple memory nodes for treating selection are downloaded the file to be stored and are preserved.
  5. 5. according to the method described in claim 1, it is characterized in that, one is chosen according to default Algorithms of Selecting in the user node Before memory node of the memory node as the storage file to be stored corresponding to the receipt of a or multiple broadcast, the side Method further includes:
    User node is detected the multiple memory node for treating selection, judges that the multiple memory node for treating selection is It is no completely to download the file to be stored.
  6. 6. according to the method described in claim 5, it is characterized in that, the user node is to the multiple storage section for treating selection Point, which is detected, to be further comprised:
    User node is detected the multiple memory node for treating selection using detection algorithm;The detection algorithm includes asking Ask the cryptographic Hash of the multiple memory node specified file fragment for treating selection and/or allow the multiple memory node for treating selection Result of calculation is verified using hash algorithm calculation document Hash.
  7. 7. according to the method any one of claim 1-6, it is characterised in that chosen in the user node according to default Memory node corresponding to first receipt of the one or more broadcast of algorithm picks is as the storage for storing the file to be stored After node, the method further includes:
    User node carries out the first receipt of selection the signature for authentication, obtains the second receipt and is broadcasted.
  8. A kind of 8. decentralization data-storage system, it is characterised in that including:User node and multiple storage sections for treating selection Point;
    The user node is used for:Structure carries the data trade information of file to be stored, and to the data trade information Carry out the signature for authentication and broadcast;The first receipt institute that one or more broadcast are chosen according to default Algorithms of Selecting is right The memory node answered is as the memory node for storing the file to be stored;
    The memory node for treating selection is used for:Treated according to being downloaded the data trade information that the user node is broadcasted Storage file simultaneously preserves;Signature for authentication and broadcast are carried out to multiple first receipts, wherein, the multiple first time Hold and generated respectively by multiple memory nodes after selection after downloading and having preserved the file to be stored.
  9. 9. a kind of electronic equipment, including:Processor, memory, communication interface and communication bus, the processor, the storage Device and the communication interface complete mutual communication by the communication bus;
    The memory is used to store an at least executable instruction, and the executable instruction makes the processor perform right such as will Ask the corresponding operation of decentralization date storage method any one of 1-7.
  10. 10. a kind of computer-readable storage medium, an at least executable instruction, the executable instruction are stored with the storage medium Processor is set to perform the corresponding operation of decentralization date storage method as any one of claim 1-7.
CN201711106048.0A 2017-11-10 2017-11-10 Decentralized data storage method and system, electronic device and storage medium Active CN107948253B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711106048.0A CN107948253B (en) 2017-11-10 2017-11-10 Decentralized data storage method and system, electronic device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711106048.0A CN107948253B (en) 2017-11-10 2017-11-10 Decentralized data storage method and system, electronic device and storage medium

Publications (2)

Publication Number Publication Date
CN107948253A true CN107948253A (en) 2018-04-20
CN107948253B CN107948253B (en) 2021-03-02

Family

ID=61934741

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711106048.0A Active CN107948253B (en) 2017-11-10 2017-11-10 Decentralized data storage method and system, electronic device and storage medium

Country Status (1)

Country Link
CN (1) CN107948253B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019210420A1 (en) * 2018-05-03 2019-11-07 Nuutok Entreprise Inc. Decentralized and automated data storage, processing and sharing system and related process
CN110428254A (en) * 2019-07-04 2019-11-08 杭州复杂美科技有限公司 Decentralization stores method for down loading and referee method, equipment and storage medium
CN111338647A (en) * 2018-12-18 2020-06-26 杭州海康威视数字技术股份有限公司 Big data cluster management method and device
CN116361860A (en) * 2022-12-27 2023-06-30 深圳市网新新思软件有限公司 Information storage and verification method, device, equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1549985A (en) * 2001-08-27 2004-11-24 美国联合包装服务有限公司 International cash-on-delivery system and method
US20150127563A1 (en) * 2011-05-10 2015-05-07 Michael Young System and method for displaying product certification
CN105956923A (en) * 2016-04-20 2016-09-21 上海如鸽投资有限公司 Asset transaction platform and digital certification and transaction method for assets
CN106301792A (en) * 2016-08-31 2017-01-04 江苏通付盾科技有限公司 Ca authentication management method based on block chain, Apparatus and system
CN106612285A (en) * 2016-12-30 2017-05-03 Tcl集团股份有限公司 Distributed cloud data management method and system based on peer-to-peer network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1549985A (en) * 2001-08-27 2004-11-24 美国联合包装服务有限公司 International cash-on-delivery system and method
US20150127563A1 (en) * 2011-05-10 2015-05-07 Michael Young System and method for displaying product certification
CN105956923A (en) * 2016-04-20 2016-09-21 上海如鸽投资有限公司 Asset transaction platform and digital certification and transaction method for assets
CN106301792A (en) * 2016-08-31 2017-01-04 江苏通付盾科技有限公司 Ca authentication management method based on block chain, Apparatus and system
CN106612285A (en) * 2016-12-30 2017-05-03 Tcl集团股份有限公司 Distributed cloud data management method and system based on peer-to-peer network

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019210420A1 (en) * 2018-05-03 2019-11-07 Nuutok Entreprise Inc. Decentralized and automated data storage, processing and sharing system and related process
CN111338647A (en) * 2018-12-18 2020-06-26 杭州海康威视数字技术股份有限公司 Big data cluster management method and device
CN111338647B (en) * 2018-12-18 2023-09-12 杭州海康威视数字技术股份有限公司 Big data cluster management method and device
CN110428254A (en) * 2019-07-04 2019-11-08 杭州复杂美科技有限公司 Decentralization stores method for down loading and referee method, equipment and storage medium
CN110428254B (en) * 2019-07-04 2022-03-04 杭州复杂美科技有限公司 Decentralized storage downloading method and arbitration method, equipment and storage medium
CN116361860A (en) * 2022-12-27 2023-06-30 深圳市网新新思软件有限公司 Information storage and verification method, device, equipment and storage medium
CN116361860B (en) * 2022-12-27 2024-02-09 深圳市网新新思软件有限公司 Information storage and verification method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN107948253B (en) 2021-03-02

Similar Documents

Publication Publication Date Title
CN107948253A (en) Decentralization date storage method and system, electronic equipment, storage medium
CN106503053B (en) UTXO querying method and device
CN109417465B (en) Registration and automatic management method of intelligent contracts executed by block chains
CN108898021B (en) Threat information processing method, system and computing device based on block chain
Liu et al. Distributed ledger technology
US20160260171A1 (en) Systems and methods for a commodity contracts market using a secure distributed transaction ledger
US20200250168A1 (en) Point-to-point distributed decentralized system
CN108647966A (en) A kind of data interactive method and device based on block chain
CN109584082A (en) Settlement of insurance claim method, electronic device and storage medium based on block chain
KR102295236B1 (en) Method for distributing collectables ownership based on blockchain networks and online transaction server using the same
CN108833413A (en) Account management method, server, electronic equipment and the storage medium of tourist user
KR101979254B1 (en) Apparatus for matching transactions for exchanging cryptocurrencies and method thereof
KR102060435B1 (en) Method and apparatus of blockchain smart contract using proof-of-repuation-of-network as consensus algorithm
CA3175939A1 (en) Blacklist data sharing method and system based on blockchain
CN109117608A (en) A kind of data processing method, device and relevant device
CN110599144A (en) Network access method and device for block link points
CN109767245A (en) Consumption information checking method, equipment and storage medium
CN109284632A (en) Logistics transportation processing method and processing device based on block chain
WO2022213061A1 (en) Using an internal ledger with blockchain transactions
Jaiswal et al. A conceptual framework for trustworthy and incentivized trading of food grains using distributed ledger and smart contracts
CN104732395A (en) Internet stream payment system and method
CN114742654A (en) Digital asset circulation method, system, electronic device and medium based on alliance chain
Reno et al. Solving blockchain trilemma using off‐chain storage protocol
CN108776687A (en) Cyberspace searching method, system and computing device based on block chain
CN108876339B (en) E-pet transaction method and device based on certificate

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
TA01 Transfer of patent application right

Effective date of registration: 20210127

Address after: 4f, building C2, Suzhou 2.5 Industrial Park, 88 Dongchang Road, Suzhou Industrial Park, Jiangsu Province, 215021

Applicant after: JIANGSU PAY EGIS TECHNOLOGY Co.,Ltd.

Applicant after: Jiangsu tongfudun blockchain Technology Co., Ltd

Address before: Room 3f-301, building C2, Suzhou 2.5 Industrial Park, 88 Dongchang Road, Suzhou Industrial Park, Jiangsu Province

Applicant before: JIANGSU PAY EGIS TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant