WO2017065322A1

WO2017065322A1 - Method and program for transmitting p2p file through enhanced security

Info

Publication number: WO2017065322A1
Application number: PCT/KR2015/010699
Authority: WO
Inventors: 오윤식; 박해일
Original assignee: (주) 이스트몹
Priority date: 2015-10-12
Filing date: 2015-10-12
Publication date: 2017-04-20

Abstract

The present invention relates to a method for transmitting a P2P file through enhanced security. According to one embodiment of the present invention, the method for transmitting a P2P file through enhanced security comprises: a comparison key issuing-request reception step (S100) of receiving, by a server (100), a comparison key issuing-request from a first client, wherein the first client is a transmitting client (200) or a receiving client (300); a step (S200) of receiving, by the server (100), a transmission request for a specific file from the transmitting client (200); a comparison key generation step (S300) of generating, by the server (100), a comparison key, wherein the comparison key is a combination of basic keys having n characters, which are randomly extracted, and special keys having m characters calculated by applying a specific generation rule for the n characters, and m and n are natural numbers; an input key reception step (S400) of receiving an input key from a second client, wherein the second client is one or more clients excluding the first client; and a step (S500) of determining whether to transmit a file by comparing the comparison key with the input key. According to the present invention, it is possible to limit the generation of a comparison key enabling a file transmission connection with a third client, instead of an intended first client, according to the incorrect input by users.

Description

Security Enhanced P2P File Transfer Method and Program

The present invention relates to a security-enhanced P2P transmission method and program, and more particularly, to a method and a program for transmitting a file when a key corresponding to the same character string is input to a transmitting client and a receiving client.

For data transmission between terminals, a cloud method may be used in which a transmitting terminal uploads a file to a server and a receiving terminal downloads a file from the server. According to this method, upload and download speeds may vary according to the location of the transmitting terminal and the receiving terminal or network conditions, and there are problems in that it is vulnerable to security and costs a lot of server and line construction.

In order to solve this problem, a peer-to-peer (P2P) transmission technology is required. According to the P2P transmission technology, since data is directly transmitted and received between terminals, there is no need to upload or download a file to a server. In addition, when using the P2P transmission technology, since the file is not stored in the server, the risk of file leakage due to hacking of the server may be reduced.

In the case of P2P file transmission, the server may recognize the transmitting client and the receiving client by inputting a comparison key issued by the other client according to the request of the transmitting client or the receiving client. However, if there is an error in the comparison key input, a P2P file transfer relationship may not be formed between the desired clients and a file transfer connection may occur with other clients. As a result, a situation such as unintentional leakage of a transmission file may occur.

Therefore, a security-enhanced P2P file that increases the security of P2P file transfers by preventing comparison keys with high similarity from occurring within a specific time frame and preventing unintended file transfer relationships from being input by users. To provide a transmission method and program.

In a security-enhanced P2P file transmission method according to an embodiment of the present invention, a server receives a comparison key issuance request from a first client, wherein the first client is a transmitting client or a receiving client, and receiving a comparison key issuance request. step; Receiving, by the server, a transfer request of a specific file from a sending client; The server generates a comparison key, wherein the comparison key is a combination of a random key extracted from n characters and a special key of m characters calculated by applying a specific generation rule to the n characters. m and n are natural numbers, comparison key generation step; Receiving an input key from a second client, wherein the second client is one or more clients other than the first client; And determining whether to transmit a file by comparing the comparison key with the input key.

The generation rule may be characterized in that the arrangement order or configuration of the special key is changed when the arrangement order or configuration of the primary key is changed.

In addition, the comparison key generation step, the step of recognizing the time when the comparison key issuance request is received from the first client; And extracting a time key of l letters (l is a natural number than n) corresponding to the time point, wherein the primary key includes l letters and (nl) random letters of the time key. It may be characterized in that it is generated by combining.

In addition, the generation rule may be characterized by applying at least one of the Luhn algorithm, Verhoeff algorithm, Damm algorithm.

The comparing key generating step may include mixing the n characters included in the primary key and the m characters included in the special key according to a specific arrangement rule, wherein the arrangement rule is performed at a specific period. It may be characterized in that it is changed according to.

In addition, the comparison key generation step may be characterized by setting a time limit for validating the comparison key for a specific time.

The determining whether to transmit the file may include: selecting a transmission path between the transmitting client and the receiving client when the comparison key and the input key match; And a file transfer request step of requesting a file transfer through the selected transmission path to the transmitting client and the receiving client.

In addition, the transmission path selection step, characterized in that to calculate the optimal transmission path through a specific relay node in consideration of the position between the transmitting client, the receiving client, and the relay node or the transmission speed through the relay node. have.

The security-enhanced P2P transmission program according to another embodiment of the present invention executes the aforementioned security-enhanced P2P transmission method in combination with hardware and is stored in a medium.

According to the present invention as described above, has the following various effects.

First, as a user incorrectly inputs, it is possible to limit generation of a comparison key that may be connected to a file transfer with a third client other than the intended first client. That is, it is possible to prevent a file transfer relationship with a third client other than the first client intended to form a file transfer relationship by a user wrongly inputting an input key. Through this, it is possible to prevent the file from being leaked because the file transmission / reception relationship is incorrectly connected.

Second, as the comparison key is generated by combining the special key calculated based on the primary key, it is difficult for others to guess the comparison key, thereby increasing the security of the file transfer. In particular, when the time key corresponding to the time point data of the comparison key generation request is reflected in the comparison key generation, the security of the comparison key can be further improved.

1 is a flowchart of a P2P transmission method with enhanced security according to an embodiment of the present invention.

2 is a connection relationship diagram of a P2P transmission system with enhanced security according to an embodiment of the present invention.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. Advantages and features of the present invention and methods for achieving them will be apparent with reference to the embodiments described below in detail with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various forms, and only the embodiments are intended to complete the disclosure of the present invention, and the general knowledge in the art to which the present invention pertains. It is provided to fully inform the person having the scope of the invention, which is defined only by the scope of the claims. Like reference numerals refer to like elements throughout.

Unless otherwise defined, all terms (including technical and scientific terms) used in the present specification may be used in a sense that can be commonly understood by those skilled in the art. In addition, the terms defined in the commonly used dictionaries are not ideally or excessively interpreted unless they are specifically defined clearly.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. In this specification, the singular also includes the plural unless specifically stated otherwise in the phrase. As used herein, "comprises" and / or "comprising" does not exclude the presence or addition of one or more other components in addition to the mentioned components.

In the present specification, the first client corresponds to either the transmitting client or the receiving client. In the present specification, the second client is a client intended for a file transfer relationship with the first client, and when the first client is a transmitting client, the second client is a receiving client, and when the first client is a receiving client, the second client is a transmitting client. to be. In the present specification, the third client refers to a client in which the second client does not intend a file transfer connection, but a connection of the file transfer may be formed by an incorrect input of an input key.

In the present specification, the comparison key refers to a string generated by the server according to a generation request of the first client. In the present specification, the input key refers to a string received from the second client to the server. In the present specification, the letter may include an alphabet, a number, and the like.

Hereinafter, a P2P transmission method and a transmission program with enhanced security according to embodiments of the present invention will be described with reference to the drawings.

In order to perform P2P file transfer, a connection relationship between the transmitting client 200 and the receiving client 300 should be formed. To this end, it is possible to request the generation of a specific key (ie, comparison key) from the transmitting client 200 or the receiving client 300, and to receive a corresponding key (ie, input key) from another client, If the input keys are the same, a connection relationship of P2P file transfer can be formed. However, if a user of the transmitting client 200 or the receiving client 300 corresponding to the second client described later incorrectly inputs an input key, a connection relationship between an unintended client (ie, a third client) and a file transfer may be formed. Can be. For example, when a user inputs a first comparison key received from a user of a first client through a message or a telephone as an input key, a user inputs a specific character in the comparison key as another character, By inputting the second comparison key generated at the request of the third client, a connection relationship between the second client and the third client may be formed. Accordingly, the second client may receive a file transmitted from the third client rather than a file transmitted from the first client, which may cause a problem that the transmission file of the third client leaks.

As the type of user input key mis-input, the type of inputting one digit incorrectly (Single digit error (for example, 1 to 2)) and the type of input by changing two adjacent digits (Transpositions error, for example, 12) 21), the same two-digit incorrect entry (Twins error, e.g. 11 into 22), the wrong type of digits with similar pronunciation (Phonetic error, 60 into 16), and two non-adjacent digits This may include the type of input (Jump transposition error (eg, input 132 as 231), the type of input by changing two non-adjacent digits (Jump twin error (eg, input 131 as 232)). .

In order to prevent the wrong connection type from being formed by these mistyped types, the server 100 generates similar comparison keys (for example, high similarity such as only one digit or two digits are different). It is necessary to restrict things. Hereinafter, a security-enhanced P2P file transmission method that can prevent a comparison key with high similarity from occurring within the same time will be described.

1, in the security-enhanced P2P file transmission method according to an embodiment of the present invention, the server 100 receives a comparison key issuance request from the first client, the first client is a transmitting client ( 200) or receiving client 300, comparing key issuing request receiving step (S100); Receiving, by the server 100, a transmission request of a specific file from the transmitting client 200 (S200); The server 100 generates a comparison key, wherein the comparison key combines a random key extracted with n characters and a special key having m characters calculated by applying a specific generation rule to the n characters. M and n are natural numbers, comparison key generation step (S300); Receiving an input key from a second client, wherein the second client is one or more clients other than the first client (S400); And determining whether to transmit a file by comparing the comparison key with the input key (S500). The security enhanced P2P file transmission method according to an embodiment of the present invention will be described in order.

The server 100 receives a comparison key issuance request from the first client (S100). The first client may be a transmitting client 200 or a receiving client 300. When the comparison key is identically received from the transmitting client 200 and the receiving client 300, the comparison key may correspond to a character string recognized as a legitimate client requesting file transmission and reception.

In one embodiment, as shown in Figure 2, the first client may be a transmitting client 200, the server 100 issuing a comparison key issuing request with the file transfer request (S200) described later of the transmitting client 200 Can be received. For example, the server 100 may determine a file transfer request received from the transmitting client 200 as a comparison key issuance request.

In another embodiment, the first client may be the receiving client 300. At this time, after the receiving client 300 transmits the comparison key issuance request to the server 100, the transmitting client 200 may request a file transfer. That is, the transmitting client 200 may request a file transfer while transmitting an input key, which will be described later, to the server 100.

As shown in FIG. 2, the server 100 receives a transmission request of a specific file from the transmitting client 200 (S200). For example, the transmitting client 200 may request a file transmission from the user to the receiving client 300 by selecting a specific file from the user. Receiving a file transfer request from the transmitting client 200 may be performed in various orders.

The server 100 generates a comparison key (S300). The server 100 may apply a specific rule for generating a comparison key to prevent generation of a string having a high possibility of a wrong input by users. In one embodiment of generating a comparison key, the server 100 may apply a method of generating a combination of a primary key and a special key generated based on the primary key. The primary key may correspond to a string of n characters (n is a natural number) randomly extracted. The special key may correspond to a string of m characters (m is a natural number) calculated by applying a specific generation rule to the n characters. That is, the server 100 extracts a randomly extracted n-character string (for example, n-digit string), and generates a special key specific to n strings (for example, n-digit string). You can apply the rule to create a string of m characters (for example, a string of m digits).

As the generation rule, a Luhn algorithm, a Verhoeff algorithm, a Damm algorithm, or the like may be applied. Only one algorithm may be applied as the generation rule, or a plurality of algorithms may be applied together. In addition, the server 100 may periodically change an algorithm or a combination of algorithms applied as a generation rule to increase security.

The generation rule may be characterized in that the arrangement order or configuration of the special key is changed when the arrangement order or configuration of the primary key is changed. That is, the server 100 may make the special keys generated when the primary keys different, so that the difference between the generated comparison keys is large.

For example, the server 100 may generate a primary key of any five digits. Thereafter, the server 100 may generate one digit by applying a specific special key generation rule based on the configuration or order of five digits. Thereafter, the server 100 may generate a six-digit comparison key by combining the primary key and the special key. The comparison key generated in this way changes the special key when a specific one digit in the primary key changes. Therefore, it is possible to prevent the comparison key having high similarity, such as when only one digit is different.

In addition, when the character constituting the primary key is not a number, the server 100 may calculate a special key by applying a number (for example, an ASCII code) corresponding to the character. That is, the server 100 may calculate a special key by applying a specific generation rule (that is, performing operations between ASCII code numbers) by applying an ASCII code corresponding to each character included in the primary key.

In addition, the comparison key generation step (S300), may include the step of mixing the n characters contained in the primary key and the m characters included in the special key according to a specific arrangement rule. For example, when n is larger than m, the server 100 may add m characters between n characters according to a specific mixing rule. Therefore, the server 100 applies not only a generation rule for generating a special key but also a placement rule for mixing a plurality of characters constituting the primary key and a plurality of characters constituting the special key together, so that others generate a comparison key. The security can be improved by making it difficult to understand. In addition, the arrangement rule may be changed according to a specific period to increase the security of the rule for generating a comparison key.

In addition, the comparison key generation step (S300), it is possible to reflect the value corresponding to the time when the comparison key generation is requested in the comparison key generation. That is, recognizing a time point at which the comparison key issuance request is received from the first client; And extracting a time key of l characters corresponding to the time point (l is a natural number than n).

First, the server 100 may recognize when a comparison key issuance request is received from the first client. The server 100 may receive and recognize the comparison key issuance request time point data from the first client, and may recognize and recognize the time at which the comparison key issuance request is received from the first client. Thereafter, the server 100 may extract a time key of l characters (l is a natural number smaller than n) corresponding to the recognized time point. Algorithms for generating time keys can be applied in various ways. For example, you could divide your day (24 hours) into 10 zones (24 * 60/10) and increment it by 1 per 144 minutes. The server 100 may generate a primary key including a time key corresponding to the viewpoint data according to the comparison key issuance request. That is, the primary key can be generated by combining l characters of the time key and (n-l) arbitrary characters.

For example, the server 100 may generate a one-digit time key corresponding to the time point at which the comparison key generation request is received from the first client. Thereafter, the server 100 may extract five digit random numbers, and generate a primary key by combining the time keys with the random numbers. Thereafter, the server 100 may calculate a one-digit special key by applying a special key generation rule based on the primary key including the time key. Thereafter, the server 100 may generate a comparison key by combining the special key with the primary key.

In addition, the server 100 may not include the time key in the primary key, but may be reflected only in generating the special key together with the primary key which is a randomly generated string. That is, the server 100 may generate a time key corresponding to the time point at which the comparison key generation request is received from the first client. Thereafter, the server 100 may generate a primary key by extracting a five-digit random string. Thereafter, the server 100 may calculate the one-digit special key by applying a special key generation rule based on the time key (for example, one digit) and the primary key (for example, five digits). . Thereafter, the server 100 may generate a comparison key by combining a special key (for example, 1 digit) with a primary key (for example, 5 digits). Through this, users can not identify the time key used in the special key generation rule, and thus can increase the security by not being able to check the rule for generating the time key and the rule for generating the special key.

For example, when the Damm algorithm is applied as a random key generation rule, the server 100 may extract 12345 by applying a random function. Thereafter, the server 100 may calculate a time key by applying a time function (for example, at 9 am, divide 9 * 60 by 144 and then apply a Gaussian function to calculate 3). Thereafter, the server 100 may apply a Damm algorithm to a string that combines a time key before the primary key to calculate a special key (that is, calculate Damm 312345) to calculate 2 as a special key. Thereafter, the server 100 may generate a comparison key by combining 2, which is a special key generated after 12345 which is a primary key, behind.

As the comparison key generation reflects the time key corresponding to the time when the comparison key generation is requested, a comparison key such as 223452 which differs from 123452 by one digit or 213452 which is reversed by two digits cannot be issued at the same time, so that the user It is possible to prevent an incorrect file transfer connection from being formed due to a comparison key input error. In addition, the special key generation rule can be prevented from leaking to the outside, thereby increasing the security of file transfer.

In addition, the comparison key generation step (S300), it may be characterized in that for setting the time limit to be valid for the comparison key. The longer the time elapses after the comparison key is generated, the higher the likelihood that the comparison key is leaked to the other person and the other person first enters the comparison key to form a file transfer connection. Accordingly, the server 100 may set a valid time limit for the comparison key, and when the time limit elapses, the server 100 may delete the connection relationship between the comparison key and the file transfer request. In addition, the comparison key is valid only within a specific time limit, so that the server 100 can transmit a large number of P2P files using a specific number of character strings.

An input key is received from the second client (S400). The second client is one or more clients other than the first client. That is, the user of the second client may receive a comparison key through a message, voice, etc. from the user of the first client who wants to establish a file transfer relationship, and input the comparison key to the second client.

The server 100 compares the comparison key with the input key and determines whether to transmit a file (S500). If the comparison key generated by the first client's request and the input key received from the second client match, the server 100 forms a file transfer relationship through a specific relay node 400 and requests both clients to transmit and receive files. Can be. That is, the file transmission determination step (S500), if the comparison key and the input key, the transmission path selection step of selecting a specific transmission path between the transmitting client 200 and the receiving client 300; And a file transfer request step of requesting a file transfer through the selected transmission path to the transmitting client 200 and the receiving client 300. First, the server 100 may compare the comparison key and the input key. As a result, if the comparison key and the input key match, it is possible to select a specific transmission path between the transmitting client 200 and the receiving client 300. That is, the server 100 is the most appropriate transmission path (for example, the transmission path providing the fastest speed, the transmission path without incurring costs, the path set by the user, etc.) among the various relay nodes 400. Can be selected. Thereafter, the server 100 may request the transmitting client 200 and the receiving client 300 to transmit a file through the selected transmission path. For example, the server 100 transmits a request including identification information of the selected relay node 400 to the transmitting client 200 to transmit a file to the receiving client 300 through the selected relay node 400. can do.

In addition, the transmission path selection step, considering the position between the transmitting client 200, the receiving client 300, and the relay node 400 or the transmission speed through the relay node 400, a specific relay node ( It may be characterized by calculating the optimal transmission path through 400).

In one embodiment, in consideration of the position between the transmitting client 200, the receiving client 300, and the relay node 400 or the transmission speed through the relay node 400, optimal transmission through a specific relay node 400 The route can be calculated. That is, the server 100 selects a plurality of candidate relay nodes 400 in consideration of positions between the transmitting client 200, the receiving client 300, and the relay node 400, and among the plurality of candidate relay nodes 400. The relay node 400 having the highest transmission rate may be selected.

Alternatively, the server 100 sets the distance between the transmitting client 200, the relay node 400, and the receiving client 300 as one variable D, and sets the transmission speed of the relay node 400 to another variable ( V), the relay node 400 may be selected by applying weights to the two variables. To this end, the server 100 may store at least one or more of identification information, location information, or transmission speed information for each relay node 400 in advance.

Transmission rate information for each relay node 400 may be statistical data extracted using information previously collected from the relay node 400. Here, the information collected in advance from the relay node 400 is load information of each relay node 400 for a predetermined time, whether there is another server 100 connected to each relay node 400 for a predetermined time, and each It may include at least one of the types of Internet Service Providers (ISPs) that support the relay node 400. The lower the load of the relay node 400, the smaller the number of other servers 100 connected to the relay node server 100, and the faster the speed of the ISP supporting the relay node 400, the faster the relay node 400 is. It can be estimated to have a high transmission rate.

In another embodiment, since the relay node 400 may be a wireless access point to which both clients can connect in the same area, the relay node 400 may be connected to the same wireless access point in a space where the transmitting client 200 and the receiving client 300 may access the same wireless access point. In the case where the server 100 is located, the server 100 may use a wireless access point connected to the transmitting client 200 and the receiving client 300 in the same manner as the relay node 400.

The above-described program includes C, C ++, JAVA, machine language, etc. which can be read by the computer's processor (CPU) through the computer's device interface so that the computer reads the program and executes the methods implemented as the program. Code may be coded in the computer language of. Such code may include functional code associated with a function or the like that defines the necessary functions for executing the methods, and includes control procedures related to execution procedures necessary for the computer's processor to execute the functions according to a predetermined procedure. can do. In addition, the code may further include memory reference code for additional information or media required for the computer's processor to execute the functions at which location (address address) of the computer's internal or external memory should be referenced. have. Also, if the processor of the computer needs to communicate with any other computer or server remotely in order to execute the functions, the code may be used to communicate with any other computer or server remotely using the communication module of the computer. It may further include a communication related code for whether to communicate, what information or media should be transmitted and received during communication.

The stored medium is not a medium for storing data for a short time such as a register, a cache, a memory, but semi-permanently, and means a medium that can be read by the device. Specifically, examples of the storage medium include, but are not limited to, a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like. That is, the program may be stored in various recording media on various servers to which the computer can access or various recording media on the computer of the user. The media may also be distributed over network coupled computer systems so that the computer readable code is stored in a distributed fashion.

Although embodiments of the present invention have been described above with reference to the accompanying drawings, those skilled in the art to which the present invention pertains may implement the present invention in other specific forms without changing the technical spirit or essential features thereof. I can understand that. Therefore, it should be understood that the embodiments described above are exemplary in all respects and not restrictive.

Claims

A server receiving a comparison key issuing request from a first client, wherein the first client is a transmitting client or a receiving client;

Receiving, by the server, a transfer request of a specific file from a sending client;

The server generates a comparison key, wherein the comparison key is a combination of a random key extracted from n characters and a special key of m characters calculated by applying a specific generation rule to the n characters. m and n are natural numbers, comparison key generation step;

Receiving an input key from a second client, wherein the second client is one or more clients other than the first client;

And comparing the comparison key with the input key to determine whether to transmit a file. 2.
The method of claim 1,

The generation rule is,

When the arrangement order or configuration of the primary key is different, the arrangement order or configuration of the special key is different, security enhanced P2P file transmission method.
The method of claim 1,

The comparison key generation step,

Recognizing a time point at which a comparison key issuance request is received from the first client; And

And extracting time keys of l letters corresponding to the time point (l is a natural number smaller than n).

And said primary key is generated by combining l characters of said time key and (n-l) arbitrary characters.
The method of claim 1,

The generation rule is,

A security enhanced P2P file transmission method, characterized by applying at least one of Luhn algorithm, Verhoeff algorithm, and Damm algorithm.
The method of claim 1,

The comparison key generation step,

And mixing the n characters included in the primary key and the m characters included in the special key according to a specific arrangement rule.

The arrangement rule is changed according to a specific period, security enhanced P2P file transmission method.
The method of claim 1,

The comparison key generation step,

And setting a time limit so that the comparison key is valid for a specific time.
The method of claim 1,

The file transmission determination step,

A transmission path selecting step of selecting a specific transmission path between the transmitting client and the receiving client when the comparison key and the input key match; And

And a file transfer request step for requesting a file transfer through the selected transmission path to the transmitting client and the receiving client.
The method of claim 7, wherein

The transmission path selection step,

And calculating the optimum transmission path through a specific relay node in consideration of the position between the transmitting client, the receiving client, and the relay node or the transmission speed through the relay node.
A security-enhanced P2P transmission program, coupled to a computer that is hardware and stored on a medium for executing the method of any one of claims 1 to 8.