KR102494825B1 - Method and system for distributing content id for ipfs - Google Patents

Abstract

The present disclosure relates to a method and system for distributing content IDs for IPFS. One embodiment of the present disclosure provides a system for distributing content IDs, the system comprising: a user terminal for uploading one or more content IDs corresponding to one or more pieces of backup data; a publishing server that publishes a content ID list including the one or more content IDs; a pinning server that transmits a data request for pinning the one or more pieces of backup data and performs pinning on the one or more pieces of backup data based on a redundancy requirement algorithm; and a web server that transmits a return content ID list included in the content ID list to the pinning server in response to the data request.

Description

Method and system for distributing content ID for IPFS {METHOD AND SYSTEM FOR DISTRIBUTING CONTENT ID FOR IPFS}

The present disclosure provides a method and system for distributing content ID for IPFS.

IPFS, short for InterPlanetary File System, is a distributed P2P (Peer to Peer) file system that aims to connect all computer nodes. IPFS is a faster, more secure and open network realized by peer-to-peer communication of nodes without a centralized server. Unlike the conventional HTTP web, which has fatal consequences when a large centralized server is disconnected, in IPFS, the system can be maintained stably even if several nodes are disconnected.

In IPFS, each file consists of several blocks, and each block has a unique name expressed as a hash. IPFS stores the names of all files in a database, eliminates duplication of the same file, and tracks the version information of each file. Each node stores only the files it is interested in, and through indexing information, it is possible to know who is storing which files. To find a network file, query the file name and track the node that has the file.

A user who wants to distribute and store a file using IPFS uploads the file to a server that provides an IPFS distributed storage service. However, uploading a file to the server providing the IPFS service does not mean that the file is automatically distributed and stored. In order to ensure that the distributed server allocates capacity to the actual hard disk and stores it, each distributed server must obtain the required content ID.

However, the current IPFS standard does not suggest actual implementation, but only simple guidelines. The IPFS standard's proposal places end users (eg customers) responsible for the distribution of content IDs. In general SaaS-type services, in addition to files uploaded by users, there are various files derived from these, so in SaaS-type managed services, customers directly obtain their own content ID list and register it directly in their own pinning service. Doing so is unrealistic. Therefore, it is necessary to implement a system that guarantees efficiency and reliability in a server providing IPFS-based file distribution storage service and a method for distributing and storing content IDs in each distributed node.

The foregoing background art is technical information that the inventor possessed for derivation of the present invention or acquired during the derivation process of the present invention, and cannot necessarily be said to be known art disclosed to the general public prior to filing the present invention.

An object of the present disclosure is to provide a method and system for distributing content ID for IPFS. The problems to be solved by the present disclosure are not limited to the above-mentioned problems, and other problems and advantages of the present disclosure that are not mentioned can be understood by the following description and more clearly understood by the embodiments of the present disclosure. It will be. In addition, it will be appreciated that the problems and advantages to be solved by the present disclosure can be realized by the means and combinations indicated in the claims.

A system for distributing content IDs according to an embodiment of the present disclosure includes: a user terminal uploading one or more content IDs corresponding to one or more backup data; a publishing server that publishes a content ID list including the one or more content IDs; a pinning server that transmits a data request for pinning the one or more backup data and performs pinning on the one or more backup data; and a web server that transmits a return content ID list included in the content ID list to the pinning server in response to the data request.

In addition to this, another method for implementing the present invention, another device, and a computer-readable recording medium recording a program for executing the method may be further provided.

Other aspects, features and advantages other than those described above will become apparent from the following drawings, claims and detailed description of the invention.

According to the above-described problem solving means of the present disclosure, an automated procedure for a specific user's file through an authority delegated from the user without an explicit cooperation process between an operator providing an IPFS-based service and a third party providing only a pinning service. can be safely distributed and stored on IPFS nodes around the world.

1 is a conceptual diagram showing a schematic configuration of an IPFS-based file distribution storage system according to an embodiment.
2 is a block diagram showing the configuration of a node according to an embodiment.
3 is a conceptual diagram illustrating a block and a block chain according to an embodiment.
4 is a diagram for explaining the IPFS standard.
5 is an exemplary diagram illustrating an operation of a system for distributing content IDs according to an exemplary embodiment.
6 is an exemplary diagram for explaining a content ID list and a return content ID list according to an embodiment.
7 is a flowchart illustrating a redundancy condition algorithm according to an exemplary embodiment.

Advantages and features of the present invention, and methods of achieving them, will become clear with reference to the detailed description of the embodiments taken in conjunction with the accompanying drawings. However, it should be understood that the present invention is not limited to the examples presented below, but may be implemented in various different forms, and includes all conversions, equivalents, and substitutes included in the spirit and scope of the present invention. do. The embodiments presented below are provided to complete the disclosure of the present invention and to fully inform those skilled in the art of the scope of the invention to which the present invention belongs. In describing the present invention, if it is determined that a detailed description of related known technologies may obscure the gist of the present invention, the detailed description will be omitted.

Terms used in this application are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly dictates otherwise. In this application, terms such as "include" or "have" are intended to designate that there is a feature, number, step, operation, component, part, or combination thereof described in the specification, but one or more other features It should be understood that the presence or addition of numbers, steps, operations, components, parts, or combinations thereof is not precluded.

Some embodiments of the present disclosure may be represented as functional block structures and various processing steps. Some or all of these functional blocks may be implemented as a varying number of hardware and/or software components that perform specific functions. For example, functional blocks of the present disclosure may be implemented by one or more microprocessors or circuit configurations for a predetermined function. Also, for example, the functional blocks of this disclosure may be implemented in various programming or scripting languages. Functional blocks may be implemented as an algorithm running on one or more processors. In addition, the present disclosure may employ prior art for electronic environment setting, signal processing, and/or data processing. Terms such as "mechanism", "element", "means" and "component" may be used broadly and are not limited to mechanical and physical components.

In addition, connecting lines or connecting members between components shown in the drawings are only examples of functional connections and/or physical or circuit connections. In an actual device, connections between components may be represented by various functional connections, physical connections, or circuit connections that can be replaced or added.

Hereinafter, the present disclosure will be described in detail with reference to the accompanying drawings.

1 is a conceptual diagram showing a schematic configuration of an IPFS-based file distribution storage system according to an embodiment.

Referring to FIG. 1 , an IPFS-based file distribution storage system 100 may include a main server 110, an IPFS network 120, a sharer device 130, and a requestor device 140. In addition, the IPFS network 120 may include IPFS nodes 121, 122, 123, and 124.

The main server 110 controls and manages the IPFS network 120, and at this time, the main server 110 can be said to perform the role of a peer leader. Therefore, among the IPFS nodes 121, 122, 123, and 124, the main server 110 may serve as a peer leader. Alternatively, it is also possible to provide a separate main server 110 to perform a management role for the IPFS nodes 121, 122, 123, and 124.

That is, the main server 110 can be a subject that performs file encryption, partition processing, and distributed storage to the IPFS nodes 121, 122, 123, and 124, and constitutes the IPFS network 120 and serves as a peer leader. If it can be performed, there is no separate restriction.

In addition, the main server 110 monitors the IPFS nodes 121, 122, 123, and 124 through active monitoring to determine the operational status and passive monitoring to monitor data upload/download status. ) and distributed storage of data through it, and control and monitoring of data upload and download.

In addition, although not shown in FIG. 1, the main server 110 distributes and communicates an application loaded with a unique code for each user in the user terminal 130, and verifies and confirms documents and restores results and processed history. It may further include an application server (not shown) that manages and processes re-authentication in preparation for change or loss of a user terminal.

The IPFS nodes 121, 122, 123, and 124 store and process data fragments from which files are divided in the IPFS network 120, as well as transaction information that may include download or upload details of the file. It performs the function of storing a copy of the included block and the blockchain on which the block is stacked. Blocks and blockchains are described in detail in FIG. 3 .

The IPFS nodes 121, 122, 123, and 124 may refer to all computing equipment capable of receiving a Contents Identification (CID) as an input and restoring original data of the Contents ID. In addition, the IPFS nodes 121, 122, 123, and 124 may communicate with each other through various communication means such as a central server, a relay server, a P2P network, and a blockchain network.

In this case, the content ID is a unique name of original file data. Similar to the hash value of data, even if the two data have different file names such as “ABC.txt” and “DEF.txt”, if the contents of the data are the same, they will have the same content ID. The content ID has a very small size compared to the original file and can be generated based on the calculation result of a cryptographic hash function.

Meanwhile, the main server 110 that supplies content IDs to the IPFS nodes 121, 122, 123, and 124 communicates with the IPFS nodes 121, 122, 123, and 124 to supply content ID information and prevent fraudulent use. It can be equipped with an authentication means to prevent it. When the main server 110 communicates with the IPFS nodes 121, 122, 123, and 124, the communication means itself does not need to be a secure channel.

Authentication means include a network method of restricting IP addresses, a user authentication method through encryption technology, user authentication through a blockchain network 120, or a method to prevent unauthorized users from arbitrarily inputting content IDs into the IPFS network 120. All methods may be included. At this time, fraudulent use can be fundamentally prevented through an authentication procedure, or fraudulent use can be prevented from increasing beyond a certain rate through proof of work.

The content ID supplied by the main server 110 may be the content ID of the original file or the content ID of the result obtained by encrypting the original file according to requirements. In this case, separate metadata for sharing encryption standards may be shared. Metadata may include only information that has no security vulnerability even if the original source is exposed. For example, there are types of encryption algorithms, padding methods, and initial vector values.

The sharer device 130 and the requestor device 140 may be IPFS nodes 121, 122, 123, and 124 themselves, or may be IPFS nodes 121, 122, 123, and 124 that already exist through a relay server. It may be a terminal in use. Here, the sharer terminal 130 and the requester terminal 140 refer to terminals that upload and download files, and may include terminals capable of transmitting and receiving various document data via a communication network according to key manipulation. For example, the sharer terminal 130 and the requester terminal 140 may include a tablet terminal, a laptop, a personal computer (PC), a smartphone, and a personal portable information terminal (PDA). It may be any one of a digital assistant) and a wireless terminal.

The IPFS nodes 121, 122, 123, and 124 can complete verification of the possibility of forgery of the original file without the help of the main server 110 by using the cryptographic hash function of the content ID, and the original file of the content ID is IPFS. Even if it is stored in any device of the network 120, it can be searched for and retrieved through an automated procedure.

2 is a block diagram showing the configuration of nodes of a blockchain network according to an embodiment.

Referring to FIG. 2 , a node 200 may include a communication unit 210 , a processing unit 220 and a storage unit 230 . In addition, the node 200 may be the same as or perform the same function as the IPFS nodes 121 , 122 , 123 , and 124 of FIG. 1 .

The communication unit 210 may provide an interface for transmitting and receiving data to and from the inside or outside of the block chain.

A distributed ledger may be stored in the storage unit 230 . For example, blocks, smart contracts, accounts, transactions, etc. may be stored.

In addition, the processing unit 220 may process contents of transactions stored in blocks of a block chain, which is a distributed ledger, stored in the storage unit 230 . The configuration of the processing unit 220 may vary depending on the function of the corresponding node. For example, the function of the node includes an integrated management function, a block generation function, a block verification function, and the like. Specifically, the processing unit 220 of the integrated management node may perform functions such as overall pool management, P2P management, and block synchronization management, and the processing unit 220 of the block generation node may perform block generation, The processing unit 220 of the block verification node may perform block verification and consensus.

The IPFS node 200 according to the present invention may correspond to a node that performs functions other than the above functions as well as the above function or combination of functions.

3 is a conceptual diagram illustrating a block and a block chain according to an embodiment.

Referring to FIG. 3, a blockchain 300 is a kind of distributed database of one or more blocks 310, 320, and 330 sequentially connected. The blockchain 300 is used to store and manage the addition, deletion, and update (transaction) of user information in the blockchain system, and each node participating in the network of the blockchain system blocks (310, 320, 330 ) can be created and connected to the blockchain 300. Although a limited number of blocks 310, 320, and 330 are shown in FIG. 3, the number of blocks that can be included in a blockchain is not limited thereto.

Each block 310, 320, 330 included in the blockchain 300 has a unique hash value 311, 321, 331, and the block header 312, 322, 332 and the block body 313, 323, 333).

Blockchain 300 may include one or more connected blocks 310 , 320 , and 330 . The block headers 312 , 322 , and 332 may include a hash value of a previous block to indicate a connection relationship between the respective blocks 310 , 320 , and 330 . The hash value of the previous block included in the block headers 312, 322, and 332 is a hash value for the previous block and is the same as the current hash included in the previous block.

For example, the block header 322 of the block N 320 may include the hash value 311 of the block N-1 310 to indicate a connection relationship with the block N-1 310, which is the previous block. can Similarly, the block header 332 of the block N+1 330 may include the hash value 321 of the block N 320 to indicate a connection relationship with the block N 320 as a previous block. The connection relationship in the block headers 312, 322, and 332 expressed in this way can be used in the validation process of the block chain 300.

The blocks 310 , 320 , and 330 are chained by the hash value of the previous block in each block header 312 , 322 , and 332 . Nodes participating in the distributed network verify the validity of the block based on the hash value of the previous block included in the blocks 310, 320, and 330, so that a single malicious node can forge or tamper with the contents of an already created block. action is impossible

The block bodies 313, 323, and 333 may include data stored and managed in the blocks 310, 320, and 330, that is, transaction lists (not shown). The transaction list (not shown) is a list of blockchain-based transactions. A transaction list (not shown) may be expressed in a tree form.

The blocks 310, 320, and 330 may include other information other than the information included in the block headers 312, 322, and 332 and the block bodies 313, 323, and 333.

Hereinafter, operations according to various embodiments may be understood to be performed by a processor included in a content ID distribution method or a content ID distribution system.

4 is a diagram for explaining the IPFS standard.

Referring to FIG. 4 , an environment in which IPFS is implemented may include a user terminal 410 , an announcement server 420 , and storage providing servers 430 , 440 , and 450 . The user terminal 410 and the announcement server 420 may be the same as or perform the same function as the sharer terminal 130 and the main server 110 of FIG. 1, respectively, and the storage providing servers 430, 440 and 450 may be the same as the IPFS network 120 of FIG. 1 or perform the same function.

The publishing server 420 corresponds to a server that provides an online application using IPFS or IPFS service. The announcement server 420 may receive a file from the user terminal 410 receiving the application or the service and announce a unique content ID corresponding to the file of the user terminal 410 . That is, the content ID may be announced so that the file is distributed and stored in the storage providing servers 430, 440, and 450.

An act of storing a file as a content ID in the storage providing server 430 , 440 , 450 and assigning capacity to a physical hard disk by the actual storage providing server 430 , 440 , 450 is called pinning. Accordingly, the storage providing servers 430, 440, and 450 may be referred to as pinning servers or pinning service providers.

Meanwhile, when the user terminal 410 uploads a specific file as a content ID using the IPFS service of the publishing server 420, it is not automatically pinned to the storage providing servers 430, 440, and 450. Specifically, when a file corresponding to a specific content ID is uploaded to the first storage providing server 430, all servers around the world including the second storage providing server 440 and the third storage providing server 450 store the content Although the file of the ID can be accessed, this does not mean that the file of the content ID is distributed and stored in all servers around the world.

In the above process, for example, whenever the user terminal 410 accesses the content ID through the second storage providing server 440, the second storage providing server 440 communicates with the first storage providing server 430. The file is read through and provided to the user terminal 410 . Therefore, there is a problem in that the content ID cannot be accessed when the actually stored first storage providing server 430 is down or the content ID cannot be read due to unstable circumstances. This makes it important to pin files to globally distributed IPFS servers, i.e. servers providing storage.

However, according to the IPFS standard according to FIG. 4, whether or not a file is pinned is determined by a user terminal making a pinning request to an individual pinning server separately from an act of uploading a file by a user terminal. When the pinning service is charged, a process of authenticating whether a user terminal using the pinning service is correct occurs for every pinning request. In SaaS-type services, various files are created through post-processing in addition to the files directly uploaded by the user, and the content ID of these files is unknown to the user. Therefore, the user terminal 410 cannot back up data through the storage providing servers 430, 440, and 450 without the cooperation of the announcement server 420, and the user terminal directly performs all backup processes or negotiates with a pinning service provider. Authenticated authentication information must be disclosed to the publishing server. In addition, the announcement server 420 has an inconvenience of introducing an authentication procedure for pinning (Pinning API) whenever a new storage providing server requesting data pinning appears.

Referring to FIG. 5 below, the publishing server 420 announces the content ID list uploaded by the user terminal 410 through HTTP, and how each storage providing server 430, 440, 450 pins the content ID to each node. Let's decide, and describe in detail how to distribute the content ID.

5 is an exemplary view illustrating an operation of a system (hereinafter referred to as 'system') for distributing content IDs according to an exemplary embodiment.

Referring to FIG. 5 , an environment in which the system operates may include a user terminal 510, an announcement server 520, a web server 521, a pinning server 530, and a pinning server database (not shown). The user terminal 510, the announcement server 520, and the pinning server 530 are the same as or identical to one of the user terminal 410, the announcement server 420, and the storage provision servers 430, 440, and 450 of FIG. 4, respectively. may be performing a function. For convenience of description, only one pinning server 530 is shown, but the number is not limited.

In one embodiment, the user terminal 510 using the IPFS service of the publishing server 520 may upload a content ID corresponding to the backup data to the publishing server 520 . In the case of a plurality of backup data, each unique content ID corresponds to a plurality, and the user terminal 510 may upload one or more content IDs to the publishing server 520 .

At this time, the user terminal 510 sets a redundancy requirement for each content ID indicating how many copies each of the one or more content IDs are required or how many copies are required to be safe, and sends the content ID to the publishing server 520. can be uploaded with

In addition, the user terminal 510 may upload backup data or owner authentication information for the content ID to the publishing server 520 together with the content ID for each content ID or by designating a specific publishing server collectively. there is. For example, the owner authentication information may correspond to any one or more than one of a token, a digital signature, and a decentralized identifier (DID). Authentication information is a public key-based method, and even if its contents are disclosed, it can only prove the owner's identity, and it is impossible for a third party to forge the owner's identity.

In one embodiment, the publishing server 520 may publish a list of content IDs including content IDs uploaded by the user terminal 510 to the web server 521 . In another embodiment, the publishing server 520 may publish a list of content IDs including content IDs and redundancy conditions and/or owner authentication information determined for each content ID.

Meanwhile, the web server 521 may be a standard protocol server based on HTTP API or REST API. By announcing based on a standard protocol rather than a proprietary protocol, each pinning server 530 can receive the content ID list independently and perform pinning, and the publishing server 520 distributes the content ID list to certain pinning servers 530. Since it is unknown whether it is stored or not, the security of the backup data of the user terminal 510 and the reliability of the IPFS service provided by the public announcement server 520 can be improved.

In one embodiment, the pinning server 530 may send a data request requesting a list of published content IDs to the web server 521 to pin the backup data of the user terminal 510 . For example, the pinning server 530 data data based on at least one of a designated time (BeforeAt), a request size (FetchSize), a first latest primary key (LastPK), and user authentication (User Authentication) information. request can be sent.

At this time, the primary key must be at least unique for each content ID, and the content ID itself can serve as a primary key. If you do not want to expose the content ID for some reason, the content ID can be converted to the original content ID using a cryptographic hash function. can make inference difficult.

The designated time may correspond to a time when a corresponding point in time is designated in order to request only a list of content IDs uploaded prior to a specific point in time from among published content ID lists. Request size is the size of the content ID list to be returned, and means the number of content IDs included in the content ID list. That is, the data request transmitted by the pinning server 530 may correspond to a request to return a list of content IDs uploaded prior to a specified time among published content ID lists by the number corresponding to the size of the request.

In one embodiment, the web server 521 may transmit a return content ID list included in the published content ID list to the pinning server 530 in response to a data request from the pinning server 530 .

At this time, when the web server 521 transmits the returned content ID list, the latest primary key (Latest Primary Key, LastPK) transmitted by the pinning server 530 indicates the upload time of the last content ID in the returned content ID list. If the primary key falls within the error range of a predetermined time (eg, less than 1 ms), that is, the latest primary key transmitted by the pinning server 530 and the latest primary key of the returned content ID list are determined in units of a predetermined time. If matched with , only the list of content IDs uploaded before the specified time can be returned. This makes it possible to transmit a returned content ID list without overlapping or missing content IDs even in a distributed storage system where millions of data are uploaded per second.

The user authentication information is information for authenticating that the pinning server 530 has authority to access the backup data without a separate login procedure in order to perform pinning on the backup data of the user terminal 510 . Based on this authentication information, the pinning server performs data backup using a part of the storage space contracted with the user. User authentication information may be received from the user terminal 510 in advance or generated with consent. For example, the user authentication information may correspond to one or more of tokens, digital signatures, and decentralized identifiers (DIDs).

In one embodiment, the web server 521 further determines the validity of the user authentication information presented by the pinning server 530 from among the list of content IDs requested by the pinning server 530, security settings of the pinning server 530, and the like. A returned content ID list, which is a small amount of content ID list, may be transmitted, or the content ID list may not be returned despite a data request from the pinning server 530.

For example, if the web server 521 has authority to access the list of content IDs published in the pinning server 530 based on the user authentication information of the pinning server 530, the returned content ID is sent to the pinning server 530. and if there is no right to access the pinning server 530, the content ID list may not be transmitted. Alternatively, the return content ID list transmitted by the web server 521 may be null.

6 is an exemplary diagram for explaining a content ID list 610 and a returned content ID list 620 according to an embodiment.

In one embodiment, the content ID list 610 published by the publishing server or the returned content ID list 620 transmitted by the web server includes one or more content IDs, a redundancy condition corresponding to each of the one or more content IDs, and owner authentication information. Each of the content ID lists 610 and 620 may include one latest primary key corresponding thereto.

For example, if there is a request for data including the latest primary key PK#4' from the pinning server, the web server compares the latest primary key PK#4 of the published content ID list 610 and matches it in units of a predetermined time. In this case, data prior to PK#4 may be transmitted to the pinning server as the return content ID list 620 .

In one embodiment, there may be a plurality of pinning servers and there may be no communication between servers. For example, assuming that the first pinning server and the second pinning server exist in parallel, the first pinning server and the second pinning server do not communicate with each other, so that each server returns content received from the web server. The list of IDs 620 and which content IDs were pinned are unknown.

However, as each pinning server decides which content ID to pin to each component node and how to pin it according to the redundancy condition algorithm, the storage provider operating the pinning server can easily expand the server and achieve high scalability. A method for the pinning server to perform pinning according to the redundancy condition algorithm will be described in detail with reference to FIG. 7 below.

7 is a flowchart illustrating a redundancy condition algorithm according to an exemplary embodiment.

The redundancy condition algorithm ensures that each node is pinned to satisfy the redundancy condition based on the number of nodes constituting the pinning server, the redundancy condition included in the returned content ID list, and the pinning server database. The pinning server database stores information about content IDs previously pinned in the pinning server.

The redundancy condition algorithm described below is only an example, and various other algorithms that ensure pinning to satisfy the redundancy condition may be used.

In step 710, the pinning server, assuming that the pinning server is composed of X nodes, randomly selects a prime number N greater than X, and assigns N numbers from 0 to (N-1) to each node. Allocate as evenly as possible. 'As equally as possible' means that N numbers are allocated so that the difference between the numbers each node receives is at most 1. At this time, since N is a natural number greater than X, there may be nodes to which more than one number is assigned.

In one embodiment, each node of the pinning server may independently obtain a returned content ID list from the web server. Thereafter, the list of content IDs to be pinned may be filtered by comparing the owner authentication information in the returned content ID list with the content IDs stored in the pinning server database. Accordingly, each node can pin the content ID without duplication.

In step 720, each node of the pinning server may extract the redundancy condition M of the corresponding content ID from the returned content ID list for any content ID to be determined whether or not to pin. In addition, each node of the pinning server may select the largest natural number A whose product with M is equal to or less than N. That is, the largest natural number A such that A*M is equal to or smaller than N can be selected.

In step 730, each node of the pinning server may convert the corresponding content ID into a byte array. For example, each node of the pinning server may convert the corresponding content ID into a byte array using various codecs such as Bases64 and ASC types. In addition, each node of the pinning server obtains an integer K by expressing the byte array again in binary, and obtains a natural number R obtained by dividing K by A.

In step 740, each node of the pinning server pins the corresponding content ID to the node if there is a number matching R among the allocated numbers (750), and pins the corresponding content ID to the node if there is no number matching R among the allocated numbers. Do not pin (760).

After step 750 or step 760, each node of the pinning server determines whether or not to pin in the list of returned content IDs, or other arbitrary content IDs filtered by comparison with content IDs stored in the pinning server database. Steps 720 to 740 may be repeatedly performed.

By determining how to pin each node of the pinning server through the above redundancy condition algorithm, it is possible to guarantee that at least M or more copies exist in the pinning server for any content ID having M redundancy conditions.

Meanwhile, embodiments according to the present invention may be implemented in the form of a computer program that can be executed on a computer through various components, and such a computer program may be recorded on a computer-readable medium. At this time, the medium is a magnetic medium such as a hard disk, a floppy disk and a magnetic tape, an optical recording medium such as a CD-ROM and a DVD, a magneto-optical medium such as a floptical disk, and a ROM hardware devices specially configured to store and execute program instructions, such as RAM, flash memory, and the like.

Meanwhile, the computer program may be specially designed and configured for the present invention, or may be known and usable to those skilled in the art of computer software. An example of a computer program may include not only machine language code generated by a compiler but also high-level language code that can be executed by a computer using an interpreter or the like.

According to one embodiment, the method according to various embodiments of the present disclosure may be included and provided in a computer program product. Computer program products may be traded between sellers and buyers as commodities. A computer program product is distributed in the form of a device-readable storage medium (eg compact disc read only memory (CD-ROM)), or through an application store (eg Play Store™) or between two user devices. It can be distributed (e.g., downloaded or uploaded) directly or online. In the case of online distribution, at least part of the computer program product may be temporarily stored or temporarily created in a device-readable storage medium such as a manufacturer's server, an application store server, or a relay server's memory.

The steps constituting the method according to the present invention may be performed in any suitable order unless an order is explicitly stated or stated to the contrary. The present invention is not necessarily limited according to the order of description of the steps. The use of all examples or exemplary terms (eg, etc.) in the present invention is simply to explain the present invention in detail, and the scope of the present invention is limited due to the examples or exemplary terms unless limited by the claims. it is not going to be In addition, those skilled in the art can appreciate that various modifications, combinations and changes can be made according to design conditions and factors within the scope of the appended claims or equivalents thereof.

Therefore, the spirit of the present invention should not be limited to the above-described embodiments and should not be determined, and all scopes equivalent to or equivalently changed from the claims as well as the claims described below are within the scope of the spirit of the present invention. will be said to belong to

Claims (5)

a user terminal for uploading one or more content IDs corresponding to one or more backup data to a publishing server;
a publishing server that publishes a list of content IDs including the one or more content IDs to a web server;
a pinning server that transmits a data request for pinning the one or more backup data to the web server and performs pinning on the one or more backup data; and
the web server transmitting a return content ID list included in the content ID list to the pinning server in response to the data request;
including,
The pinning server,
Transmitting the data request based on at least one or more of a designated time, a request size, a first latest primary key, and user authentication information;
The data request,
A system for distributing content IDs, wherein a content ID list for content IDs uploaded prior to the specified time among the one or more content IDs is requested to be returned by a number corresponding to the size of the request. delete According to claim 1,
The web server,
Transmitting the return content ID list when the pinning server has authority to access the content ID list based on the user authentication information;
not transmitting the return content ID list if the pinning server does not have the access authority;
A system for distributing content IDs. According to claim 3,
The user authentication information,
Information that can authenticate the access authority without a separate login procedure, corresponding to at least one of a token, digital signature, and decentralized identity (DID),
A system for distributing content IDs. According to claim 1,
The content ID list is
further includes one or more owner authentication information;
The one or more owner authentication information,
For the one or more content IDs, information for authenticating the owner of each of the one or more content IDs,
A system for distributing content IDs.

Images