WO2020184838A1 - Procédé et système de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet basée sur une chaîne de blocs - Google Patents

Procédé et système de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet basée sur une chaîne de blocs Download PDF

Info

Publication number
WO2020184838A1
WO2020184838A1 PCT/KR2020/001555 KR2020001555W WO2020184838A1 WO 2020184838 A1 WO2020184838 A1 WO 2020184838A1 KR 2020001555 W KR2020001555 W KR 2020001555W WO 2020184838 A1 WO2020184838 A1 WO 2020184838A1
Authority
WO
WIPO (PCT)
Prior art keywords
work
information
data
execution
project
Prior art date
Application number
PCT/KR2020/001555
Other languages
English (en)
Korean (ko)
Inventor
김보언
Original Assignee
김보언
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 김보언 filed Critical 김보언
Publication of WO2020184838A1 publication Critical patent/WO2020184838A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms

Definitions

  • the step of determining whether the generated work data is a joint work or a combined work may include obtaining the work contents of the project corresponding to the work data (S210); Acquiring (S220) a plurality of category information about the work performed by each of the plurality of execution subjects; Obtaining a degree of association between the obtained plurality of categories (S230); Determining the work data as a joint work when the degree of association is greater than or equal to a preset value (S240); And determining the work data as a combined work when the association is less than a preset value (S250), wherein the work content includes at least one work unit, and the work unit includes at least one work It includes an item, and the work item may include at least one detailed item.
  • the step of obtaining the contribution information may include: obtaining resource information for each of the plurality of execution subjects and result data of each of the tasks performed by the plurality of execution subjects (S510); Obtaining reward information obtained by performing the project by the plurality of execution entities (S520); Acquiring (S530) information on time invested by each of the plurality of execution subjects to perform the project and information on a time charge of each of the plurality of execution subjects (S530); And obtaining the contribution information based on the obtained resource information, result data, reward information, time information, and hourly cost information (S540). It may include.
  • the work data generated by the plurality of execution entities is a combined work
  • dividing the combined work into a plurality of sub works S610
  • Matching a copyright holder for a first sub-work among the sub-work among the plurality of execution subjects S620
  • And acquiring S630
  • contribution information indicating a degree to which the copyright holder and the rest of the performing entity of the first sub-work contributed to the first sub-work. It may include.
  • unit or “module” refers to a hardware component such as software, FPGA or ASIC, and the "unit” or “module” performs certain roles. However, “unit” or “module” is not meant to be limited to software or hardware.
  • the “unit” or “module” may be configured to be in an addressable storage medium, or may be configured to reproduce one or more processors.
  • “sub” or “module” refers to components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, It includes procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays and variables. Components and functions provided within “sub” or “module” may be combined into a smaller number of components and “sub” or “modules” or into additional components and “sub” or “modules”. Can be further separated.
  • a virtual currency may be generated according to a preset rule and provided to the user terminals 30, and this may be used for mining (mining) virtual currency. ).
  • the user terminal 31 provides information to the management server 20, and the management server 20, if the information is information to be stored in the blockchain, to the blockchain holding servers 10 You can provide that information.
  • Blockchain holding servers 10 can store the corresponding information in the blockchain, and in this process, verification of the information based on the blockchain can be performed. In this case, only information that has been successfully verified can be recorded on the blockchain.
  • the user terminal 31 may provide the information to the management server 20 when there is information requiring verification.
  • the management server 20 can verify this based on the information stored in the block chain.
  • the management server 20 obtains information for verifying the information from the blockchain holding servers 10. And, accordingly, verification can be performed.
  • the management server 20 may provide the verification result to the user terminal 31 or provide a service to the user terminal 31 based on the verification result.
  • this blockchain system has the advantage of providing higher security by providing a decentralized distributed processing system and providing reliability that cannot be manipulated by a specific subject.
  • FIG. 3 is a diagram illustrating a system according to an embodiment.
  • the system may include a server 100, one or more user terminals 40 and 50 capable of communicating with the server 100, and a blockchain network 120.
  • the server 100 and one or more user terminals 40 and 50 may be a kind of the above-described computer, but are not limited thereto.
  • the one or more user terminals 40 and 50 may be a user terminal used by a registration subject registering a project or a performing subject performing at least part or all of a project, and a manager performing project management according to the disclosed embodiment. It may be a user terminal used by, but is not limited thereto.
  • the type of project may also include various types such as the provision of in-kind or services, and is not limited to a specific type.
  • a project may be for supplying a specific product, may be for providing research service or professional service service, etc., or it may be a complex that includes various tasks.
  • the project may be a project related to MICE.
  • MICE is a term after English letters such as meeting, incentive trip, convention, exhibition and event (Exhibition&Event). In a narrow sense, MICE is a promising industry centered on international conferences and exhibitions. In a broader concept, it refers to a convergence industry that includes participant-centered reward tourism and mega events.
  • the work data when in the form of a combined work, it means a work obtained by dividing data on the work, and a method of dividing the work data will be described later.
  • the blockchain network 120 may include nodes 121, 122, 123, 124, and 125.
  • a node can mean a component within the network of a blockchain.
  • Each of the nodes 121, 122, 123, 124, and 125 may be server devices of individuals who subscribe to and participate in a system (eg, a copyright management platform).
  • each of the nodes 121, 122, 123, 124, and 125 is a special-purpose computer, a general-purpose computer, a supercomputer, and a mainframe computer.
  • the node 121 may decrypt the encrypted information and verify whether the information is valid based on the decrypted result. As a result of verifying the validity of the information, if the information is not valid, the node 121 may discard the information.
  • the validation of the information is a first hash value obtained by applying a hash function to the received information and a second hash value obtained by decrypting the received cipher text using the public key of the operator of the server 100. It can be performed by comparing hash values, but is not limited thereto.
  • the same operation as the node 122 may be performed at the node 123 and the node 124.
  • the node 121 may calculate the root of the Merkle tree for predetermined information.
  • the node 121 may generate a hash reference pointing to the previous block header from the standpoint of the block to be added to the blockchain.
  • the node 121 may acquire the required difficulty level in the proof of work or constraint condition of the block to be added to the blockchain.
  • the node 121 may check whether a value of a block hash generated by applying a hash function to the root of the Merkle tree, a hash reference pointing to the previous block header, difficulty, and timestaff data and nonce satisfies the constraint condition.
  • the node 121 may perform proof-of-work on the candidate block by obtaining a value of a nonce that satisfies the constraint condition while increasing the nonce by 1 from 0. Node 121 can add a candidate block as a valid block to the blockchain. In addition, the node 121 may transmit a valid block to other nodes 122, 123, 124, 125, etc. on the network of the blockchain.
  • Each node (122, 123, 124, 125, etc.) on the network of the blockchain performs verification of the valid block received from the node 121, and is held by each node (122, 123, 124, 125, etc.) You can add valid blocks to the blockchain.
  • the computer in obtaining the project data, work data, and sub-work, can verify the integrity of the acquired project data, work data, and sub-work based on information stored in the blockchain.
  • the computer may verify information on the execution subject based on information stored in the block chain.
  • the share of each execution subject may be stored.
  • Information transmitted to the nodes on the blockchain is stored in the blockchain network, and the stored information is kept in a state that not only prevents forgery, but also maintains its integrity, so that it is determined whether the data of other works can be protected by copyright in the future It can be used when other people use the registered data.
  • FIG. 5 is a flowchart illustrating a method of registering a copyrighted work obtained from project data according to an embodiment of the present invention.
  • the project data may refer to all data acquired during the project process, and not only meaningful results for the project.
  • a plurality of Request For Proposal (RFP) submitted during a project bidding process may be project data according to the present invention. Therefore, not only the adopted proposal request, but also the unadopted proposal request may be project data according to the present invention.
  • the execution subject for the project is matched, the project result obtained by the matched execution subject may also be defined as project data in the present invention.
  • the server 100 may acquire at least one work data for registration as a work among the acquired project data.
  • the server 100 may determine data that satisfies the requirements of the work among project data, and obtain data that satisfies the requirements as work data. Specifically, the server 100 may acquire data that includes human thoughts or emotions and recognizes creativity as work data.
  • the server 100 may obtain data generated by an executing entity among project data.
  • the server 100 may acquire data other than data provided by the registration subject of the project among project data.
  • the server 100 may determine the degree of creativity by analyzing data generated by the executing subject. For example, if the data generated by the performing subject is text data, the server 100 may determine the degree of creativity based on the weight of words related to emotion among text data and the connection relationship between words related to emotion. . For example, the server 100 stores emotion-related words in a database, and may determine a ratio in which words related to emotions stored in the database are included among text data generated by the performing subject. When the text data generated by the performing subject includes words related to emotions in a predetermined ratio or more, the server 100 may determine the data as work data.
  • the server 100 may acquire all sentences included in text data and determine emotion information for each of the acquired plurality of sentences. For example, the server 100 may quantify emotion information of a corresponding sentence based on a connection relationship between a word for emotion and a word for emotion included in the sentence. The server 100 may determine the text data as the work data when the sentence in which the emotion information is digitized is greater than or equal to a preset value.
  • the server 100 may determine the data as work data.
  • images or videos will often express human thoughts or emotions that are a requirement for a work.
  • step S130 the server 100 may determine whether the acquired data of the at least one work is the same as the previously registered work.
  • the server 100 may determine whether the acquired work data is the same as a previously registered work.
  • step S140 when the at least one work data is not the same as a previously registered work, the server 100 may transmit information for managing at least one work data to a node on the blockchain.
  • the information for the management of at least one work data includes work data, the execution subject that created the work data, project information related to the work data, the registration subject of the project related to the work data, the contract content between the registration subject and the execution subject, and the work It may include a variety of information such as contribution information or share ratio between a plurality of execution entities that generated the data, and profit information for the work data.
  • step S150 the server 100 may register at least one copyrighted work.
  • FIG. 6 is a flowchart illustrating a method of determining the type of work data according to an embodiment of the present invention.
  • the server 100 may determine which work data is the work data, and set the share ratio or contribution of a plurality of execution subjects according to the determined type of work, so that a fair compensation can be paid to each execution subject. .
  • step S160 the server 100 may determine an execution subject for each of the at least one work data.
  • one work data will be described below unless there is a special case, but it goes without saying that the same technical idea may be applied to each of a plurality of work data.
  • step S170 when the execution subject for the work data is a single execution subject, the server 100 may determine the work data as a work of a single execution subject.
  • FIG. 7 is a flowchart illustrating a method of determining whether work data is a joint work or a combined work according to an embodiment of the present invention.
  • each of the work items 210 and 220 may be further divided into one or more detailed items 212 and 214.
  • the performer-related work items may be classified into detailed items such as securing the performer contact point, checking clothes, props and personnel, checking the waiting space, preparing other props, and managing rehearsal, but is not limited thereto.
  • one detailed item may be classified to be one category. That is, the data obtained by performing one detailed item is composed of one work, and the detailed items can be classified so as not to be composed of a joint work or a combined work. That is, a work obtained by performing one detailed item may be one work.
  • the present invention is not limited thereto, and a work obtained by performing detailed items according to various embodiments of the present invention may be a joint work or a combined work.
  • each of the divided detailed items is stored in a different blockchain node, and it is possible to manage to prevent forgery and alteration of at least some of the divided detailed items through interconnection.
  • each block shown in Fig. 8 stores its information in different nodes (blocks) on the blockchain, and if some of them are forged, it can be verified through the entire blockchain. I can.
  • the server 100 may determine an execution subject to perform each of the divided detailed items. In an embodiment, the server 100 may determine an execution subject for each of the detailed items. However, according to an embodiment, a plurality of detailed items related to each other may be performed by a single execution entity. Tasks assigned to the performing subject may be assigned in units of sub-items, units of work items, or may be assigned according to work units, but are not limited anymore.
  • the server 100 may determine an execution subject to perform each task group.
  • one detailed item may be performed by a plurality of execution subjects. Therefore, depending on the embodiment, there may be detailed items overlapping each other between different task groups.
  • a single task group can be performed by multiple execution entities.
  • the method of creating a task group is not limited, and an intersection between different task groups may or may not exist, and may or may not be in the same or inclusive relationship.
  • the server 100 may determine an execution subject to perform a task according to each task group, based on the nature of each task group.
  • the server 100 may perform the step of setting the task content, budget, and authority corresponding to each of the created one or more task groups.
  • the server 100 may perform the step of allocating the set task content, budget, and authority to each of one or more execution subjects to perform each of the one or more task groups.
  • the server 100 may perform a step of providing information corresponding to the assigned task content, budget, and authority to each of the one or more execution subjects.
  • a block chain in which data is stored in a project and a block chain in which information on an execution subject is stored may be provided, respectively.
  • the server 100 stores project data in the project blockchain and information on the execution subject in the execution subject blockchain, and information about the matched project and the execution subject is exchanged and stored in nodes corresponding to each other.
  • matching information between the project and the executing subject is stored in the blockchain, and the information of the matched executing subject and the project is stored in each other's blockchains, so the two blockchains interact to verify the integrity of the information. It has the advantage of being able to keep it safe.
  • the server 100 may determine whether the work data according to the work performed by an individual execution entity or a plurality of execution entities is for a work unit, a work item, or a detailed item.
  • the work data is 1) data obtained by performing a business unit or task item by an individual performing entity, 2) data obtained by performing a detailed item by an individual performing entity, and 3) a plurality of performing entities In the case of data obtained by performing a unit or task item, 4) In the case of data obtained by performing a detailed item by multiple execution subjects, it can be classified into four categories.
  • the server 100 may determine that the copyright for the work data is the copyright of the individual performing subject. However, in this case, the server 100 may classify the work data into a plurality of works by using the method of steps S220 to S240 to be described later.
  • the server 100 may determine that the copyrighted work data for the detailed item is the copyright of the individual executing subject.
  • the server 100 may determine that the work data is a joint work of the plurality of execution subjects. That is, even by steps S220 to S240 to be described later, since the work data for a detailed item is a work for one category or a related category, the server 100 may determine that the work data is a joint work of a plurality of executing entities. have.
  • steps S220 to S240, 3) a method of determining whether the work data is a joint work or an individual work when the plurality of execution subjects is data obtained by performing a work unit or work item will be described.
  • the server 100 may acquire a plurality of category information on the work content performed by each of the plurality of execution subjects.
  • the server 100 may obtain a plurality of category information on the work contents performed by each of the work units or the plurality of execution subjects that performed the work items.
  • the server 100 when a plurality of execution subjects execute the work unit 200, the server 100 corresponds to the detailed items 212 and 214 of the work unit 200.
  • Category information may be obtained as a plurality of category information.
  • step S230 the server 100 may obtain a degree of association between the obtained plurality of categories.
  • step S240 the server 100 may determine the work data as a co-work when the obtained correlation is greater than or equal to a preset value.
  • step S250 when the obtained association is less than a preset value, the server 100 may determine the work data as a combined work.
  • the probability that the work data is a joint work may be higher.
  • the server 100 may determine that the work data is inseparable, and may determine the work data as a joint work. If the degree of association is less than a preset value, the server 100 It is determined that the work data is separable, and the work data can be determined as a combined work.
  • the server 100 may label a category on the cluster by determining the characteristics of each of the plurality of clusters.
  • the category may be based on the expression method of the work data, such as image, audio, and text categories, and may also be about the form of the work, such as pictures, music, texts, performances, performances, exhibitions, decorations, interiors, and architecture categories. have.
  • the server 100 obtains the distance between the first cluster and the second cluster, and Depending on the degree of association can be determined. If the distance is far, the relationship will be low, and if the distance is close, the relationship will be high.
  • 11 is a flowchart illustrating a method of obtaining contribution information for determining a share ratio of a joint work according to an embodiment of the present invention.
  • the server 100 may obtain resource information for each of the plurality of execution subjects and result data for each of the tasks performed by each of the plurality of execution subjects.
  • the project registration subject may select some of the plurality of proposal requests and pay rewards only to the selected execution subjects.
  • the project registration entity pays a reward to the execution entity who obtained 90 points. can do.
  • the reward paid is 900.
  • the hourly cost information is information set for each execution subject, and refers to information obtained by converting the result of each execution subject performing a task per unit time into cost.
  • the hourly cost information may be set for each execution entity by the project registration entity.
  • the proportion of the work data that the result data occupies may be a proportion related to the time taken to acquire the work data.
  • the proportion of the work data that result data occupies may be a proportion related to the cost incurred in obtaining the work data.
  • the server 100 may distribute profits for the use of joint works based on the share ratio. In this case, a portion of the revenue may be provided to the platform that manages the server 100.
  • the fees received by the platform may be understood simply as compensation for service provision, but may also be understood as expenses for operating expenses, risk management, administrative work provision, and the like according to embodiments.
  • the platform manages assets by comprehensively considering administrative costs and risks, and can set fees.
  • the server 100 may obtain contribution information indicating a degree to which the copyright holder of the first sub-work and the rest of the performing entity have contributed to the first sub-work.
  • the remaining execution subjects for the first sub-work may be the second execution subject and the third execution subject.
  • the remaining execution subjects for the second sub-work may be the first execution subject and the third execution subject
  • the remaining execution subjects for the third sub-work may be the first execution subject and the second execution subject.
  • the contribution level information may mean a degree to which the second execution subject and the third execution subject are involved in the creation of the first sub-work.
  • the server 100 may obtain information on the degree of association between the first sub-work and the remaining sub-work.
  • the degree of association information may be obtained differently according to the degree to which each sub-work is related. For example, when the combined work is music, the first sub-work is lyrics, and the second sub-work is music, the server 100 may determine that the lyrics and songs are close in music, and thus obtain high correlation information. . Alternatively, when the combined work is a published work produced by collecting short pieces and the first sub-work and the second sub-work are separate pieces, the server 100 determines that each piece is less closely related to the published work. You can set the degree of association low.
  • the degree of association may be obtained using the method of FIGS. 8 and 9 described above. That is, the server 100 may acquire each cluster including the first to third sub-works, and determine a degree of association between each sub-works based on the distance between the acquired clusters. The greater the distance, the lower the degree of association, and the closer the distance, the higher the degree of association.
  • step S720 the server 100 may determine the contribution level information of the remaining execution subjects to the first sub-work based on the association level information.
  • step S730 when profit for the first sub-work is generated, the server 100 may distribute the generated profit to a plurality of execution entities according to the contribution level information.
  • the server 100 may provide a profit corresponding to a preset ratio among the profits generated for the sub-work to the copyright holder, and distribute the remaining profits according to the contribution information of the remaining executing entities.
  • the server 100 may provide a profit of 80 to the first executing entity.
  • the server 100 may provide a revenue of 16 to the second execution entity and a revenue of 4 to the third execution entity.
  • FIG. 14 is a block diagram of an apparatus according to an exemplary embodiment.
  • the processor 102 may include one or more cores (not shown) and a graphic processing unit (not shown) and/or a connection path (eg, a bus) for transmitting and receiving signals with other components. .
  • the processor 102 executes one or more instructions stored in the memory 104 to perform the method described with respect to FIGS. 1 to 13.
  • the processor 102 temporarily and/or permanently stores a signal (or data) processed inside the processor 102, a RAM (Random Access Memory, not shown) and a ROM (Read-Only Memory). , Not shown) may further include.
  • the processor 102 may be implemented in the form of a system on chip (SoC) including at least one of a graphic processing unit, RAM, and ROM.
  • SoC system on chip
  • the memory 104 may store programs (one or more instructions) for processing and controlling the processor 102. Programs stored in the memory 104 may be divided into a plurality of modules according to functions.
  • the steps of a method or algorithm described in connection with an embodiment of the present invention may be implemented directly in hardware, implemented as a software module executed by hardware, or a combination thereof.
  • the software module includes Random Access Memory (RAM), Read Only Memory (ROM), Erasable Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), Flash Memory, hard disk, removable disk, CD-ROM, or It may reside on any type of computer-readable recording medium well known in the art to which the present invention pertains.
  • Components of the present invention may be implemented as a program (or application) and stored in a medium in order to be executed in combination with a computer that is hardware.
  • Components of the present invention may be implemented as software programming or software elements, and similarly, embodiments include various algorithms implemented with a combination of data structures, processes, routines or other programming components, including C, C++ , Java, assembler, etc. may be implemented in a programming or scripting language. Functional aspects can be implemented with an algorithm running on one or more processors.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Technology Law (AREA)
  • Software Systems (AREA)
  • Tourism & Hospitality (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Multimedia (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

L'invention concerne un procédé de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet, le procédé de gestion étant exécuté par un serveur. Le procédé de gestion selon la présente invention comprend : une étape consistant à obtenir des données de projet produites pendant une procédure d'exécution de projet (S110); une étape consistant à obtenir, à partir des données de projet, des données d'au moins un travail à enregistrer sous la forme d'un travail protégé par droit d'auteur (S120); une étape consistant à déterminer si les données du travail ou des travaux sont identiques à un travail préenregistré (S130); une étape consistant, lorsque les données du travail ou des travaux ne sont pas identiques au travail préenregistré, à transmettre, à un nœud sur une chaîne de blocs, des informations pour gérer les données de l'au moins un travail (S140); et une étape d'enregistrement du droit d'auteur au travail ou aux travaux (S150).
PCT/KR2020/001555 2019-03-14 2020-02-03 Procédé et système de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet basée sur une chaîne de blocs WO2020184838A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020190029302A KR102048944B1 (ko) 2019-03-14 2019-03-14 블록체인 기반 프로젝트 수행 과정에서 획득되는 저작물의 저작권 관리 방법 및 시스템
KR10-2019-0029302 2019-03-14

Publications (1)

Publication Number Publication Date
WO2020184838A1 true WO2020184838A1 (fr) 2020-09-17

Family

ID=68731193

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2020/001555 WO2020184838A1 (fr) 2019-03-14 2020-02-03 Procédé et système de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet basée sur une chaîne de blocs

Country Status (2)

Country Link
KR (1) KR102048944B1 (fr)
WO (1) WO2020184838A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112954074A (zh) * 2021-03-29 2021-06-11 北京三快在线科技有限公司 一种区块链网络连接方法及装置

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102048944B1 (ko) * 2019-03-14 2019-11-26 김보언 블록체인 기반 프로젝트 수행 과정에서 획득되는 저작물의 저작권 관리 방법 및 시스템
KR102544332B1 (ko) * 2020-12-04 2023-06-15 채진호 창작물 거래 서비스 관리 서버 및 그 운영 방법
WO2024111700A1 (fr) * 2022-11-21 2024-05-30 주식회사 필더필 Système de gestion de droits d'auteur et procédé associé

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002269274A (ja) * 2001-03-07 2002-09-20 Sony Corp データベース装置、書類作成支援装置、書類作成支援方法及び書類作成支援システム
KR101628005B1 (ko) * 2015-02-05 2016-06-13 주식회사 코인플러그 블록체인을 기반으로 하는 디지털 콘텐츠의 저작권리 위변조 감지시스템
KR20180112027A (ko) * 2016-03-01 2018-10-11 후아웨이 테크놀러지 컴퍼니 리미티드 저작권 관리 방법 및 시스템
KR101938878B1 (ko) * 2018-06-14 2019-01-15 김보언 블록체인 기반 저작권 관리 시스템
KR101949510B1 (ko) * 2019-01-15 2019-02-18 (주)엔터랩 블록 체인 및 가상 화폐를 이용한 과제 매칭 정보를 수집하고, 수집된 정보를 교차검증 하는 방법, 장치 및 프로그램
KR102048944B1 (ko) * 2019-03-14 2019-11-26 김보언 블록체인 기반 프로젝트 수행 과정에서 획득되는 저작물의 저작권 관리 방법 및 시스템

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20090000898A (ko) 2007-06-28 2009-01-08 엘지전자 주식회사 저작권이 적용된 사용자 손수 저작물의 생성과 운용을 위한방법 및 장치

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002269274A (ja) * 2001-03-07 2002-09-20 Sony Corp データベース装置、書類作成支援装置、書類作成支援方法及び書類作成支援システム
KR101628005B1 (ko) * 2015-02-05 2016-06-13 주식회사 코인플러그 블록체인을 기반으로 하는 디지털 콘텐츠의 저작권리 위변조 감지시스템
KR20180112027A (ko) * 2016-03-01 2018-10-11 후아웨이 테크놀러지 컴퍼니 리미티드 저작권 관리 방법 및 시스템
KR101938878B1 (ko) * 2018-06-14 2019-01-15 김보언 블록체인 기반 저작권 관리 시스템
KR101949510B1 (ko) * 2019-01-15 2019-02-18 (주)엔터랩 블록 체인 및 가상 화폐를 이용한 과제 매칭 정보를 수집하고, 수집된 정보를 교차검증 하는 방법, 장치 및 프로그램
KR102048944B1 (ko) * 2019-03-14 2019-11-26 김보언 블록체인 기반 프로젝트 수행 과정에서 획득되는 저작물의 저작권 관리 방법 및 시스템

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112954074A (zh) * 2021-03-29 2021-06-11 北京三快在线科技有限公司 一种区块链网络连接方法及装置

Also Published As

Publication number Publication date
KR102048944B1 (ko) 2019-11-26

Similar Documents

Publication Publication Date Title
WO2020184838A1 (fr) Procédé et système de gestion du droit d'auteur sur un travail obtenu pendant une procédure d'exécution de projet basée sur une chaîne de blocs
WO2019124610A1 (fr) Procédé d'authentification utilisant une séparation, puis le stockage distribué et combinaison d'informations personnelles utilisant une chaîne de blocs
WO2019208861A1 (fr) Dispositif et procédé pour fournir un service de transaction de cryptomonnaie au moyen d'un portefeuille électronique
WO2020022668A1 (fr) Procédé, appareil et programme d'appariement de tâches utilisant une chaîne de blocs
WO2021006505A1 (fr) Procédé, appareil et programme de gestion de carrière d'expert
WO2020153581A1 (fr) Procédé d'émission de titres numériques adossés à des actifs et de négociation de titres numériques adossés à des actifs à base de chaîne de blocs, et appareil pour la mise en œuvre du procédé
WO2018124718A1 (fr) Procédé de fourniture de service de point intégré par gestion d'une base de données de solde pour chaque bloc d'une chaîne de blocs et serveur l'utilisant
WO2020179963A1 (fr) Système de transactions de droits de propriété intellectuelle utilisant une chaîne de blocs, et procédé de fonctionnement de celui-ci
WO2018124716A1 (fr) Procédé pour fournir un service de point intégré en utilisant une arborescence merkle dans un protocole basé sur utxo, et serveur d'appui l'utilisant
WO2020175753A1 (fr) Procédé et système permettant de gérer, sur la base de mégadonnées, des résultats de projet créés par un expert
WO2020130331A1 (fr) Procédé de partage et de vérification de blocs et de documents électroniques entre des nœuds dans une chaîne de blocs
WO2013168861A1 (fr) Système et procédé d'intermédiation des paiements
WO2020040482A2 (fr) Procédé, dispositif et programme de commande de plateforme d'experts
WO2020138595A1 (fr) Système basé sur une chaîne de blocs fournissant un service de fusions et d'acquisitions, et procédé de fonctionnement de celui-ci
WO2022265176A1 (fr) Système de paiement en devises virtuelles en ligne et hors ligne à base mobile et procédé pour nœuds inclus en réseau distribué à chaîne de blocs
WO2020080590A1 (fr) Système d'investissement commercial basé sur une chaîne de blocs et son procédé de commande
WO2013119031A1 (fr) Système de transactions de ventes immobilières et procédé de commande associé
WO2024117536A1 (fr) Système et procédé d'émission de nft
WO2021251672A1 (fr) Ordinateur de gestion de transaction de produit, système de transaction de produit et procédé de transaction de produit
KR102128875B1 (ko) 전문가에 의해 생성되는 프로젝트 결과물에 대한 수익을 기여도 정보를 바탕으로 분배하는 방법 및 시스템
KR102128874B1 (ko) 전문가에 의해 생성되는 프로젝트 결과물을 기여도 정보를 바탕으로 관리하는 방법 및 시스템
WO2019125081A1 (fr) Système d'octroi de droits d'accès à usage unique à l'aide d'une chaîne de blocs
WO2022211187A1 (fr) Serveur d'évaluation pour effectuer une évaluation de droits sur des œuvres créatives
WO2023145984A1 (fr) Système pour fournir des services d'analyse de données sur la base d'une chaîne de blocs et procédé de fonctionnement de système
WO2019172464A1 (fr) Livre p2p de monnaies fiduciaires qui n'utilise pas de cryptomonnaie

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20771157

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20771157

Country of ref document: EP

Kind code of ref document: A1