KR102002488B1 - Document Acquisition System Using Off-Chain Distributed Storage Based on Block chain - Google Patents

Abstract

According to an embodiment of the present invention, a document deposit system using an off-chain distributed storage based on a block chain comprises: an electronic document conversion unit to encode or decode file name, issue time, and issuer information of a first electronic document with a hash value encoded with a public key of a user if original registration of the first electronic document is requested from a web application installed in a user terminal; an electronic suitability determining unit to analyze similarity of a noun sequence between the first electronic document and previously registered electronic documents to determine document registration suitability; a transaction registration unit to register a hash value of the first electronic document and a public key used in the hash value in a block chain node if document registration suitability of the first electronic document is determined from the transaction registration unit; an original verification unit to convert file name, issue time, and issuer information of a third electronic document to be verified into a hash value encoded with the public key of the user if original verification between the third electronic document provided from the web application installed in the user terminal and the first electronic document is requested, then verify identicalness between the hash value of the third electronic document and the hash value of the first electronic document registered in the block chain node, and then track a time at which the first electronic document is deposited to issue a deposit certificate verifying an order relationship to the third electronic document; and a distributed storage to distribute and store the hash value encoding the file name, issue time, and issuer information of the first electronic document converted by the electronic document conversion unit with the public key of the user.

Description

{Document Acquisition System Using Off-Chain Distributed Storage Based on Block Chain}

The present invention relates to a document imposition system and method utilizing block-chain based off-chain distributed repositories.

As a result of analyzing the 'Actual Survey on the Protection of Small and Medium Businesses' by the Ministry of Small and Medium Business Administration, SMEs, which account for the majority of domestic companies, are very vulnerable to cyber attacks, and the damages of the last three years due to hacking and technology leakage amounted to 31.2 billion won There is a result of reaching.

In order to solve this problem, there are a variety of services such as the deposit system of the technology data center and the original proof service of the Patent Office, but this is also vulnerable to hacking and cyber attacks.

In addition, in the case of the IMC, the technical center of SMEs and the original of the electronic document should be provided to the IMC, so that the burden on the technology provision of SMEs is imposed. In the case of the original proof service, It has the advantage of keeping only the value, but it has the disadvantage of not responsible for the loss of the original.

In addition, it is possible to solve the burden of 'original document proof of responsibility' which should prove that the original document holder has the original document in case of damage such as technology, leakage of electronic document, etc., through the above service, And to prove integrity and security.

Patent Registration No. 10-1796690

A problem to be solved by the present invention is to construct a document imposition system that utilizes a block-based off-chain distributed storage, thereby maximizing the security of the existing imitation center and the original proof service and compensating for the disadvantages.

An object of the present invention is to compensate for the disadvantages of a block chain by utilizing a distributed storage that offsets a document file based on a block chain.

It is an object of the present invention to prevent the exposure of a document stored in a distributed storage that is off-block-based off-axis by applying bidirectional encryption to the document

According to an aspect of the present invention, there is provided a document placement system using a distributed store that is off-chain based on a block chain. When a document registration of a first electronic document provided from a web application installed in a user terminal is requested, An electronic document conversion unit for encrypting the file name of the electronic document, the issuing time, and the issuer information by using a hash value encrypted by the user's public key; An electronic document similarity degree judging unit for analyzing a similarity degree of a noun arrangement between the first electronic document and the previously registered electronic documents to determine a document registration suitability; A transaction registration unit for registering the hash value of the first electronic document and the public key used for the hash value in the block chain node when the electronic document similarity degree judging unit judges that the first electronic document is suitable for document registration; When the third electronic document to be verified and the first electronic document to be verified provided from the web application installed in the user terminal are requested, the file name, the issuing time, and the issuer information of the third electronic document are encrypted with the public key of the user The hash value of the first electronic document registered in the block chain node is verified after the hash value of the third electronic document is converted into a hash value, 3 An original proof part that issues an immigration certificate proving the subsequent relationship with the electronic document; An off-chained distributed storage for storing the hash value obtained by encrypting the file name, the issuing time, and the issuer information of the first electronic document converted by the electronic document conversion unit with the public key of the user; And as a peer to the hyperreflective fabric block chain network to create a transaction, to monitor the network between block chain nodes in the distributed repository in conjunction with a hypervisor, to store the encrypted electronic document file, And a notarization center node for receiving and recovering the electronic document from the block chain node where the electronic document is damaged if the electronic document is damaged, wherein the electronic document similarity determining section provides the morpheme analysis library, A tokenizing unit for extracting only a noun from among a file name and a file content of the first electronic document through a function and separating the noun from the character string; An arrangement unit for sequentially arranging the nouns extracted from the tokenizing unit in columns or rows; A character string or an array of rows arranged in the array unit is converted into a sparse matrix using a fit_transform () function and a sparse matrix is converted into an array of the array unit using a toarry () ; And a similarity analyzer for analyzing the frequency of similar words between the first electronic documents and the first electronic documents using Equation 1, which is a TF-IDF (Term Frequency-Inverse Document Frequency) algorithm, The overall similarity between documents is analyzed using the calculated frequency of borrowing after calculating the frequency of similar words between previously registered electronic documents and first electronic documents and if the overall similarity is equal to or greater than a predetermined value And provides the determined judgment signal.
[Formula 1]
tf (t, d) = (number of documents (d) containing the word t) / (number of total documents)

delete

In one embodiment, the electronic document similarity determining unit extracts and arranges a noun among the characters in the first electronic document using the nouns () function of the morphological analysis library, and arranges the arrangement in a matrix using the fit_transform () And converts the data.

delete

delete

delete

delete

delete

delete

The use of a document imposition system utilizing a distributed store based on a block-chain-based off-chain according to an embodiment of the present invention allows a hash value of an electronic document to be compared when a trade secret dispute occurs and proof- The advantage is that the proof of originality can be provided by verifying the originality and the time of the document at the time it is imputed.

For example, if a patentee has been used before a patentee, but is found guilty of infringement of a patent right, and a proof of the fact that the patentee filed prior to the filing of the patent application is necessary, It can be used as a single document.

In addition, various physical and technological management measures are necessary to prevent leakage of technology. First of all, it is important to raise the awareness of the employees of the company. By informing the employees that they are taking insurance measures as the original proof service through the present invention, It can provide the effect of limiting the potential need for spillage.

1 is an exemplary view showing a hyper-redundancy fabric network configuration diagram.
Figure 2 is a block diagram illustrating a document placement system utilizing a distributed store of block-chain based offsets according to one embodiment of the present invention.
3 is a block diagram illustrating the detailed configuration of the electronic document similarity degree determination unit shown in FIG.
4 is an exemplary diagram illustrating the function of the original proof part shown in FIG.
FIG. 5 is an exemplary diagram illustrating the flow of information in a document placement system utilizing a block-chain-based off-chain storage depicted in FIG.
6 is a diagram illustrating an exemplary computing environment in which one or more embodiments disclosed herein may be implemented.

Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. It should be understood, however, that it is not intended to limit the techniques described herein to specific embodiments but to include various modifications, equivalents, and / or alternatives of the embodiments herein . In connection with the description of the drawings, like reference numerals may be used for similar components. In this specification, the expressions "having," " having, "" comprising," Quot ;, and does not exclude the presence of additional features.

As used herein, the expressions "A or B," "at least one of A and / or B," or "one or more of A and / or B," may include all possible combinations of the listed items . For example, "A or B," "at least one of A and B," or "at least one of A or B" includes (1) at least one A, (2) Or (3) at least one A and at least one B all together.

As used herein, the terms "first," "second," "first," or "second," and the like may denote various components, But is used to distinguish it from other components and does not limit the components. For example, the first user equipment and the second user equipment may represent different user equipment, regardless of order or importance. For example, without departing from the scope of the rights described herein, the first component can be named a second component, and similarly the second component can also be named a first component.

(Or functionally or communicatively) coupled with / to "another component (eg, a second component), or a component (eg, a second component) Quot; connected to ", it is to be understood that any such element may be directly connected to the other element or may be connected through another element (e.g., a third element). On the other hand, when it is mentioned that a component (e.g., a first component) is "directly connected" or "directly connected" to another component (e.g., a second component) It can be understood that there is no other component (e.g., a third component) between other components.

The phrase " configured to be used "as used herein should be interpreted according to circumstances, such as, for example, having " having the capacity to, To be designed to, "" adapted to, "" made to, "or" capable of ". The term " configured to (or set up) "may not necessarily mean" specifically designed to "in hardware. Instead, in some situations, the expression "configured to" may mean that the device can "do " with other devices or components.

For example, a processor configured (or configured) to perform the phrases "A, B, and C" may be implemented by executing one or more software programs stored in a memory device or a dedicated processor (e.g., an embedded processor) , And a generic-purpose processor (e.g., a CPU or an application processor) capable of performing the corresponding operations.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of the other embodiments. The singular expressions may include plural expressions unless the context clearly dictates otherwise. Terms used herein, including technical or scientific terms, may have the same meaning as commonly understood by one of ordinary skill in the art having recited herein. General predefined terms used herein may be interpreted in the same or similar sense as the contextual meanings of the related art and are to be understood as meaning ideal or overly formal meanings unless explicitly defined herein . In some cases, the terms defined herein can not be construed to exclude embodiments of the present disclosure.

First, prior to describing the present invention, the present invention is based on a hyperreflective fabric network for preventing leakage and forgery of a technical document and an electronic document, and for proving and verifying an original proof and integrity security.

Here, the fabric is a basic block chain, and conventional public block chains have additional functions such as selective use of unnecessary or unnecessary consensus algorithms, network participation authority control, channel and multi-book use.

The structural characteristics of the hyper leisure fabric are as follows.

First, only authorized participants can participate in the network as allowed block chains.

Second, it is possible to use a common programming language in smart contracts.

Third, the Smart Controct is executed by only a few nodes, so that a large number of transactions can be processed in parallel.

Fourth, it is possible to disclose a ledger only to authorized people using the channel.

Fifth, interchangeable agreement protocols can be used (SOLO, Kafka, PBFT, etc.)

Sixth, since the identity of the network participants can be confirmed by the permission block chain, the responsibility of the problem can be clarified.

Meanwhile, Hyperledger Fabric basically provides a single node method called SOLO (Single Ordering Service Node) and a Crash fault tolerance (CFT) based agreement protocol called Kafka method. Crash fault tolerance (CFT), which is the property of the Kafka scheme, is the property of reaching the right consensus even if some system components do not work. The Byzantine fault tolerance (BFT) system, which is mainly used in existing public block chains, is more complicated and slower than the CFT system because it considers malicious attacks as well as functional problems of system components.

Unlike public block chains, which do not require the permission of a specific entity to participate in the network, only a relatively reliable participant in the private block chain is authorized by the administrator and participates in the network. Therefore, attacks of malicious actors The probability is assumed to be very small. Thus, in the private block chain, a faster and simpler consensus protocol than the BFT-based consensus protocol is also considered to be an acceptable range.

Organizations that use the fabric can either use a supported consensus approach or implement it directly, and the fabric supports a "Pluggable consensus" in the ability to choose the consensus method.

In the private block chain, it is very important to control which network participants have privileges. The authority to access network resources for each group is determined by the administrator and stored in the Network Configuration. Also, a Certificate Authority (CA) is required because it requires a subject to manage the ID and authority of the participant. In short, CA is the authority issuing a digital certificate. Groups participating in the fabric network all use individual CAs.

Referring to FIG. 1, the elements forming the hyperreflex fabric network are as follows.

· Group or organization

· Ordering service nodes

· Certificate Authority (CA)

· Consortium

· Channel

· Channel configuration

· Ledger

Peer

· Client application

All of the above elements can exist in the network, and each element can be added to extend the network.

Here, the dictionary definition of the consortium is "a group of people or companies that agreed to cooperate together." In hyperreflective fabrics, when organizations form a consortium, they can share transaction history. Therefore, a consortium in hyperreflective fabrics can be seen as a group that shares common transactional goals and collaborates with common goals. There can be multiple consortia in a network, and what consortia are defined within a network configuration.

Next, the Channel is a group-to-group communication mechanism in a consortium that is very important in hyperreflective fabrics. Channels allow for data isolation and confidentiality, while channel-specific ledgers are accessible only to consortium members who have permission to use the channel. There is a channel configuration separate from the network configuration. The channel configuration information includes all the information necessary for operating the channel, such as the peer's authority to access the channel.

The channel setting information is recorded in a block in a block. The channel exists in the network but there are no overlapping settings between the network configuration and the channel setting, so even if the network setting is changed, there is no direct influence on the channel setting.

 Channels are an important feature that provides the advantage of not having a public block chain because it makes it possible to maintain privacy and efficient data sharing.

Within a network, there may be channels used by several consortia.

Next, in the block chain, a 'ledger' is an 'immutable state database'. In a hyper-leisure fabric, one channel has one book. Nodes that physically host this book are called peers, and multiple peers in a channel have a copy of a book.

The updating of the book is done through consensus of several peers, so it is possible to maintain consistency. A peer is an entity that physically hosts a ledger and stores a Chaincode (smart contract of a hyperreflective fabric). The peer can be assigned an identity from the CA and participate in the channel.

On the other hand, in a hyper leisure fabric, transactions occur in the following order.

1. The client application generates a transaction proposal through the SDK.

2. The endorsing peers in the endorsing policy of the chain code execute the chain code.

3. Each result value is passed to the client application.

4. If the outcome satisfies the assurance policy, the outcome is delivered to the ordering service.

5. The ordering service creates blocks in the order of arrival and delivers them to all the peers of the channel.

6. All peers verify that the arriving block meets the assurance policy and that the ledger state has not changed during the transaction.

7. Each peer adds a block to the chain of channels and updates the state of the book.

So far, we have briefly described the hyperreflex fabric network architecture and transaction sequence.

Hereinafter, a document placement system utilizing a block-chain-based off-chain distributed storage according to an embodiment of the present invention will be described in more detail based on the accompanying drawings.

FIG. 2 is a block diagram illustrating a document imposition system utilizing a block-chain-based off-chain distributed storage according to an embodiment of the present invention. FIG. 3 is a block diagram illustrating a detailed configuration of the electronic document similarity degree determining unit shown in FIG. FIG. 4 is an exemplary view for explaining the function of the original proof part shown in FIG. 2, and FIG. 5 is an example showing a flow of information in the document provision system utilizing the distributed storage that is block chain- .

2 to 5, a document imposition system 100 utilizing a block-chain-based off-chain distributed storage according to an exemplary embodiment of the present invention includes an electronic document conversion unit 110, an electronic document similarity determination unit 120 A transaction registration unit 130, an original proof unit 140, and a distributed repository 150.

The electronic document conversion unit 110 receives a request for original registration of a first electronic document from a web application installed in the user terminal and generates a hash of the first electronic document encrypted with the public key of the user, Encrypt by value.

The electronic document similarity degree determining unit 120 is configured to determine a document registration fitness by analyzing a similarity degree of a noun arrangement between the first electronic document and preliminarily registered electronic documents. The electronic document similarity degree determining unit 120 includes a tokenizing unit 121, ), A matrix transforming unit 123, and a similarity analyzing unit 124.

The tokenizing unit 121 provides a morpheme analysis library and extracts only nouns from the file name and file contents of the first electronic document through the nouns () function of the morpheme analysis library and separates the nouns from the strings.

Here, the morphological analysis library disclosed herein may be an essential structure for verifying the similarity of an electronic document related to a patent, a copyright, a dissertation, etc. through a morpheme, more preferably a word (noun).

For example, in an electronic document, contracts are mostly used for electronic documents such as patents and copyrights, since the contents are mostly the same and only the contractor is different.

The arrangement unit 122 sequentially arranges the nouns extracted from the tokenizing unit 121 in columns or rows.

The matrix conversion unit 123 converts the array of characters or rows arranged in the array unit 122 into a sparse matrix using the fit_transform () function.

The matrix transforming unit 123 may transform a sparse matrix into an array of the array unit 122 using a toarry () function.

Next, the similarity analyzer 124 analyzes the frequency of similar words between the first electronic documents and the first electronic documents using Equation 1, which is a TF-IDF (Term Frequency-Inverse Document Frequency) algorithm.

[Formula 1]

tf (t, d) = (the number of documents containing the word t) / (the total number of documents)

For reference, TF-IDF (Term Frequency-Inverse Document Frequency) is a weighting value used in information retrieval and text mining. It is a statistical value that indicates how important a word is in a specific document when there are document groups composed of several documents. It can be used to extract key words of a document, to rank search results in a search engine, to obtain similarity between documents, and so on.

TF (word frequency, term frequency) is a value that indicates how often a particular word appears in a document. DF (document frequency) means that the word itself is frequently used in a document set, IDF (reverse document frequency), and TF-IDF is a product of TF and IDF.

Here, TF-IDF can be obtained using the Scikit-Learn library.

The following three sentences are illustrated by way of example.

Calculate TF value

Since we need to know how many words are in the document, count how many of those words are in each document.

Calculate IDF values

The IDF value is log (total number of documents / number of documents in which the word appears). For example, if Tom is calculated, the number of documents in which the word appears is 2, and since the total number of documents is 3, a value of Log (3/2) ≒ 0.18 appears.

Calculate TF-IDF value

The TF-IDF value is a product of the TF value and the IDF value. For the 'his' word, the TF value is 2 and the IDF value is 0.48, so 2 × 0.48 = 0.96, which is the product of the two, becomes the TF-IDF value. In the table below, 'play' in Doc1, 'loves' in Doc 2, and 'his' in Doc3 are the most important words.

Since all the TF-IDF values have been calculated, the similarity degree can be analyzed using the Scikit-Learn library for numerical values in words in the document.

For reference, stop_words = 'english' used in the example can be replaced with the following code.

On the other hand, the similarity analyzer 124 may calculate the frequency of similar words between previously registered electronic documents and the first electronic documents, and then analyze the overall similarity between the documents using the calculated frequency of borrowing, If the degree of similarity is equal to or greater than a predetermined percentage, a judgment signal that is determined to be similar is provided.

If the degree of similarity is equal to or greater than a predetermined reference value, the similarity determination unit 124 determines that the electronic document is not the only electronic document, and can refuse registration of the first electronic document.

That is, the similarity determination unit 120 analyzes the degree of similarity between the file name and the file content between the first electronic document and the previously registered electronic document to determine the suitability of the document registration.

The transaction registering unit 130 registers the hash value of the first electronic document and the public key used for the hash value in the distribution database 120, In the block chain node of FIG.

Here, when the transaction registration unit 130 issues a rental certificate in the original certificate 140 to be described later, the transaction registration unit 130 may register information such as the issuer requesting issuance of the issuance certificate, issuance time and the like in the block chain node.

Next, when the proof of authenticity between the third electronic document to be verified and the first electronic document provided from the web application is requested, the original proof unit 140 displays the file name of the third electronic document, the issuing time, The hash value of the first electronic document registered in the block chain node and the hash value of the first electronic document registered in the block chain node, And then issues a certificate of immigration proving the subsequent relationship with the third electronic document.

The off-chain distributed storage 150 distributes and stores the hash value obtained by encrypting the file name, the issuing time, and the issuer information of the first electronic document converted by the electronic document conversion unit using the public key of the user.

The off-chain distributed storage 150 may be a server corresponding to each node, or a server managing each block-chain node. In addition, the off-chain distributed storage 150 can manage status information of electronic documents stored in each node. In addition, the off-chain distributed storage 150 may be composed of a first block chain database and a second block chain database. In this case, the first block chain database may be a private block chain database, and the second block chain database may be a private block chain database or a public block chain database.

That is, the off-chain distributed storage 150 may distribute and store the electronic document encrypted with the user's public key for preventing intrusion and exposure of the registered electronic document.

Meanwhile, the document imposition system 100 utilizing the block-chain-based off-chain distributed storage according to an exemplary embodiment of the present invention may further include the notarization center node 160.

The notarization center 160 is composed of one node and participates as a peer in a hyperreflective fabric block chain network to create a transaction.

The notarization center node 160 can monitor the network between the block chain nodes in the distributed storage 150 in cooperation with the hyperrecessor explorer.

The notarization center node 160 stores the encrypted electronic document file. When the electronic document is damaged, the notarization center node 160 can receive and recover the electronic document from the block chain node where the corresponding electronic document is stored.

FIG. 6 is a diagram illustrating an exemplary computing environment in which one or more embodiments disclosed herein may be implemented. An example of a system 1000 including a computing device 1100 configured to implement one or more of the above- / RTI > For example, the computing device 1100 may be a personal computer, a server computer, a handheld or laptop device, a mobile device (mobile phone, PDA, media player, etc.), a multiprocessor system, a consumer electronics device, A distributed computing environment including any of the above-described systems or devices, and the like.

The computing device 1100 may include at least one processing unit 1110 and memory 1120. [ The processing unit 1110 may include, for example, a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor, an application specific integrated circuit (ASIC), a field programmable gate array And may have a plurality of cores. The memory 1120 can be a volatile memory (e.g., RAM, etc.), a non-volatile memory (e.g., ROM, flash memory, etc.) or a combination thereof. In addition, the computing device 1100 may include additional storage 1130. Storage 1130 includes, but is not limited to, magnetic storage, optical storage, and the like. The storage 1130 may store computer readable instructions for implementing one or more embodiments as disclosed herein, and other computer readable instructions for implementing an operating system, application programs, and the like. The computer readable instructions stored in storage 1130 may be loaded into memory 1120 for execution by processing unit 1110. In addition, computing device 1100 may include input device (s) 1140 and output device (s) 1150.

Here, input device (s) 1140 may include, for example, a keyboard, a mouse, a pen, a voice input device, a touch input device, an infrared camera, a video input device, or any other input device. Also, output device (s) 1150 can include, for example, one or more displays, speakers, printers, or any other output device. In addition, computing device 1100 may use an input device or output device included in another computing device as input device (s) 1140 or output device (s) 1150. [

The computing device 1100 may also include communication connection (s) 1160 that allow the computing device 1100 to communicate with other devices (e.g., computing device 1300).

(S) 1160 may include a modem, a network interface card (NIC), an integrated network interface, a radio frequency transmitter / receiver, an infrared port, a USB connection or other Interface. Also, the communication connection (s) 1160 may include a wired connection or a wireless connection. Each component of the computing device 1100 described above may be connected by various interconnects (e.g., peripheral component interconnect (PCI), USB, firmware (IEEE 1394), optical bus architecture, etc.) And may be interconnected by the network 1200. As used herein, the terms "component," "system," and the like generally refer to a computer-related entity, which is hardware, a combination of hardware and software, software, or software in execution.

For example, an element may be, but is not limited to being, a processor, an object, an executable, an executable thread, a program and / or a computer running on a processor. For example, both the application running on the controller and the controller may be components. One or more components may reside within a process and / or thread of execution, and the components may be localized on one computer and distributed among two or more computers.

While the present invention has been described in connection with what is presently considered to be practical exemplary embodiments, it is to be understood that the invention is not limited to the disclosed embodiments. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined by the scope of the appended claims and equivalents thereof.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, but, on the contrary, Modification is possible. Accordingly, the spirit of the present invention should be understood only by the appended claims, and all equivalent or equivalent variations thereof are included in the scope of the present invention.

100: Document Imposition System
110: electronic document conversion section
120: electronic document similarity judging unit
121: Tokenizer
122:
123: Matrix conversion unit
124:
130: Transaction register
140: Original proof part
150: off-chain distributed storage
160: Notarization center node

Claims (4)

When an original registration of a first electronic document provided from a web application installed in a user terminal is requested, encrypts the file name, the issuing time, and the issuer information of the first electronic document with a hash value encrypted with the user's public key, ;
An electronic document similarity degree judging unit for analyzing a similarity degree of a noun arrangement between the first electronic document and the previously registered electronic documents to determine a document registration suitability;
A transaction registration unit for registering the hash value of the first electronic document and the public key used for the hash value in the block chain node when the electronic document similarity degree judging unit judges that the first electronic document is suitable for document registration;
When the third electronic document to be verified and the first electronic document to be verified provided from the web application installed in the user terminal are requested, the file name, the issuing time, and the issuer information of the third electronic document are encrypted with the public key of the user The hash value of the first electronic document registered in the block chain node is verified after the hash value of the third electronic document is converted into a hash value, 3 An original proof part that issues an immigration certificate proving the subsequent relationship with the electronic document;
An off-chained distributed storage for storing the hash value obtained by encrypting the file name, the issuing time, and the issuer information of the first electronic document converted by the electronic document conversion unit with the public key of the user; And
A transaction is generated by participating as a peer in a hyperreflective fabric block chain network, interworking with a hyperrecessor explorer, monitoring a network between block chain nodes in the distributed repository, storing an encrypted electronic document file, A notarized center node for receiving and recovering an electronic document from a block chain node in which the electronic document is stored when the document is damaged,
The electronic document similarity degree determining unit
A tokenizing unit for providing a morpheme analysis library and extracting only nouns from a file name and file contents of a first electronic document through a nouns () function of a morphological analysis library and separating the nouns from a character string;
An arrangement unit for sequentially arranging the nouns extracted from the tokenizing unit in columns or rows;
A character string or an array of rows arranged in the array unit is converted into a sparse matrix using a fit_transform () function and a sparse matrix is converted into an array of the array unit using a toarry () ; And
A similarity analyzer for analyzing a frequency of similar words between previously registered electronic documents and first electronic documents using Equation 1, which is a TF-IDF (Term Frequency-Inverse Document Frequency)
The similarity analyzer
The overall similarity between documents is analyzed using the calculated frequency of borrowing after calculating the frequency of similar words between previously registered electronic documents and first electronic documents and if the overall similarity is equal to or greater than a predetermined value A document imposition system that utilizes a distributed chain-chained off-chain repository to provide judged decision signals.
[Formula 1]
tf (t, d) = (number of documents (d) containing the word t) / (number of total documents)
The method according to claim 1,
The electronic document similarity degree determining unit
A block chain-based off-chain distributed store that extracts and arranges nouns of characters in the first electronic document using the nouns () function of the morphological analysis library, and converts the arrays into a matrix using a fit_transform () Used document imposition system.
delete delete

Images