WO2021137392A1 - Procédé de gestion d'actifs vidéo basé sur une chaîne de blocs - Google Patents

Procédé de gestion d'actifs vidéo basé sur une chaîne de blocs Download PDF

Info

Publication number
WO2021137392A1
WO2021137392A1 PCT/KR2020/012720 KR2020012720W WO2021137392A1 WO 2021137392 A1 WO2021137392 A1 WO 2021137392A1 KR 2020012720 W KR2020012720 W KR 2020012720W WO 2021137392 A1 WO2021137392 A1 WO 2021137392A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
hash
work
participants
identifier
Prior art date
Application number
PCT/KR2020/012720
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 재단법인 경주스마트미디어센터
Priority to JP2022540947A priority Critical patent/JP2023521266A/ja
Publication of WO2021137392A1 publication Critical patent/WO2021137392A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/254—Management at additional data server, e.g. shopping server, rights management server
    • H04N21/2541—Rights Management
    • 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
    • G06Q50/184—Intellectual property management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/45—Management operations performed by the client for facilitating the reception of or the interaction with the content or administrating data related to the end-user or to the client device itself, e.g. learning user preferences for recommending movies, resolving scheduling conflicts
    • H04N21/462—Content or additional data management, e.g. creating a master electronic program guide from data received from the Internet and a Head-end, controlling the complexity of a video stream by scaling the resolution or bit-rate based on the client capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Definitions

  • the present invention relates to a block chain-based video work management method that can fundamentally prevent copyright disputes over video works by managing video works using block chains and secret sharing and hash functions in a multi-participant environment.
  • block chain provides high transparency and reliability to users in terms of data management because it is impossible to forge or falsify data stored in a specific block using a hash function.
  • There is no need for a central administrator because the blocks connected in the form are distributed and stored, and the maintenance cost for safe data storage and management is relatively low.
  • the existing block chain creation method is performed through widely known cryptographic techniques and distributed consensus.
  • the encryption technique mainly uses a cryptographic hash function in which a secret key exists or a public key infrastructure (PKI).
  • PKI public key infrastructure
  • PKI mainly uses digital signature and public key cryptographic algorithms such as DSA, RSA, ECC, or EC-DSA.
  • DSA digital signature and public key cryptographic algorithms
  • RSA public key cryptographic algorithms
  • ECC electronic circuitry
  • EC-DSA public key cryptographic algorithms
  • the speed and the amount of computation are increasing exponentially. If the capacity of the data stored in the block increases, the time and amount of computation required for the operation increase accordingly, and as a result, separate software or hardware must be newly developed and constructed in the related field, thereby increasing the cost to solve this problem. will do
  • ECC there is a disadvantage that it cannot be used for storing nodes in the block chain right away because it has only recently entered the commercialization stage and checked various safety.
  • the existing block chain node creation technique can check the data stored in the block chain by using the participant's private key. However, if a participant loses the secret key or is attacked by a malicious attacker, sensitive information stored in the block chain node may be exposed as it is. Moreover, if the stored data in the block chain is a secret, managing it fundamentally depending on the secret key has a problem in that the cost of construction and maintenance in terms of the system increases.
  • An object of the present invention is to provide a block chain-based video work management method that can fundamentally prevent copyright disputes over video works by managing video works using block chains and secret sharing and hash functions in a multi-participant environment. .
  • a hash value (OV H ) by receiving the image work data including the work content and work result from the participant terminal, and applying a hash function to the received image work data; Reducing polynomial (Finite Field) with the number of participants (n) related to the image work data to be stored in the block chain, the identifiers of the participants (P i , 1 ⁇ i ⁇ n), and the identifiers of the participants as input values ( a preprocessing step of setting f(x)); By inputting the identifier (P i ) into the irreducible polynomial (f(x)), a hash fragment value (f(P i )) is generated, and the identifier (P i ) and hash fragment value (f(P i )) Distributing an ordered pair of (P i , f(P i )) to the participants, respectively, and an additional identifier (P n+1 ) and an additional hash fragment value (f(P n+1 )) other
  • the ordered pair (P i , f(P i )) of the identifier (P i ) and the hash fragment value (f(P i )) is converted into a Lagrange interpolation formula
  • the method may further include a proof-of-work step of performing proof-of-work by comparing f'(P n+1 )) with an additional hash fragment value f(P n+1 ) stored in the node.
  • the irreducible polynomial (f(x)) may be defined by the following equation (1).
  • t is a threshold value and, a j is the coefficient value inserted as part of the hash value (OV H) to be inserted in a block chain, the bit unit after parsing the binary hash value (OV H), mod is It is a remainder function to find the remainder of arbitrary division, GF is a polynomial belonging to Galois feild, and k means the number of bits)
  • At least a part of the hash value (OV H ) to be inserted into the block chain is a coefficient value (a j ) in the irreducible polynomial (f(x)). If it cannot be inserted, another irreducible polynomial (g(x), h(x), ...) is additionally set, until all transformed binary data of the hash value (OV H ) are inserted as coefficient values. It is possible to repeatedly perform the secret sharing step.
  • the irreducible polynomial (f'(x)) may be defined by the following Equation (2).
  • the additional identifier (P n+1 ) uses at least one of a nonce and a time stamp in a block chain system. Therefore, it can be specified according to the operation policy of the blockchain system.
  • a threshold value (t) for starting the proof-of-work step is set, and the threshold value (t) or more among n participants is collusive.
  • Proof of work can be performed by submitting an ordered pair (P i , f(P i )) of one’s own identifier (P i ) and hash fragment value (f(P i )) to the blockchain system.
  • the threshold value t may be set to a higher stake for a certain participant than other participants.
  • Deriving a hash value (OV H ) coupled with a computing device, receiving image work data including at least one of work content and work result from a participant terminal, and applying a hash function to the received image work data ;
  • a hash fragment value (f(P i )) is generated, and the identifier (P i ) and hash fragment value (f(P i )) Distributing an ordered pair of (P i , f(P i )) to the participants, respectively, and an additional identifier (P n+1 ) and an additional has
  • the ordered pair (P i , f(P i )) of the identifier (P i ) and the hash fragment value (f(P i )) is derived.
  • the additional hash fragment value (f'(P n+1 )) generated by inputting the additional identifier (P n+1 ) to the derived irreducible polynomial (f'(x)) and the additional hash fragment stored in the node
  • it may be implemented as a computer program stored in a computer-readable recording medium.
  • the actual original data (work contents (WR) and work result (CR)) are encrypted and stored in storage, a part of the hash value (OV H ) of the original data is stored in the node, and the data stored in the block chain node is It is impossible to arbitrarily forge or falsify, and all the participants who participated in the work production process check the work results and work contents before storage in the node through the participant terminals. transparency and reliability can be ensured.
  • the required time and amount of computation increase in proportion to the number of participants, but it is related to the number of participants using secret sharing and finite-body operation. Since the required time and amount of computation are constant, it is very efficient when creating a block chain node in a multi-participant environment, and it has the effect of being excellent in terms of space and time even when manufacturing hardware in the future. In addition, there is an effect that separate key management is not required.
  • FIG. 1 is a diagram illustrating a block chain-based image asset management system according to an embodiment of the present invention.
  • FIG. 2 is a flowchart illustrating a block chain-based image asset management method according to an embodiment of the present invention.
  • FIG 3 is a view for explaining a process of generating a coefficient value a j of the irreducible polynomial (f(x)) from a hash value (OV H ) in the step of performing secret sharing according to an embodiment of the present invention.
  • Figure 4 is the Identifier (P i) the irreducible polynomial (f (x)) by the identifier (P i) and the hash fragment value (f (P i)) entered in the performing step shared secret according to an embodiment of the present invention It is a diagram for explaining the process of distributing the ordered pairs (P i , f(P i )) to the participants, respectively.
  • FIG. 5 is a diagram for explaining a work proof step according to an embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a computing device according to an embodiment of the present invention.
  • block chain As a data storage technology in a distributed ledger environment, block chain provides high transparency and reliability to users in terms of data management and provides high transparency and reliability to users in terms of data management because it is impossible to forge or falsify data stored in a specific block using a hash function. Since the connected blocks are distributed and stored, there is no need for a central administrator, and the maintenance cost for safe data storage and management is relatively low.
  • the hash value derived by applying the hash function to the hash value (OV H ) is stored in the block chain node by applying the secret sharing of the present invention. This can reduce costs in terms of management and maintenance of blockchain data.
  • system a block chain-based image copyright management system
  • the system generates a hash fragment value (f(P i )) using the hash value (OV H ), distributes it to the participants, performs secret sharing, temporarily stores it in the blockchain node, and stores the encrypted work content ( WR) and work results (CR) are stored in the system's storage. (See Fig. 1B)
  • Participants perform proof of work by submitting the hash fragment value f(P i ) to the system through the participant terminal.
  • the system creates a blockchain node. (See Fig. 1 C)
  • FIG. 2 is a flowchart illustrating a block chain-based image asset management method according to an embodiment of the present invention.
  • the block chain-based image asset management method (hereinafter, also referred to as “image asset management method”) according to an embodiment of the present invention includes a hash value derivation step (S100), a pre-processing step (S200) , a secret sharing step (S300), a work proof step (S400), and a block chain storage step (S500).
  • the above steps ( S100 to S500 ) may be performed by a computing device performing an arithmetic function, and the computing device will be described later with reference to FIG. 6 .
  • a specific participant uploads video work data including work details and work results for the work performed by him/her to the system.
  • the system receives the work content (WR) and work result (CR) written by a specific participant, and applies a hash function to the received image work data to derive a hash value (OV H ).
  • the hash function may use SHA (Secure Hash Algorithm)-3.
  • the system Simultaneously with deriving the hash value (OV H ), the system performs cryptographic operations on the work content (WR) and the work result (CR). That is, the actual original data (work contents (WR) and work result (CR)) are encrypted and stored in the storage, and a part of the hash value (OV H ) of the original data is stored in the node.
  • a technique used for encryption operation uses a symmetric key encryption such as AES (Advanced encryption standard) or a one-time password (OTP), but the secret key used for this may be applied differently depending on the system policy.
  • the number of participants (n) related to the image work data to be stored in the blockchain the identifiers of the participants (P i ⁇ P n ), the irreducible polynomial (f(x)) in the finite field, and the proof of work Set a threshold value (t) for
  • n the number of participants participating in the production of video copyrighted data. And, for each participant, a participant's unique identifier (P i ⁇ P n ) is set.
  • the identifiers P i to P n may be set to an arbitrary number.
  • the minimum number of participants required for work proof is set as the threshold value (t).
  • the threshold value t may be set to 5.
  • a particular participant may have a higher stake than another participant. That is, a general participant is counted as 1, while a specific participant may be counted as 2 or more.
  • a finite field is a field that has only a finite number of elements and forms an algebraic structure. It means a field in which the result of operation (addition, multiplication, etc.) of elements in a finite field set is again within the set.
  • An irreducible polynomial is a polynomial that cannot be factored any further.
  • the reduced polynomial (f(x)) on the finite field set in this step is, for example, the following equation (1).
  • t is a threshold value
  • a j is a coefficient value inserted as part of the hash value (OV H) to be inserted in a block chain
  • mod is a remainder function that finds the remainder of any division
  • GF is a polynomial belonging to Galois feild.
  • k means the number of bits, generally 8 or 16 is selected, and up to 64 can be selected depending on the amount of data to be stored in the block chain.
  • the identifier (P i ) is input into the reduced polynomial (f(x)) of Equation (1 ) to generate a hash fragment value (f(P i )), and the identifier (P i ) and the corresponding hash Secret sharing is performed by distributing ordered pairs (P i , f(P i )) of the fragment values (f(P i )) to the participants, respectively.
  • secret sharing means that the hash fragment value f(P i ) is distributed to several participants, respectively.
  • the identifier (Pi) performs a function similar to a kind of public key, and the hash fragment value (f(Pi)) performs a function similar to the private key (or private key).
  • the corresponding block data may be hacked, but even if the hash fragment value f(Pi) of the present invention is exposed, since the secret is shared among the participants, Hacking is impossible and block data can be hacked only when t or more hash fragment values (f(P i )) are exposed, but in the real world, hash fragment values (f(P i )) are t threshold values. Since there is almost no case of abnormal exposure, the secret sharing method is superior in terms of safety compared to the existing public key or symmetric key.
  • coefficient of the polynomial a j (j is 0 ⁇ t-1) is a hash value (OV H) to insert into the physical block chain, and then parse the binary hash value (OV H) , is inserted into the coefficient value a j in a certain unit.
  • the predetermined unit may be, for example, 8 bits or 16 bits, and may be the k size of GF(2 k ) in Equation (1).
  • the sum of the coefficient values a j can be a binary hash value (OV H ).
  • the coefficient value a j will be described with reference to FIG. 3 .
  • 3 is a view for explaining a process of generating a coefficient value a j of the irreducible polynomial (f(x)) from a hash value (OV H ) in the step of performing secret sharing according to an embodiment of the present invention.
  • the hash value OV H of the image work data is converted into binary data by the computing device of the present invention.
  • the converted binary data is divided into a certain bit unit, and this is inserted as a coefficient value a j of the reduced polynomial (f(x)).
  • All the converted binary data is divided into a predetermined bit unit and inserted as a coefficient value a j of the reduced polynomial (f(x)). Therefore, if all the coefficient values a j are summed, the hash value OV H may be binary data, and the hash value OV H may be extracted by converting it again.
  • an identifier (P i ) consisting of an arbitrary number is input into the irreducible polynomial (f(x)) of Equation (1) to enter the hash fragment value (f(P) i )) can be created.
  • the identifier (P i ) is input into the irreducible polynomial (f(x)) in this secret sharing step, and an ordered pair (P i , f( ) of the identifier (P i ) and the hash fragment value (f(P i )) The process of distributing P i )) to each participant is shown.
  • a hash fragment value (f(P n+1 )) to be temporarily stored in the blockchain node is additionally generated.
  • the hash fragment value (f(P n+1 )) temporarily stored in the node is called the additional hash fragment value.
  • the additional hash fragment value f(P n+1 ) is generated by inputting the additional identifier P n+1 into equation (1).
  • the additional identifier (P n+1 ) uses values such as nonce and time stamp within the block chain system and may be separately specified according to the operation policy of the block chain system.
  • the additional hash fragment value f(P n+1 ) is stored in the node for proof-of-work in the proof-of-work step to be described later.
  • This step is a process of verifying data through proof-of-work of the additional hash fragment value (f(P n+1 )) temporarily stored in the blockchain node.
  • the proof-of-work step will be described with reference to FIG. 5 .
  • 5 is a diagram for explaining a work proof step according to an embodiment of the present invention.
  • the process of proof-of-work is the same as the restoration process of shared secret, and is performed using Lagrange interpolation.
  • the interpolation method is a method of estimating the value of the interval using discrete data
  • the Lagrange interpolation method is a method of creating an nth-order polynomial with (n+1) coordinates.
  • x is the variable of the polynomial f'(x)
  • x o is the identifier (P o )
  • x j is the identifier (P j )
  • y j is the hash fragment value (f(P j ))
  • ⁇ is a function that means product.
  • the additional hash fragment value (f'(P n+1 )) by inputting the additional identifier (P n+1 ) stored in the node in step S300 into the reduced polynomial (f'(x)) derived through Equation (2) create Next, the newly created additional hash fragment value f'(P n+1 ) is compared with the additional hash fragment value f(P n+1 ) stored in the node, and if they are the same, the proof-of-work is terminated. (See Fig. 5B)
  • binary data of the hash value (OV H ) is created by summing all the coefficient values a j , and the hash value (OV H ) can be extracted by converting it again. (See Fig. 5C)
  • SHA-3 is a cryptographic hash function announced in August 2015 by the US National Institute of Standards and Technology to replace SHA-2.
  • the hash value of the node before the blockchain to create a block in the form of a chain designates various values that are policy-specified within the SHA-3 input. Through this, a new type of blockchain-based image asset management method using secret sharing is completed.
  • the secret sharing execution step (S300) is performed with a coefficient value in one irreducible polynomial (f(x)) If it is not completed, another irreducible polynomial (g(x), h(x), ...) is additionally set, and the secret sharing is performed repeatedly until all transformed binary data are inserted as coefficient values (S300). ) is performed. In this case, step S300 is completed while additional hash fragment values (g(P n+1 ), h(P n+1 ), ...) are stored in the node as many as the number of irreducible polynomials.
  • the actual original data (work contents (WR) and work result (CR)) are encrypted and stored in storage, a part of the hash value (OV H ) of the original data is stored in the node, and the data stored in the block chain node is It is impossible to arbitrarily forge or falsify, and all the participants who participated in the work production process check the work results and work contents before storage in the node through the participant terminals. transparency and reliability can be ensured.
  • the required time and amount of computation increase in proportion to the number of participants, but it is related to the number of participants using secret sharing and finite-body operation. Since the required time and amount of computation are constant, it is very efficient when creating a block chain node in a multi-participant environment, and it has the effect of being excellent in terms of space and time even when manufacturing hardware in the future. In addition, there is an effect that separate key management is not required.
  • the computing device TN100 of FIG. 6 may be a computing device that performs operations S100 to S500 described above.
  • the computing device TN100 may include at least one processor TN110 , a transceiver device TN120 , and a memory TN130 .
  • the computing device TN100 may further include a storage device TN140 , an input interface device TN150 , an output interface device TN160 , and the like.
  • Components included in the computing device TN100 may be connected by a bus TN170 to communicate with each other.
  • the processor TN110 may execute a program command stored in at least one of the memory TN130 and the storage device TN140.
  • the processor TN110 may mean a central processing unit (CPU), a graphics processing unit (GPU), or a dedicated processor on which methods according to an embodiment of the present invention are performed.
  • the processor TN110 may be configured to implement procedures, functions, methods, and the like described in connection with an embodiment of the present invention.
  • the processor TN110 may control each component of the computing device TN100 .
  • Each of the memory TN130 and the storage device TN140 may store various information related to the operation of the processor TN110 .
  • Each of the memory TN130 and the storage device TN140 may be configured as at least one of a volatile storage medium and a non-volatile storage medium.
  • the memory TN130 may include at least one of a read only memory (ROM) and a random access memory (RAM).
  • the transceiver TN120 may transmit or receive a wired signal or a wireless signal.
  • the transceiver TN120 may be connected to a network to perform communication.
  • the present invention may be implemented as a computer program.
  • the present invention may be implemented as a computer program stored in a computer-readable recording medium in order to execute the block chain-based image copyright management method according to the present invention in combination with hardware.
  • the methods according to the embodiment of the present invention may be implemented in the form of a program readable by various computer means and recorded in a computer readable recording medium.
  • the recording medium may include a program command, a data file, a data structure, etc. alone or in combination.
  • the program instructions recorded on the recording medium may be specially designed and configured for the present invention, or may be known and available to those skilled in the art of computer software.
  • the recording medium includes magnetic media such as hard disks, floppy disks and magnetic tapes, optical recording media such as CDROMs and DVDs, and magneto-optical media such as floppy disks. optical media), and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • Examples of program instructions may include not only machine language such as generated by a compiler, but also a high-level language that can be executed by a computer using an interpreter or the like.
  • Such hardware devices may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Databases & Information Systems (AREA)
  • Technology Law (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • Tourism & Hospitality (AREA)
  • Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Power Engineering (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Operations Research (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Storage Device Security (AREA)

Abstract

La présente invention se rapporte à un procédé de gestion d'œuvre audiovisuelle basé sur une chaîne de blocs selon lequel, dans un environnement à plusieurs participants, une œuvre audiovisuelle est gérée à l'aide d'une chaîne de blocs, d'un partage de secret et d'une fonction de hachage et, ainsi, les conflits de droits d'auteur sur des œuvres audiovisuelles peuvent être fondamentalement empêchés. Selon un mode de réalisation de la présente invention, contrairement à la manière classique, selon laquelle le temps requis et la quantité de calcul requise augmentent de manière proportionnelle au nombre de participants lors de l'utilisation d'une fonction PKI ou de hachage ayant une clé, afin de générer une chaîne de blocs, la présente invention utilise un partage de secret et un calcul de champ fini, moyennant quoi le temps requis et la quantité de calcul requise restent constants quel que soit le nombre de participants. L'invention est donc très efficace lors de la génération d'un nœud de chaîne de blocs dans un environnement à plusieurs participants, et présente l'avantage d'être excellente en termes d'aspects spatiaux et temporels également pour la fabrication de matériel dans le futur. En outre, la présente invention présente un avantage selon lequel une gestion de clé distincte n'est pas nécessaire.
PCT/KR2020/012720 2019-12-30 2020-09-21 Procédé de gestion d'actifs vidéo basé sur une chaîne de blocs WO2021137392A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2022540947A JP2023521266A (ja) 2019-12-30 2020-09-21 ブロックチェーンベースの映像著作物管理方法

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020190178749A KR102234542B1 (ko) 2019-12-30 2019-12-30 블록 체인 기반 영상 저작물 관리 방법
KR10-2019-0178749 2019-12-30

Publications (1)

Publication Number Publication Date
WO2021137392A1 true WO2021137392A1 (fr) 2021-07-08

Family

ID=75237724

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2020/012720 WO2021137392A1 (fr) 2019-12-30 2020-09-21 Procédé de gestion d'actifs vidéo basé sur une chaîne de blocs

Country Status (3)

Country Link
JP (1) JP2023521266A (fr)
KR (1) KR102234542B1 (fr)
WO (1) WO2021137392A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101938878B1 (ko) * 2018-06-14 2019-01-15 김보언 블록체인 기반 저작권 관리 시스템
KR101986482B1 (ko) * 2017-12-12 2019-06-07 주식회사 디지캡 콘텐츠 정보 저장 및 관리를 위한 콘텐츠 블록체인
KR20190138645A (ko) * 2017-04-07 2019-12-13 엔체인 홀딩스 리미티드 블록체인을 이용한 안전한 데이터 레코드 분산을 위한 방법 및 시스템

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102093010B1 (ko) 2018-02-12 2020-03-24 박성배 블록 체인에 기반한 노드 장치, 노드 장치의 동작 방법 및 데이터 처리 시스템

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190138645A (ko) * 2017-04-07 2019-12-13 엔체인 홀딩스 리미티드 블록체인을 이용한 안전한 데이터 레코드 분산을 위한 방법 및 시스템
KR101986482B1 (ko) * 2017-12-12 2019-06-07 주식회사 디지캡 콘텐츠 정보 저장 및 관리를 위한 콘텐츠 블록체인
KR101938878B1 (ko) * 2018-06-14 2019-01-15 김보언 블록체인 기반 저작권 관리 시스템

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HYUN SUHNG-ILL, SHIN SANG-HO, YOO KEE-YOUNG: "A Proactive Secret Image Sharing Scheme over GF(28)", JOURNAL OF KOREA MULTIMEDIA SOCIETY, vol. 16, no. 5, 31 May 2013 (2013-05-31), pages 577 - 590, XP055825419, ISSN: 1229-7771 *
SAMIR SHERIF M.; MOHAMED HODA K.; SAID HAZEM: "Compact aggregate short-lived signatures for consortium consensus protocols", 2019 14TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND SYSTEMS (ICCES), 17 December 2019 (2019-12-17), pages 261 - 268, XP033756334 *

Also Published As

Publication number Publication date
KR102234542B1 (ko) 2021-03-31
JP2023521266A (ja) 2023-05-24

Similar Documents

Publication Publication Date Title
WO2021095998A1 (fr) Procédé et système informatiques sécurisés
WO2019194403A1 (fr) Dispositif utilisateur et dispositif électronique pour partager des données au moyen d'une chaîne de blocs et procédé de chiffrement homomorphe et procédés associés
WO2014119936A1 (fr) Procédé et appareil de traitement de logiciel à l'aide d'une fonction de hachage pour sécuriser le logiciel, et support lisible par ordinateur stockant des instructions exécutables pour mettre en œuvre le procédé
WO2019132272A1 (fr) Identifiant en tant que service basé sur une chaîne de blocs
US8108674B2 (en) Transmitting/receiving system and method, transmitting apparatus and method, receiving apparatus and method, and program used therewith
CN109635586B (zh) 媒体文件加密密钥管理方法、系统、设备及存储介质
WO2019045209A1 (fr) Module de fenêtre de blocs ayant un algorithme d'accord pour limiter le minage, serveur de gestion et système et procédé de négoce en monnaie virtuelle
US20210344500A1 (en) Computer-implemented system and method for transferring access to digital resource
WO2017119668A1 (fr) Appareil et procédé de transmission de données permettant la non-répudiation pour un message de transmission
WO2014003497A1 (fr) Génération et vérification de données additionnelles ayant un format spécifique
WO2014003516A1 (fr) Procédé et appareil de fourniture de partage de données
WO2014003362A1 (fr) Système et procédé d'authentification fondée sur otp
WO2018147488A1 (fr) Procédé sécurisé d'authentification basée sur des attributs pour le cloud computing
WO2021137391A1 (fr) Procédé de génération de chaîne de blocs utilisant un partage de secret
WO2019182377A1 (fr) Procédé, dispositif électronique et support d'enregistrement lisible par ordinateur permettant de générer des informations d'adresse utilisées pour une transaction de cryptomonnaie à base de chaîne de blocs
WO2021036511A1 (fr) Procédé de lecture, stockage et chiffrement de données, équipement terminal et support d'enregistrement
WO2019125041A1 (fr) Système d'authentification utilisant une séparation, puis un stockage distribué d'informations personnelles utilisant une chaîne de blocs
CN114697040A (zh) 一种基于对称密钥的电子签章方法和系统
JP2023535040A (ja) マスターキーエスクロープロセス
WO2020032351A1 (fr) Procédé permettant d'établir une identité numérique anonyme
CN111404892A (zh) 数据监管方法、装置和服务器
WO2019196866A1 (fr) Procédé, appareil et dispositif de traitement d'anonymisation, et support de stockage
WO2020111403A1 (fr) Procédé de sécurité d'image basé sur un flux chiffré à l'aide d'un tatouage numérique nul, serveur et support d'enregistrement lisible par ordinateur
WO2019125069A1 (fr) Système d'authentification à l'aide d'une séparation, puis d'une combinaison d'informations personnelles à l'aide d'une chaîne de blocs
JP5668549B2 (ja) 秘匿分析処理方法、プログラム及び装置

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: 20909227

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022540947

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20909227

Country of ref document: EP

Kind code of ref document: A1