JP2008070961A - Message transfer system and message transfer program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a message transfer system, which can prevent increase of a storage area used for registration of transmission source information, and can prevent deterioration of efficiency in retrieving the transmission source information when determining propriety of message transfer, and furthermore, can prevent restriction of a registration count of the transmission source information. <P>SOLUTION: A bit pattern and user information are associated with each other and held. A bit pattern is computed from the transmission source information on a transmission source to which a user permits message transfer, logic operation OR is performed for the held bit pattern and the computed bit pattern, the bit pattern of the resultant thus obtained is registered. A bit pattern is computed from the transmission source information included in a message when the message is received, the held bit pattern is compared with the computed bit pattern, and it is controlled so as to transfer the message to the user on the basis of the comparison result. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a message transfer system and a message transfer program.

  Conventionally, in the Internet, “spam mail” that distributes mass-produced e-mails indiscriminately has become a major problem, and various technologies have been developed as countermeasures against “spam mail”. For example, in one of the methods for registering the sender information about the sender, first, the mail transfer server that forwards the email from the sender to the user, the email address of the sender that is allowed to transfer the email, Register in advance as a “white list”. Then, when the e-mail forwarding server receives the e-mail addressed to the user, the e-mail address that matches the sender's e-mail address is searched for in the “white list” and can be searched Only forward emails to users.

  Further, for example, Patent Document 1 proposes a method in which when a user replies to a received electronic mail, the mail transfer server registers the mail address of the reply destination (source) as a “white list”. Yes.

JP 2003-178008 A

  By the way, in the conventional technique described above, as will be described below, in the message transfer system, the storage area used for registration of the sender information is increased, and the sender is used to determine whether or not the message transfer is permitted. There is a problem that the efficiency of searching for information is lowered, and consequently the number of registered source information must be limited.

  That is, in the conventional method of registering the sender mail address as the sender information, the storage area used for registering the sender information increases in proportion to the number of registered mail addresses. In addition, if the storage area used for registration of sender information increases, the storage area for searching sender information when determining whether mail transfer is permitted or not increases, so the efficiency of searching for sender information decreases. To do. As a result, in order to avoid an increase in storage area and a decrease in search efficiency due to an increase in storage area, the number of registered source information must be limited.

  In addition, such a problem is not limited to the mail transfer system that controls the mail transfer addressed to the user by registering the sender mail address, but the message addressed to the user by registering the telephone number of the sender. A problem similarly occurs in a message transfer system that transfers a message on a network, such as an IP (Internet Protocol) telephone system that controls the transfer.

  Accordingly, the present invention has been made to solve the above-described problems of the prior art, and in the message transfer system, the storage area used for registration of the sender information is not increased, and whether or not the message transfer is permitted. It is an object of the present invention to provide a message transfer system and a message transfer program that do not reduce the efficiency of searching for source information when determining the source information, and in turn, do not limit the number of registered source information.

  In order to solve the above-described problems and achieve the object, the invention according to claim 1 controls the transfer of a message to the user based on the source information that is information about the source of the message included in the message. A message transfer system comprising bit pattern holding means for holding a bit pattern having a predetermined number of bits consisting of values of 0 and 1 and user information for identifying the user in association with each other; The bit pattern of the number of bits is calculated from the source information of the source that permits the transfer using a predetermined function, and the bit pattern held by the bit pattern holding unit and the calculated bit pattern in bit units Depending on the bit pattern of the result obtained by OR operation, it is held by the bit pattern holding means. A bit pattern registration unit that replaces and registers a bit pattern, and a bit pattern that calculates the bit pattern of the number of bits from the source information included in the message using the function when a message to the user is received The calculation means, the bit pattern held by the bit pattern holding means, and the bit pattern calculated by the bit pattern calculation means are compared in bit units, and the calculated bit pattern has the same rank as the bit of 1 value. Message transfer control means for controlling to transfer the message to the user when all of the bits of the stored bit pattern are 1 values.

  The invention according to claim 2 is characterized in that, in the above-mentioned invention, the bit pattern registration means calculates a bit pattern from the source information using a hash function as the predetermined function.

  In the invention according to claim 3, in the above invention, the bit pattern registration unit uses the plurality of hash functions for deriving a positive integer value equal to or less than the number of bits as the predetermined function. A plurality of positive integer values are derived for each hash function, and a bit pattern of the number of bits is generated for each hash function, with the bit of the rank corresponding to the positive integer value being a value of 1, and the generation A bit pattern is calculated from the source information by performing an OR operation on the plurality of bit patterns in units of bits.

  According to a fourth aspect of the present invention, in the above-mentioned invention, a rejection source information holding means for holding the source information of the source from which the user refuses to transfer a message and the user information in association with each other. The message transfer control means may further comprise the case where all the bits having the same rank as the 1-valued bits in the calculated bit pattern have a value of 1 in the held bit pattern as a result of the comparison. When the sender information included in the message corresponds to the sender information held by the reject sender information holding means, the message is controlled not to be transferred to the user.

  According to a fifth aspect of the present invention, in the above invention, the bit pattern holding unit holds the correspondence between the bit pattern and the user information in units of cycles from the current cycle to a predetermined cycle in the past. As the cycle progresses, the bit pattern of the current cycle is replaced with a bit pattern consisting of all zero values, the bit pattern of the past predetermined cycle is discarded, and the past A bit pattern of a period other than a predetermined period is replaced with a bit pattern of the previous period and held, and the bit pattern registration unit includes the bit pattern of the current period held by the bit pattern holding unit and the source The current bit pattern is obtained by performing an OR operation on the bit pattern calculated from the information in bit units. The message transfer control means compares the bit pattern of all periods held by the bit pattern holding means with the bit pattern calculated by the bit pattern calculation means, When the bit having the same rank as the bit having the value of 1 in the calculated bit pattern is all the values of 1 in the bit pattern of all the cycles, the message is transferred to the user. The bit pattern registering unit transfers the message to the user when all the bit patterns in the period other than the current period become 1 as a result of the comparison by the message transfer control unit. Calculated from the sender information included in the message A bit pattern of the current period, which is obtained by performing an OR operation on the bit pattern and the bit pattern of the current period held by the bit pattern holding means in bit units, and further registering It is characterized by.

  Further, in the invention according to claim 6, in the above invention, as a result of the comparison by the message transfer control means, any bit having the same order as the bit having the value of 1 in the bit pattern calculated from the source information However, if the value does not become 1 in the held bit pattern, an agreement confirmation message for confirming consent to register the sender information in the held bit pattern is sent An agreement confirmation transmitting means for transmitting to the user together with original information, and an agreement notification notified from the user as a response to the consent to the consent confirmation message transmitted by the consent confirmation transmitting means together with the origination information. A consent notification receiving means, wherein the bit pattern registration means is further provided by the consent notification receiving means. The bit pattern is calculated from the source information received together with the consent notification using a predetermined function, and the bit pattern held by the bit pattern holding means and the calculated bit pattern are ORed in bit units. The bit pattern held by the bit pattern holding means is replaced and registered with the bit pattern obtained as a result.

  In the invention according to claim 7, in the above invention, the destination of the consent confirmation message for confirming the consent to register the sender information in the bit pattern holding means corresponds to the user information. As a result of comparison between the agreement confirmation transmission destination holding means to be held and the message transfer control means, any bit in the same order as the bit having a value of 1 in the bit pattern calculated from the source information is Consent to transmit the consent confirmation message to the transmission destination held by the consent confirmation transmission destination holding means together with the sender information and the user information when the bit pattern does not become 1 As the response of consent to the consent confirmation message transmitted by the confirmation transmission means and the consent confirmation transmission means, A consent notification receiving means for receiving the consent notification notified from the user together with the sender information and the user information, and the bit pattern registration means is received by the consent notification receiving means together with the consent notification. A bit resulting from calculating the bit pattern from source information using a predetermined function and performing an OR operation on the bit pattern held by the bit pattern holding means and the calculated bit pattern in units of bits. According to the pattern, the bit pattern held in association with the user information and held by the bit pattern holding means is replaced and registered.

  According to an eighth aspect of the present invention, there is provided a message transfer system for controlling transfer of a message addressed to a message address including user information for identifying a user and a keyword. Valid word holding means for associating and holding a valid word; bit pattern holding means for associating and holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and the user information; and the message When receiving a message addressed to an address, out of the valid words held by the valid word holding unit, each of one or more valid words corresponding to user information included in the message address is assigned to the message address. One of the valid words partially matches the keyword compared to the keyword contained in In this case, the bit pattern of the number of bits is calculated from the keyword by a predetermined function, and the bit pattern held by the bit pattern holding means and the calculated bit pattern are ORed in bit units. A bit pattern registration unit that replaces and registers the bit pattern held by the bit pattern holding unit with a bit pattern of the result, and a keyword included in the message address when a message addressed to the message address is received A bit pattern calculating means for calculating the bit pattern of the number of bits from the function and a message out of the valid words held by the valid word holding means when a message addressed to the message address is received. Each of one or more valid words corresponding to user information included in the dress is compared with a keyword included in the message address, and any of the valid words partially matches the keyword, or the bit The bit pattern held by the pattern holding unit and the bit pattern calculated by the bit pattern calculating unit are compared in bit units, and the bit having the same rank as the bit having the value of 1 is held in the calculated bit pattern. And a message transfer control means for controlling to transfer the message when all the bit patterns have a value of 1.

  The invention according to claim 9 is a message transfer program for causing a computer to execute a method for controlling the transfer of a message to a user based on the sender information that is information about the sender of the message included in the message. A bit pattern holding procedure for holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and user information for identifying the user in association with each other, and transmission for allowing the user to transfer a message By calculating a bit pattern of the number of bits from the original transmission source information using a predetermined function, and ORing the bit pattern held by the bit pattern holding procedure and the calculated bit pattern in units of bits Depending on the resulting bit pattern, it was retained by the bit pattern retention procedure. A bit pattern registration procedure for registering a bit pattern, and a bit pattern calculation procedure for calculating the bit pattern of the number of bits from the source information included in the message when the message for the user is received using the function And the bit pattern held by the bit pattern holding procedure and the bit pattern calculated by the bit pattern calculating procedure in bit units, and the bit having the same rank as the bit of 1 value in the calculated bit pattern Is a value of 1 in the held bit pattern, the message transfer control procedure for controlling the message to be transferred to the user is executed by a computer.

  The invention according to claim 10 is a message transfer program for causing a computer to execute a method for controlling transfer of a message addressed to a message address including user information for identifying a user and a keyword. A valid word holding procedure for associating and holding user information and one or more valid words, and a bit pattern having a predetermined number of bits consisting of values of 0 and 1 and the user information in association with each other One or more valid words corresponding to the user information included in the message address among the valid words held by the valid word holding procedure when a message having the message addressed to the message procedure is received. Any of the valid words by comparing each of the with the keyword contained in the message address If it partially matches the keyword, the bit pattern of the number of bits is calculated from the keyword by a predetermined function, and the bit pattern held by the bit pattern holding procedure and the calculated bit pattern are converted into bits. When a bit pattern registration procedure for registering by replacing the bit pattern held by the bit pattern holding procedure with a bit pattern obtained by performing an OR operation on a unit and a message addressed to the message address is received The bit pattern calculation procedure for calculating the bit pattern of the number of bits from the keyword included in the message address by the function, and the valid word holding procedure when the message addressed to the message address is received. Of the valid words, one or more valid words corresponding to the user information included in the message address are compared with the keyword included in the message address, and any of the valid words partially matches the keyword. Or the bit pattern held by the bit pattern holding procedure and the bit pattern calculated by the bit pattern calculation procedure are compared in bit units, and the calculated bit pattern is the same as the bit having a value of 1 When all the bits of the order are 1 values in the held bit pattern, a message transfer control procedure for controlling to transfer the message is executed by a computer.

  According to the first or ninth aspect of the present invention, there is provided a message transfer system for controlling transfer of a message to a user based on sender information included in a message, wherein a predetermined number of bits consisting of values of 0 and 1 is used. A bit pattern and user information are stored in association with each other, and a bit pattern having a predetermined number of bits is calculated using a predetermined function from the transmission source information of the transmission source that the user allows to transfer a message. The bit pattern obtained by ORing the bit pattern and the calculated bit pattern in bit units is registered by replacing the stored bit pattern and included in the message when a message is received for the user The bit pattern of a predetermined number of bits is calculated from the transmission source information using a predetermined function, and the stored bit pattern And the calculated bit pattern are compared in bit units, and if the calculated bit pattern has all the values of 1 in the bit pattern in which the bits having the same rank as the value of 1 are stored, the message is used. In the message transfer system, the storage area used for registration of the sender information is not increased, and the efficiency of searching for the sender information when judging whether or not the message transfer is permitted is improved. It is possible to prevent the number of registered sender information from being restricted without lowering.

  That is, according to the message transfer system of the present invention, the sender information is registered by being replaced with a bit pattern having a predetermined number of bits (the sender information is registered in a single bit pattern). Therefore, the storage area used for registering the source information is not increased in proportion to the number of registered source information. Further, since the storage area used for registration of the sender information is not increased, the storage area for searching the sender information is not increased when determining whether or not the message transfer is permitted. Does not decrease. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered sender information is not limited.

  According to the invention of claim 2, since the message transfer system calculates a bit pattern from the source information using a hash function as a predetermined function, the bit pattern is calculated from the source information using a function based on a simple algorithm. Compared to the method for calculating the bit pattern, it is also possible to safely hold the bit pattern in the message transfer system.

  That is, the hash function has a characteristic for calculating a fixed-length bit pattern, a characteristic as a one-way function (it is virtually impossible to infer the data used for the calculation from the calculated bit pattern), and the same bit pattern For example, the bit pattern in which the source information is registered leaks because it has a characteristic that it is difficult to create data for calculating the same (it is difficult to calculate the same bit pattern from different source information). Even if a situation occurs, it is possible to safely hold the bit pattern because there is no possibility that the source information is inferred from the bit pattern.

  According to the invention of claim 3, the message transfer system uses a plurality of hash functions for deriving a positive integer value equal to or less than a predetermined number of bits as a predetermined function to obtain a plurality of positive integer values from the source information. Deriving each hash function, generating a bit pattern of a predetermined number of bits for each hash function, with a bit of a rank corresponding to a positive integer value being 1, and generating the generated bit patterns in bit units Since the bit pattern is calculated from the source information by OR operation, in the message transfer system, compared with the method of calculating the bit pattern from the source information using a single hash function, Reduce the probability of e-mails from senders who do not allow e-mails to be transferred to users by mistake. It becomes ability.

  That is, by applying a Bloom filter theory using a hash function, the bit pattern is calculated by combining the optimal number of bits and the optimal number of hash functions. Since the values of are distributed, it is possible to reduce the probability of erroneous determination.

  According to the invention of claim 4, the message transfer system further holds the source information and the user information of the source from which the user refuses to transfer the message, and calculated as a result of the comparison. Even in the case where all the values of the bit pattern in which the bits having the same order as the bits having the value of 1 are held in the bit pattern have the value of 1, the sender information included in the message corresponds to the rejected sender information. In this case, since the message is controlled so as not to be transferred to the user, in the method of registering the source information by replacing it with the bit pattern (method of registering the source information superimposed on one bit pattern) Cannot delete the sender information (change the sender information once registered to not allow message forwarding) However, by using the sender information (black list) of the sender who refuses to forward the message, it is not allowed to forward the message even for the sender information registered once. It is also possible to make it.

  In addition, in the method of registering by replacing the sender information with a bit pattern, an erroneous determination (e-mail from a sender that the user originally does not permit e-mail transfer is erroneously transferred to the user). However, if the user keeps the sender information (black list) of the sender who refuses to transfer the message and uses it together, at least the user can actively It is also possible to avoid that an e-mail from a sender who does not permit transfer is erroneously transferred to the user.

  According to the invention of claim 5, the message transfer system holds the correspondence between the bit pattern and the user information in units of cycles from the current cycle to a predetermined cycle in the past. Accordingly, the bit pattern of the current cycle is replaced with a bit pattern consisting of all zero values, the bit pattern of the past predetermined cycle is discarded, and the bit pattern of a cycle other than the past predetermined cycle is changed to one. By replacing the bit pattern of the previous cycle and holding it, the bit pattern of the result obtained by ORing the bit pattern of the held current cycle and the bit pattern calculated from the source information in bit units, Replace and register the bit pattern of the current cycle, compare the bit pattern of all the held cycles with the calculated bit pattern, When the bit having the same order as the bit having the value of 1 in the output bit pattern is all the values of 1 in the bit pattern of any period, the message is transferred to the user. The bit pattern calculated from the source information included in the message that is controlled to transfer the message to the user by having all values of 1 in the bit pattern of the period other than the current period as a result of control Since the bit pattern of the current cycle is registered by replacing the bit pattern of the current cycle with the bit pattern of the result obtained by performing OR operation on the bit pattern of the held current cycle, the source information is replaced with the bit pattern. Registered by being registered (Sender information is registered with a single bit pattern. ), The sender information cannot be deleted (the sender information once registered cannot be deleted even for the old registered sender information), but the bit pattern is changed from the current cycle to a predetermined number in the past. It is possible to delete the old registered source information even if it is registered once by discarding the bit pattern of the past predetermined cycle as the cycle elapses. Is also possible.

  In addition, in the method of registering by replacing the sender information with a bit pattern, an erroneous determination (e-mail from a sender that the user originally does not permit e-mail transfer is erroneously transferred to the user). The probability of occurrence of (determination) is likely to increase as more source information is registered (the value of “1” registered in the bit pattern increases), but the bit pattern is retained on a period basis. By suppressing the value of “1” registered in the bit pattern, it is possible to reduce the probability of occurrence of erroneous determination.

  According to the invention of claim 6, in the message transfer system, as a result of the comparison, in the bit pattern calculated from the transmission source information, any bit having the same rank as the bit having the value of 1 is held. If the value does not become 1 in the pattern, an agreement confirmation message for confirming consent to register the sender information in the retained bit pattern is sent to the user together with the sender information, and sent. The consent notification notified from the user as a response to the consent to the received consent confirmation message is received together with the source information, and the bit pattern is calculated from the source information received together with the consent notification using a predetermined function and stored. Depending on the bit pattern of the result obtained by ORing the calculated bit pattern and the calculated bit pattern in bit units Since register replaces the retained bit pattern, for example, in a mail transfer system, it becomes possible to register the sender information based on the agreement confirmation with respect to register the source information is not registered.

  In addition, since the sender information is reproduced by including the sender information in the consent confirmation message and receiving the consent notification together with the sender information, it is necessary to manage the connection status during the consent confirmation in the mail transfer system. As a result, there is no need for an area for storing the status during confirmation of consent, and the storage area can be prevented from increasing.

  Further, according to the invention of claim 7, the transmission destination of the consent confirmation message for confirming the consent for registering the sender information and the user information are held in correspondence with each other, and as a result of the comparison, If any bit in the same order as a bit having a value of 1 in the bit pattern calculated from the original information does not have a value of 1 in the held bit pattern, the consent confirmation message is transmitted to the sender information and use Sent to the destination held with the user information, and received from the user as a response to the consent to the sent consent confirmation message is received with the sender information and the user information, the outgoing call received with the consent notification A bit pattern is calculated from the original information using a predetermined function, and the stored bit pattern and the calculated bit pattern are ORed for each bit. In the IP telephone system, for example, registration of unregistered sender information is performed because the bit pattern associated with the user information is replaced and registered by the resulting bit pattern. On the other hand, the sender information can be registered based on the consent confirmation.

  Also, by including the sender information and user information in the consent confirmation message, and receiving the consent notification together with the sender information and user information, the sender information and user information are reproduced. As a result, it becomes unnecessary to manage the connection status during confirmation of consent, so that an area for storing the status during confirmation of consent becomes unnecessary, and the storage area can be prevented from increasing.

  According to the invention of claim 8 or 10, there is provided a message transfer system for controlling transfer of a message whose destination is a message address including user information for identifying a user and a keyword. One or more valid words are stored in association with each other, and a bit pattern of a certain number of bits consisting of values of 0 and 1 and user information are stored in association with each other when a message addressed to the message address is received. Of the stored valid words, each of one or more valid words corresponding to the user information contained in the message address is compared with the keyword contained in the message address, and any of the valid words is partially included in the keyword. If they match, a bit pattern with a predetermined number of bits is calculated from the keyword using a predetermined function and stored. When a message whose destination is the message address is received by replacing the stored bit pattern with the bit pattern obtained by ORing the bit pattern and the calculated bit pattern in bit units, the message User information included in the message address among valid words held when a bit pattern of a predetermined number of bits is calculated from a keyword included in the address using a predetermined function and a message addressed to the message address is received. Each of one or more valid words corresponding to is compared with the keyword included in the message address, and if any of the valid words partially matches the keyword, or the stored bit pattern and the calculated bit pattern And calculated in bit units If all the bits in the bit pattern having the same order of bits as the value of 1 in the bit pattern are 1 in the bit pattern, control is performed so that the message is transferred. In a message system that can easily identify the leakage source and easily invalidate only the leaked message address when the message address is leaked (disclosed word) Does not increase the storage area used for registration, and does not reduce the efficiency of searching for a keyword (disclosure word) when determining whether message transfer is permitted or not, and thus limits the number of keywords (disclosure word) registered. It is possible not to let it.

  That is, according to the message transfer system of the present invention, a keyword (disclosure word) is registered by being replaced with a bit pattern having a predetermined number of bits (a keyword (disclosure word) is registered in a single bit pattern. Therefore, the storage area used for registering a keyword (disclosure word) is not increased in proportion to the number of registered keywords (disclosure word). Further, since the storage area used for registering the keyword (disclosure word) is not increased, the storage area for searching for the keyword (disclosure word) is not increased when determining whether or not the message transfer is permitted. Does not reduce the efficiency of searching for words. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered keywords (disclosure words) is not limited.

  Embodiments of a message transfer system and a message transfer program according to the present invention will be described below with reference to the accompanying drawings. In the following, the main terms used in the embodiment, the outline and characteristics of the message transfer system according to the first embodiment, the configuration of the message transfer system according to the first embodiment, the procedure of processing by the message transfer system according to the first embodiment, The effects of the first embodiment will be described in order, and then other embodiments will be described.

[Explanation of terms]
First, main terms used in the following examples will be described. “Message” means, for example, “e-mail” transmitted / received between users using a mail transfer system, “control message” transmitted / received between users using an IP (Internet Protocol) telephone system, etc. That is. In the mail transfer system and the IP telephone system, such “message” includes “source information” that is information about the source of the message. More specifically, in the “e-mail” of the mail transfer system using SMTP (Simple Mail Transfer Protocol), for example, a sender's mail address such as “matsui@isp-b.ne.jp” is “source”. Included as "information". The “control message (for example, INVITE message)” of the IP telephone system based on SIP (Session Initiation Protocol) includes, for example, a telephone number such as “050-1234-5678”, “05012345678 @ isp-b. A SIP URI (Session Initiation Protocol Uniform Resource Identifier) such as “ne.jp” is included as “source information”.

  By the way, considering that the mail transfer system or the IP telephone system transfers “e-mail” from the caller user to the callee user, or “control message” of the IP phone, It seems that transfer of “e-mail” and “control message” can be realized only based on destination information (for example, destination mail address, telephone number, SIP URI, etc.). However, in recent years, “spam mail” on the Internet has become a major problem, and mail transfer systems and IP telephone systems must provide a so-called incoming call rejection service as a countermeasure against “spam mail”. That is, the mail transfer system and the IP telephone system do not transfer all “e-mail” and “control message” sent to the user to the user based on the destination information. Controls such as rejecting the transfer or rejecting the transfer of the “control message” must be performed.

  For this reason, “message transfer systems” such as mail transfer systems and IP telephone systems not only transfer “e-mail” and “control messages” based on destination information, but also based on “source information”. This controls the transfer of “e-mail” and “control message” to the user.

[Outline and Features of Message Transfer System According to Embodiment 1]
Next, the outline and characteristics of the message transfer system according to the first embodiment will be described with reference to FIG. FIG. 1 is a diagram for explaining the outline and features of the message transfer system according to the first embodiment. In the following first embodiment, a mail transfer system for transferring an electronic mail will be described as a message transfer system. However, the present invention is not limited to this, and an IP telephone system for transferring an IP phone control message or the like. In addition, the present invention can be similarly applied. An embodiment in which the present invention is applied to an IP telephone system will be described in a fourth embodiment.

  As described above, the message transfer system according to the first embodiment is generally configured to control message transfer to a user based on source information that is information about the source of a message included in a message. In the system, the storage area used for registration of sender information is not increased, the efficiency of searching for sender information is not reduced when determining whether message transfer is permitted, and thus the number of registered sender information It is characterized by not restricting.

  Briefly describing this main feature, the message transfer system according to the first embodiment, as shown in FIG. 1, in the bit pattern holding unit (corresponding to the “bit pattern holding means” described in the claims), A bit pattern having a certain number of bits consisting of values of 0 and 1 and user information for identifying the user are stored in association with each other. For example, as shown in FIG. 1A, the message transfer system holds “010001000111...” As a bit pattern and “suzuki” as user information in association with each other.

  Here, the bit pattern associated with the user information “suzuki” will be briefly described. For example, in the first embodiment, the user (suzuki) permits the transfer of an e-mail when using the message transfer system. The sender information of the sender to be registered can be registered in advance as a bit pattern. That is, in the first embodiment, the bit pattern in a state where no source information is registered (initial state) is “000000000000 ...”, and therefore, the bit pattern “010001000111... Shown in FIG. “” Represents a state in which one or a plurality of pieces of sender information that the user (suzuki) permits the transfer of electronic mail is registered in advance. A specific method for registering the sender information will be described in detail later.

  In FIG. 1, a state is described in which one or a plurality of transmission source information for which a user (suzuki) permits the transfer of an e-mail is registered in advance, but the present invention is not limited to this. Even in a state where no source information is registered (initial state), the present invention can be similarly applied. In FIG. 1, for convenience of explanation, the bit pattern holding unit shows only the bit pattern associated with the user information “suzuki”. However, in actuality, the bit pattern holding unit For one or more users who use the transfer system, a bit pattern associated with each user information is held.

  With such a configuration, the message transfer system according to the first embodiment controls the transfer of messages to the user. In the following, the message transfer system is registered with the stage of registering the sender information in the message transfer system. The message transfer system will be described in two steps, that is, the step of controlling the message transfer based on the source information. FIG. 1A is a diagram for explaining the stage of registering sender information in the message transfer system, and FIG. 1B shows that the message transfer system transfers a message based on the registered sender information. It is a figure explaining the step which controls.

  First, the stage of registering the sender information in the message transfer system will be described. As shown in FIG. 1A, the message transfer system according to the first embodiment allows a user (suzuki) to transfer a message. A bit pattern of a certain number of bits is calculated from the source information of the source using a certain function (see (1) in (A) of FIG. 1). For example, the message transfer system calculates a bit pattern of a certain number of bits from a mail address “matsui@isp-b.ne.jp” as source information using a hash function or the like. In FIG. 1A, “0101111010000...” Is exemplified as the calculated bit pattern.

  Next, the message transfer system performs an OR operation on the bit pattern held by the bit pattern holding unit and the calculated bit pattern in units of bits (see (2) in FIG. 1A). For example, the message transfer system performs an OR operation on the bit pattern “01000011011...” Held by the bit pattern holding unit and the calculated bit pattern “0101111010000. ... "

  Then, the message transfer system replaces and registers the bit pattern held by the bit pattern holding unit with the bit pattern obtained by the OR operation (see (3) of (A) in FIG. 1). . For example, the message transfer system replaces the held bit pattern “01000110111...” With the resulting bit pattern “01010110111...” And registers the resulting bit pattern “010101101111. To do.

  Next, a description will be given of a stage in which the message transfer system controls message transfer based on registered sender information. As shown in FIG. 1B, the message transfer system according to the first embodiment is a user. 1 (see (1) in FIG. 1B), a bit pattern of a certain number of bits is calculated from a source information included in the message using a certain function (( (See B) (2)). For example, the message transfer system calculates a bit pattern of a certain number of bits from the email address “matsui@isp-b.ne.jp” as the sender information included in the message using a hash function, etc., and the resulting bit pattern "01011110000 ..." is obtained. The number of bits and the function must be the same as the number of bits and the function described in (1) of FIG.

  Then, the message transfer system compares the bit pattern held by the bit pattern holding unit with the calculated bit pattern in units of bits (see (3) in (B) of FIG. 1). For example, the message transfer system compares the bit pattern “0101110111...” Held by the bit pattern holding unit with the calculated bit pattern “0101111010000.

  Then, in the calculated bit pattern, when the bits having the same order as the bits having the value “1” are all the values “1” in the bit pattern held by the bit pattern holding unit, the message transfer system Control is performed to forward the received electronic mail to the user (see (4) of FIG. 1B). For example, in the calculated bit pattern “0101111010000...”, Bits having a value of “1” are bits of the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank. On the other hand, in the bit pattern “01011101111...” Held by the bit pattern holding unit, all the bits of the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank are compared to “1”. Is the value of For this reason, the message transfer system according to the first embodiment controls the received e-mail (e-mail with the sender information “matsui@isp-b.ne.jp”) to be transferred to the user (suzuki). To do.

  In this way, the message transfer system according to the first embodiment does not increase the storage area used for registration of the sender information, and improves the efficiency of searching for the sender information when determining whether to permit message transfer. It is possible to prevent the number of registered sender information from being restricted without lowering.

  That is, according to the message transfer system according to the first embodiment, the transmission source information is registered by being replaced with a bit pattern having a predetermined number of bits (the transmission source information is registered in a single bit pattern). For this reason, the storage area used for registration of source information is not increased in proportion to the number of registered source information. Further, since the storage area used for registration of the sender information is not increased, the storage area for searching the sender information is not increased when determining whether or not the message transfer is permitted. Does not decrease. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered sender information is not limited.

  FIG. 1 illustrates an example in which the message transfer system registers the bit pattern calculated from the email address “matsui@isp-b.ne.jp” as the sender information at the stage of registering the sender information. Since the example of controlling the forwarding of emails received from the email address “matsui@isp-b.ne.jp” was explained at the stage of controlling the forwarding of messages, the message forwarding system uses the received emails. However, the present invention is not limited to this, and when the message transfer system controls the transfer of an e-mail received from unregistered source information, the message transfer system The received electronic mail is controlled not to be transferred to the user.

[Configuration of Message Transfer System According to Embodiment 1]
Next, the configuration of the message transfer system according to the first embodiment will be described with reference to FIGS. FIG. 2 is a block diagram illustrating a configuration of the message transfer system according to the first embodiment, FIG. 3 is a diagram for explaining a bit pattern calculation unit, and FIG. 4 illustrates a bit pattern table of the data management server. It is a figure for demonstrating.

  First, the configuration of the message transfer system according to the first embodiment will be described with reference to FIG. 2. The message transfer system according to the first embodiment connects the user A terminal 220 and the user B terminal 320 to the user A side. The connection is established via the IP network 240, the Internet 400, and the user B side IP network 340. For example, the message transfer system sends an e-mail to the user A 230 transmitted from the user B terminal 320 with the user B 330 as a transmission source via the user B mail server 310, the user A mail server 140, etc. Transfer to user A terminal 220.

  The user A terminal 220 and the user B terminal 320 are terminal devices that are used when the user A 230 and the user B 330 exchange e-mails via the Internet 400, and are connected to a commercially available personal computer (PC). Web browser software and electronic mail software are installed and connected to the user A side IP network 240 and the user B side IP network 340 via the router R, respectively. The user A side IP network 240 and the user B side IP network 340 are connected to the Internet 400 via the router R, respectively.

  User A mail server 140 and user B mail server 310 are so-called existing mail servers. That is, the user A mail server 140 includes a general SMTP / POP (Post Office Protocol) communication unit 141 and a mail storage unit 142, and accepts an email transmitted from the user A terminal 220 and transmits it to a destination. At the same time, the electronic mail to the user A terminal 220 is received and transmitted to the user A terminal 220. User B mail server 310 accepts an e-mail transmitted from user B terminal 320 and transmits it to a destination, and also receives an e-mail to user B terminal 320 and transmits it to user B terminal 320. To do. In the first embodiment, for convenience of explanation, a case in which only two terminal devices and a mail server are configured will be described. However, the present invention is not limited to this, and many terminal devices and many The present invention can be similarly applied to a case where the mail server is configured.

  Further, in the message transfer system according to the first embodiment, an authorized caller registration server 120, a data management server 130, and a mail filter server 110 are provided as particularly closely related to the present invention. These permitted caller registration server 120, data management server 130, and mail filter server 110 are connected to a LAN 100 connected to the Internet 400 via a firewall FW. Hereinafter, the permitted caller registration server 120, the data management server 130, and the mail filter server 110 will be described in order.

[Permitted caller registration server 120]
The permitted caller registration server 120 in the first embodiment is a server for registering caller information of a caller that permits a user to transfer an e-mail, and particularly as closely related to the present invention, FIG. As shown, an HTTP communication unit 121, a permitted caller registration processing unit 122, and a bit pattern calculation unit 123 are provided. The permitted caller registration server 120 can be realized by installing programs corresponding to these units in a commercially available personal computer (PC) or workstation (WS). The permitted sender registration processing unit 122 and the bit pattern calculation unit 123 correspond to “bit pattern registration unit” described in the claims.

  The HTTP communication unit 121 includes a general library for HTTP (HyperText Transfer Protocol) communication, and performs HTTP communication with other communication devices. Specifically, when the permitted caller registration server 120 has a Web server function, the HTTP communication unit 121 transmits the sender information (users) transmitted from the user A terminal 220 via the Web browser. A230 accepts registration of sender information that permits the transfer of electronic mail), transmits and receives information necessary for registration to and from user A terminal 220, and permits sender registration processing unit 122 as necessary. And so on.

  For example, when the HTTP communication unit 121 receives a mail address “matsui@isp-b.ne.jp” as the sender information from the user A terminal 220, the HTTP address “matsui@isp-b.ne.jp” is described later. The authorized sender registration processing unit 122 is activated for the purpose of registration in the bit pattern table 131 of the data management server 130. In the first embodiment, the permitted caller registration server 120 has a Web server function, and the HTTP communication unit 121 registers the caller information between the permitted caller registration server 120 and the user A terminal 220. However, the present invention is not limited to this, and the sender information is registered between the permitted sender registration server 120 and the user A terminal 220 by other techniques. In addition, the present invention can be similarly applied.

  The permitted sender registration processing unit 122 registers the sender information in the bit pattern table 131 of the data management server 130 described later. Specifically, the permitted caller registration processing unit 122, when activated by the HTTP communication unit 121, first activates the bit pattern calculation unit 123 to transmit source information (at this time, the bit pattern calculation unit 123). The calculated bit pattern is acquired from the bit pattern calculation unit 123. Next, the permitted caller registration processing unit 122 performs a bitwise OR operation on the bit pattern held by the bit pattern table 131 and the bit pattern calculated by the bit pattern calculation unit 123 as a bit obtained as a result. The bit pattern held in the bit pattern table 131 is replaced and registered by the pattern.

  For example, the permitted caller registration processing unit 122 uses the bit pattern “01000110111...” Held in the bit pattern table 131 and the bit pattern “0101111010000...” Calculated by the bit pattern calculation unit 123 in bit units. To obtain a bit pattern “0101110111011...”. Next, the permitted caller registration processing unit 122 replaces the bit pattern held in the bit pattern table 131 with the bit pattern “0101110111...” Obtained as a result.

  The bit pattern calculation unit 123 calculates a bit pattern of source information registered in the bit pattern table 131. Specifically, when the bit pattern calculation unit 123 is activated by the permitted caller registration processing unit 122, the bit pattern calculation unit 123 converts a bit pattern of a certain number of bits from a source information acquired from the permitted caller registration processing unit 122 to a certain function. The calculated bit pattern is transmitted to the permitted caller registration processing unit 122. Thereafter, the permitted caller registration processing unit 122 performs an OR operation with the bit pattern held in the bit pattern table 131 using the bit pattern transmitted by the bit pattern calculation unit 123 as described above. Etc.

  Here, the calculation method of the bit pattern calculation unit 123 will be described in detail. Since the bit pattern calculation unit 123 according to the first embodiment is calculated by applying a Bloom filter, first, the number of bits (m) is less than a certain number. A plurality of positive integer values are derived for each hash function from the source information by using a plurality of hash functions for deriving a positive integer value. Next, the bit pattern calculation unit 123 generates, for each hash function, a bit pattern of the number of bits m in which the bits in the order corresponding to the positive integer value are “1”. And the bit pattern calculation part 123 calculates a bit pattern from transmission origin information by carrying out OR operation of the produced | generated several bit pattern per bit.

  For example, as shown in FIG. 3, when the bit pattern calculation unit 123 acquires “matsui@isp-b.ne.jp” (assumed to be A) as source information, first, an integer value of 1 or more and m or less is obtained. Using a plurality of hash functions (h1 (), h2 (),..., Hk ()) derived as hash values, a plurality of integer values (h1 (A), h2 (A ), ..., hk (A)). Next, the bit pattern calculation unit 123 “bit pattern in which only the h1 (A) bit is 1”, “bit pattern in which only the h2 (A) bit is 1”, and “hk (A) bit only” Generate a bit pattern with the number of bits m, where the bit corresponding to h1 (A), h2 (A),..., Hk (A) has a value of “1”, such as “1”. . Then, the bit pattern calculation unit 123 generates the “bit pattern in which only the h1 (A) bit is 1”, “bit pattern in which only the h2 (A) bit is 1”, “hk (A) bit” The bit pattern H (A) is calculated by performing an OR operation on the bit pattern in which only the eyes are set to 1 in units of bits. In the first embodiment, this bit pattern H (A) is a bit pattern calculated from the transmission source information.

  In the first embodiment, the bit pattern calculation unit 123 has described the method of calculating the bit pattern from the transmission source information using the function as described above. However, the present invention is not limited to this, and is simply The present invention is also applied to a method for calculating a bit pattern from source information using a hash function, a method for converting source information into a bit pattern by another algorithm and cutting out the number of bits m, and a method using other functions. The same can be applied. In the method of calculating simply using a hash function, for example, when the bit pattern calculation unit 123 acquires “matsui@isp-b.ne.jp” (A) as source information, a bit pattern of m bits is derived. For example, a bit pattern H (A) having a bit number m is calculated using the hash function h (). In such a case, it is possible to safely hold the bit pattern in the message transfer system. That is, the hash function has a characteristic for calculating a fixed-length bit pattern, a characteristic as a one-way function (it is virtually impossible to infer the data used for the calculation from the calculated bit pattern), and the same bit pattern For example, the bit pattern in which the source information is registered leaks because it has a characteristic that it is difficult to create data for calculating the same (it is difficult to calculate the same bit pattern from different source information). Even if a situation occurs, it is possible to safely hold the bit pattern because there is no possibility that the source information is inferred from the bit pattern. Further, in the method of cutting out only the number of bits m, for example, cutting out only the number of bits m from a bit pattern expressing “matsui@isp-b.ne.jp” with values of “0” and “1”.

  In the first embodiment, when the bit pattern calculation unit 123 calculates a bit pattern for the purpose of registering the mail address “matsui@isp-b.ne.jp” (the account name part before the @ mark). And the domain name part after the @ mark are registered together), but the present invention is not limited to this, for example, from a specific domain. When operating a service that controls the transfer of e-mail for each domain, such as allowing transfer of all e-mails, such as when calculating a bit pattern for the purpose of registering only the domain name part. Any method may be used as long as it is calculated according to the form.

[Data management server 130]
The data management server 130 according to the first embodiment is a server that manages transmission source information (bit pattern) that allows a user to transfer an e-mail, and is particularly closely related to the present invention. Is provided. The data management server 130 can be realized by installing a program such as an RDBMS (Relational DataBase Management System) on a commercially available personal computer (PC) or workstation (WS). The bit pattern table 131 corresponds to “bit pattern holding unit” recited in the claims.

  The bit pattern table 131 holds a bit pattern of the number of bits m consisting of values of “0” and “1” and user information for identifying the user in association with each other. Specifically, in the bit pattern table 131, the held bit pattern is transmitted to the permitted caller registration server 120, or the held bit pattern is replaced by the permitted caller registration server 120. The bit pattern held in the bit pattern table 131 is used by the bit pattern comparison unit 114 of the mail filter server 110 described later.

  For example, as shown in FIG. 4, the bit pattern table 131 holds bit patterns and user IDs (user information) in association with each other. In FIG. 4, the bit pattern is indicated as “0x4f2591ab...” Or the like, but in actuality, it is processed as a bit pattern of the number of bits m including the values “0” and “1”.

  Further, for example, the bit pattern table 131 associates with the user information “suzuki” when the permitted sender registration server 120 registers the sender information of the sender permitted by the user (suzuki). For example, “010001000111...” Is transmitted to the permitted caller registration server 120 as the bit pattern to be held. Also, for example, when the bit pattern table 131 receives a bit pattern such as “0101110111011...” From the permitted caller registration server 120 as a new bit pattern to be stored in association with the user information “suzuki”, For example, “010100001011...” Is replaced with “01010110111.

  By the way, when the operation of the message transfer system according to the first embodiment is started, the bit pattern held in the bit pattern table 131 is considered to be in a state (initial state) in which no sender information is registered. What bit pattern should be retained in association with user information as an initial state varies depending on the operation form, but the most typical method is that all bits are “000000000000000... A method of holding a bit pattern having a value of “0” is conceivable. In this way, the bit pattern table 131 stores bit patterns that are all “0” values in the initial state in association with the user information, and the user identified by the user information transfers the email. The value of “0” is appropriately replaced with the value of “1” each time the sender information of the permitted sender is registered.

  Theoretically, all bits are eventually replaced with a value of “1”, and it can be considered that a bit pattern in which all bits have a value of “1” such as “111111111111. However, by setting the number of bits m in accordance with the mode of operation, a state in which all bits have a bit pattern having a value of “1” is avoided.

[Mail Filter Server 110]
The mail filter server 110 according to the first embodiment is a server that controls the transfer of an electronic mail to a user. Particularly, as closely related to the present invention, as shown in FIG. 2, a mail communication unit 111, a filter, A processing unit 112, a bit pattern calculation unit 113, and a bit pattern comparison unit 114 are provided. The mail filter server 110 can be realized by installing a program corresponding to these units in a commercially available personal computer (PC) or workstation (WS). The bit pattern calculation unit 113 corresponds to the “bit pattern calculation unit” described in the claims, and the filter processing unit 112 and the bit pattern comparison unit 114 include the “message transfer control unit” described in the claims. ".

  The mail communication unit 111 receives an e-mail from the mail server of the transmission source, and transmits the e-mail to the user's mail server according to the processing in the filter processing unit 112. Specifically, when the email communication unit 111 receives an e-mail from a mail server that is a transmission source, the mail communication unit 111 activates the filter processing unit 112 and transmits the received e-mail to the filter processing unit 112. Further, the mail communication unit 111 transmits the email received from the filter processing unit 112 to the user's mail server in accordance with the processing in the filter processing unit 112.

  The filter processing unit 112 controls transfer of e-mail to the user. Specifically, when activated by the mail communication unit 111, the filter processing unit 112 activates the bit pattern calculation unit 113 and transmits the email received from the mail communication unit 111 to the bit pattern calculation unit 113. Further, the filter processing unit 112 receives the comparison result from the bit pattern comparison unit 114, controls the transfer of the e-mail to the user based on the received comparison result, and transmits it to the mail communication unit 111.

  For example, the filter processing unit 112 indicates that the comparison result received from the bit pattern comparison unit 114 indicates that all the bits having the same rank as the bit having the value of “1” in the calculated bit pattern are “ If the result is “a value of 1”, the received electronic mail is controlled to be transferred to the user.

  Further, the filter processing unit 112 indicates that the comparison result indicates that any bit having the same rank as the bit having the value “1” in the calculated bit pattern is not the value “1” in the held bit pattern. If the result is "", control is performed so that the received electronic mail is not transferred to the user.

  When the bit pattern calculation unit 113 receives an e-mail for the user, the bit pattern calculation unit 113 calculates a bit pattern of the number of bits m from a source information included in the e-mail using a certain function. Specifically, when activated by the filter processing unit 112, the bit pattern calculation unit 113 uses a bit pattern of m bits from a source information included in an e-mail received from the filter processing unit 112 using a certain function. The calculated bit pattern is transmitted to the bit pattern comparison unit 114.

  Here, the calculation method of the bit pattern calculation unit 113 will be specifically described. It is assumed that the bit pattern calculation unit 113 in the first embodiment is based on the same calculation method as the bit pattern calculation unit 123 of the permitted caller registration server 120. Become. That is, in the message transfer system according to the first embodiment, the bit pattern calculated by the bit pattern calculation unit 123 of the permitted caller registration server 120 and registered in the bit pattern table 131 of the data management server 130 and the mail filter server 110 Since the transfer of the e-mail is controlled by comparing with the bit pattern calculated by the bit pattern calculation unit 113, the calculation methods of the bit pattern calculation unit 123 and the bit pattern calculation unit 113 are not the same calculation method. Don't be. That is, the bit pattern calculation unit 113 also calculates a bit pattern by a calculation method as shown in FIG. 3, for example.

  The bit pattern comparison unit 114 compares the bit pattern held in the bit pattern table 131 of the data management server 130 with the bit pattern calculated by the bit pattern calculation unit 113 in units of bits. Specifically, the bit pattern comparison unit 1114 compares the bit pattern held by the bit pattern table 131 with the bit pattern calculated by the bit pattern calculation unit 113 in units of bits, and compares the result of the comparison with the filter processing unit. 112.

  For example, when the bit pattern held by the bit pattern table 131 is “0101110111011...” And the bit pattern calculated by the bit pattern calculation unit 113 is “0101111010000. Compares “01010110111...” And “0101111010000...” Bit by bit. Then, the bit pattern comparison unit 114 has the bits of the value “1” in the calculated bit pattern because the bits are the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank. In the bit pattern held in the bit pattern table 131, when compared with the bits of the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank, all values are “1”. The result of the comparison that the bits having the same rank as the bit having the value “1” in the calculated bit pattern are all “1” in the held bit pattern ”is transmitted to the filter processing unit 112.

  In addition, the bit pattern comparison unit 114 compares the bit pattern held in the bit pattern table 131 with the bit pattern calculated by the bit pattern calculation unit 113 in units of bits, and “1” in the calculated bit pattern. If any bit in the same order as the value bits is not a value of “1” in the bit pattern held by the bit pattern table 131, a bit having a value of “1” in the calculated bit pattern The result of the comparison that any bit in the same rank is not “1” in the held bit pattern is transmitted to the filter processing unit 112.

[Processing Procedure by Message Transfer System According to Embodiment 1]
Next, a processing procedure by the message transfer system according to the first embodiment will be described with reference to FIGS. FIG. 5 is a sequence diagram showing a processing procedure for registering source information in the message transfer system. FIG. 6 is a sequence diagram showing a processing procedure for controlling message transfer based on the registered source information. FIG. 7 is a flowchart showing a processing procedure in the mail filter server.

[Process to register sender information in the message transfer system]
The message transfer system according to the first embodiment uses a mail address (hereinafter referred to as a permission address) included in an e-mail as the sender information of a sender that allows the user to transfer the e-mail. For example, as shown in FIG. 5, the message transfer system registers the mail address “matsui@isp-b.ne.jp” as the permitted address. Further, in the message transfer system according to the first embodiment, as shown in FIG. 5, communication is performed between the user A terminal 220 (user A230) and the permitted caller registration server 120, thereby allowing the permitted caller. Although the case where the permitted address registration process in the registration server 120 is started is illustrated, the present invention is not limited to this. For example, the permitted address presented offline from the user A 230 is used as the permitted caller registration server 120. For example, when the permitted caller registration server 120 acquires the permitted address registered in the permitted caller registration server 120, such as when registering offline.

  First, the user A terminal 220 accepts an input of a permission address by the user A230 (step S511). For example, in the message transfer system according to the first embodiment, if the permitted caller registration server 120 has a Web server function and the user A terminal 220 has a Web browser, the user A terminal 220 The “permitted address registration screen” received from the permitted caller registration server 120 is displayed on the web browser, and “user ID of user A230 (suzuki)” or “permitted address (matsui@isp-b.ne.jp)” is displayed. ”Is received by the user A 230.

  Then, the user A terminal 220 transmits a permitted address registration request to the permitted caller registration server 120 (step S512). For example, the user A terminal 220 transmits information such as “user ID (suzuki)” and “permitted address A (matsui@isp-b.ne.jp)” by HTTP as a permitted address registration request. .

  On the other hand, when the permitted caller registration server 120 receives the permitted address registration request from the user A terminal 220, the permitted caller registration server 120 calculates a bit pattern of the permitted address (step S513). Specifically, the permitted caller registration server 120 activates the permitted caller registration processing unit 122 when the HTTP communication unit 121 accepts the permitted address registration request, and then the permitted caller registration processing unit 122 performs a bit pattern. The calculation unit 123 is activated, and the bit pattern calculation unit 123 calculates the bit pattern of the permitted address. For example, the bit pattern calculation unit 123 calculates the bit pattern H (A) of the permitted address “matsui@isp-b.ne.jp” (A).

  Next, the permitted caller registration server 120 acquires the bit pattern W corresponding to the user ID from the bit pattern table 131 of the data management server 130 (step S514). Specifically, the permitted caller registration server 120 receives the bit pattern H (A) calculated by the bit pattern calculation unit 123 in the permitted caller registration processing unit 122, and the bit corresponding to the user ID (suzuki). The pattern W is acquired from the bit pattern table 131.

  Then, the permitted caller registration server 120 sets W ′ as a bit pattern as a result obtained by ORing the bit pattern W and the bit pattern H (A) (step S515). Specifically, the permitted caller registration server 120 includes the bit pattern W acquired from the bit pattern table 131 and the bit pattern H (A) calculated by the bit pattern calculation unit 123 in the permitted caller registration processing unit 122. Let W ′ be the bit pattern of the result obtained by performing an OR operation on each bit.

  Subsequently, the permitted caller registration server 120 registers the resulting bit pattern W ′ in the bit pattern table 131 as a bit pattern corresponding to the user ID (step S516). Specifically, the permitted caller registration server 120 performs registration in the permitted caller registration processing unit 122 by replacing the bit pattern W held in the bit pattern table 131 with the resulting bit pattern W ′.

  Next, the permitted caller registration server 120 returns a permitted address registration response to the user A terminal 220 (step S517). For example, the permitted caller registration server 120 transmits a message such as “Registration of the permitted address has been completed normally” to the user A terminal 220, and this message is displayed on the Web browser of the user A terminal 220. It is displayed.

  Since the bit pattern held in the bit pattern table 131 is replaced from the bit pattern W to the bit pattern W ′, in step S514 when a new permitted address is registered, the bit pattern W corresponding to the user ID is stored. 'Will be acquired.

[Process to control message forwarding based on registered sender information]
In the following, as shown in FIG. 6, the message transfer system according to the first embodiment is an e-mail to the user A 230, and the e-mail transmitted from the user B terminal 320 (user B 330) The case where it transfers to the user A terminal 220 (user A230) via the B mail server 310, the mail filter server 110, the user A mail server 140, etc. is illustrated.

  First, the user B terminal 320 receives an email transmission process by the user B330 and transmits an email to the user B mail server 310 (step S611). For example, in the message transfer system according to the first embodiment, assuming that the user B terminal 320 is provided with e-mail software, the user B terminal 320 has “destination address (suzuki@isp-a.ne.jp) ”And other texts are received by the user B 330 and the input electronic mail is transmitted to the user B mail server 310.

  Next, the user B mail server 310 transmits the email transmitted from the user B terminal 320 to the mail filter server 110 (step S612). Specifically, the user B mail server 310 accepts an e-mail transmitted from the user B terminal 320, and displays a “destination address (suzuki@isp-a.ne.jp)” or other text as a mail filter server. 110.

  Then, when the mail filter server 110 receives an email from the user B mail server 310, the mail filter server 110 performs a filtering process (determination of transfer possibility) (step S613). Specifically, when the mail communication server 111 accepts an email, the mail filter server 110 activates the filter processing unit 112, and the filter processing unit 112 activates the bit pattern calculation unit 113 and the bit pattern comparison unit 114. To control the forwarding of e-mails.

  For example, the mail filter server 110 first uses the bit pattern calculation unit 113 to calculate a bit pattern of m bits from a source information (matsui@isp-b.ne.jp) included in an e-mail using a certain function. The calculated bit pattern is transmitted to the bit pattern comparison unit 114. Next, the mail filter server 110 compares the bit pattern held in the bit pattern table 131 of the data management server 130 and the bit pattern calculated by the bit pattern calculation unit 113 in bit units in the bit pattern comparison unit 114. Then, the comparison result is transmitted to the filter processing unit 112.

  Subsequently, if the result of the filtering process (transferability determination) is “transferable”, the mail filter server 110 transfers the e-mail to the user A mail server 140 (steps S614 and S615). Specifically, the mail filter server 110 controls the transfer of the e-mail to the user A 230 based on the comparison result received from the bit pattern comparison unit 114 in the filter processing unit 112 and transmits it to the mail communication unit 111. To do.

  Thereafter, the user A mail server 140 stores the email transferred from the mail filter server 110 in the mail storage unit 142, the user A terminal 220 checks the arrival mail (step S621), the user As a result of the arrival mail confirmation, the A terminal 220 receives the mail (step S622), and the control of the transfer of the e-mail by the message transfer system according to the first embodiment is finished.

[Processing on mail filter server]
As shown in FIG. 7, the mail filter server 110 first receives an input of the caller address (A) in the bit pattern calculation unit 113 and calculates the bit pattern H (A) of the caller address (A) ( Step S711). Specifically, the mail filter server 110 receives an input of “sender address (A) (matsui@isp-b.ne.jp)” included in the e-mail in the bit pattern calculation unit 113, and the sender address From (A), a bit pattern of m bits is calculated using a certain function, and the calculated bit pattern is transmitted to the bit pattern comparison unit 114.

  Next, the mail filter server 110 acquires the bit pattern W corresponding to the destination user (R) from the bit pattern table 131 in the bit pattern comparison unit 114 (step S712). Specifically, the mail filter server 110 acquires the bit pattern W corresponding to the destination user (R) (suzuki) from the bit pattern table 131 of the data management server 130 in the bit pattern comparison unit 114.

  Then, in the bit pattern comparison unit 114, the mail filter server 110 determines whether all the bits having the same rank as the bits having the value “1” in the bit pattern H (A) have the value “1” in the bit pattern W. It is determined whether or not (step S713). Specifically, the mail filter server 110 uses the bit pattern comparison unit 114 to convert the bit pattern W held by the bit pattern table 131 and the bit pattern H (A) calculated by the bit pattern calculation unit 113 in bit units. In the bit pattern H (A), it is determined whether all the bits having the same rank as the bit having the value “1” in the bit pattern W are also the value “1” in the bit pattern W, and the comparison result is filtered. The data is transmitted to the processing unit 112.

  Then, the mail filter server 110 causes the filter processing unit 112 to show that the result of the comparison is “all the bits in the same order as the bits having the value“ 1 ”in the bit pattern H (A)” have the value “1” in the bit pattern W. If the result is “Yes” (Yes at Step S713), it is determined that the transfer possibility is “Transferable” (Step S714a). On the other hand, in the mail filter server 110, in the filter processing unit 112, the comparison result indicates that any bit having the same rank as the bit having the value “1” in the bit pattern H (A) is “1” in the bit pattern W. If the result is “not a value of” (No at Step S713), it is determined that the transfer is “not transferable” (Step S714b).

  Then, the mail filter server 110 outputs the availability of transfer determined in step S714a and step S714b, and ends the process.

  In this way, the message transfer system according to the first embodiment does not increase the storage area used for registration of the sender information, and improves the efficiency of searching for the sender information when determining whether to permit message transfer. It is possible to prevent the number of registered sender information from being restricted without lowering.

[Effect of Example 1]
As described above, according to the first embodiment, the message transfer system controls the transfer of the message to the user based on the source information included in the message, and the predetermined bit consisting of the values of 0 and 1 The bit pattern and the user information are stored in association with each other, and the bit pattern having a predetermined number of bits is calculated using a predetermined function from the source information of the sender that allows the user to transfer the message and stored. When the received bit pattern is received by replacing the stored bit pattern with the bit pattern obtained by ORing the calculated bit pattern and the calculated bit pattern in bit units, the message A bit pattern with a predetermined number of bits is calculated from the source information included in the The turn and the calculated bit pattern are compared in units of bits, and if the calculated bit pattern has all the values of 1 in the bit pattern in which the bits having the same rank as the value of 1 are held, the message is displayed. Since it is controlled so as to be transferred to the user, in the message transfer system, the storage area used for registration of the sender information is not increased, and the efficiency of searching for the sender information when judging whether or not the message transfer is permitted Thus, it is possible not to limit the number of registered source information.

  That is, according to the message transfer system according to the first embodiment, the transmission source information is registered by being replaced with a bit pattern having a predetermined number of bits (the transmission source information is registered in a single bit pattern). For this reason, the storage area used for registration of source information is not increased in proportion to the number of registered source information. Further, since the storage area used for registration of the sender information is not increased, the storage area for searching the sender information is not increased when determining whether or not the message transfer is permitted. Does not decrease. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered sender information is not limited.

  Further, according to the first embodiment, the message transfer system uses a plurality of hash functions for deriving a positive integer value equal to or less than a predetermined number of bits as a predetermined function, and a plurality of positive integer values are obtained from the source information as a hash function. Derived for each hash function, a bit pattern with a predetermined number of bits is generated for each hash function, with the bit of the order corresponding to a positive integer value as 1 value, and the generated bit pattern is ORed in bit units Thus, since the bit pattern is calculated from the source information, in the message transfer system, compared to the method of calculating the bit pattern from the source information using a single hash function, an erroneous determination (originally by the user) It is also possible to reduce the probability of e-mails from senders that do not permit e-mail transfer being judged to be transferred to users by mistake. That.

  That is, by applying a Bloom filter theory using a hash function, the bit pattern is calculated by combining the optimal number of bits and the optimal number of hash functions. Since the values of are distributed, it is possible to reduce the probability of erroneous determination.

  By the way, as the first embodiment, the method in which the transfer of the e-mail is controlled based on the sender information (white list) permitted to be transferred has been described. In this method, as described below, the call is transmitted. Original information cannot be deleted (source information that has been registered cannot be changed so that message transfer is not permitted), and senders who originally do not allow e-mail transfer The occurrence of a situation (erroneous determination) in which the e-mail is erroneously transferred to the user cannot be completely avoided. Therefore, in the following, as the second embodiment according to the present invention, for the purpose of realizing the same effect as the deletion of the sender information and dealing with the erroneous determination, the sender information (black) is rejected. A method of using e-mail transfer control based on (list) together will be described.

  The message transfer system according to the second embodiment is configured in substantially the same manner as in the first embodiment, but mainly includes a prohibited address table 132 added to the data management server 130, and an e-mail transfer in the filter processing unit 112. Are different from those of the first embodiment in that the control of the mail filter server 110 is changed and the processing procedure in the mail filter server 110 is changed. The procedure of the process will be described in order with reference to FIGS. FIG. 8 is a diagram for explaining the data management server in the second embodiment, FIG. 9 is a diagram for explaining the forbidden address table, and FIG. 10 is a flowchart showing a processing procedure in the mail filter server. FIG.

[Forbidden Address Table 132]
The data management server 130 according to the second embodiment further includes a prohibited address table 132 as shown in FIG. 8, particularly as closely related to the present invention. The forbidden address table 132 corresponds to “rejected sender information holding unit” recited in the claims.

  The forbidden address table 132 associates and holds the sender information of the sender from whom the user refuses to transfer the electronic mail and the user information for identifying the user. Specifically, the sender information held in the prohibited address table 132 is used by the filter processing unit 112 of the mail filter server 110.

  For example, as shown in FIG. 9, the prohibited address table 132 holds a prohibited address (source information) and a user ID (user information) in association with each other. In FIG. 9, the prohibited address table 132 has an account name portion before the @ mark and a domain name after the @ mark, such as an email address “akunin@isp-x.ne.jp” as the prohibited address. The case where a mail address combined with a part is registered is exemplified, but the present invention is not limited to this. For example, electronic mail for each domain is rejected, such as refusing to forward all emails from a specific domain. When operating a service that controls the transfer of mail, any service may be used as long as it conforms to the mode of operation, such as when registering only the domain name portion.

  Such a prohibited address table 132 is used when, for example, the user (suzuki) uses the message transfer system to register in advance the sender information of the sender who refuses to transfer the e-mail, or to use it during the use. It is retained by registering accordingly.

  By the way, while the bit pattern table 131 holds the sender information of the sender permitted by the user as the bit pattern, the prohibited address table 132 shows the sender information of the sender rejected by the user as the bit pattern. It is based on the idea shown below to hold the state as it is.

  The bit pattern stored in the bit pattern table 131 is obtained by registering source information in a single bit pattern. On the other hand, the mail filter server 110 controls transfer of e-mail by comparing two bit patterns bit by bit. Here, if a large number of pieces of source information are registered in the bit pattern held in the bit pattern table 131, the number of bits having a value of “1” is also increased. Then, when the bit pattern was calculated in the mail filter server 110 from the sender information included in the email sent from the sender, the sender information was not registered in the bit pattern held in the bit pattern table 131. Nevertheless, it may happen that all the bits in the same order as the bits having the value “1” in the calculated bit pattern have the value “1” in the held bit pattern.

  Such a situation (incorrect determination) is a situation in which “e-mail from a sender that the user originally does not permit e-mail transfer is erroneously transferred to the user”. However, considering that the same method is applied to the sender information of the sender who refuses to transfer the e-mail, the e-mail from the sender that the user originally permits the e-mail transfer May not be accidentally transferred to the user ”. From the viewpoint of measures against “spam mail”, the former situation is an acceptable situation, but the latter situation is an unacceptable situation. For this reason, in this embodiment, the bit pattern table 131 holds the sender information of the sender permitted by the user as a bit pattern, whereas the prohibited address table 132 contains the sender information that the user rejects. The sender information is held in a state that is not a bit pattern. In the case where it is possible to allow a situation in which “e-mail from the sender that the user originally permits the transfer of the e-mail is not transferred to the user by mistake” from a viewpoint different from the above-described viewpoint, The prohibited address table 132 may be held as a bit pattern.

[Filter processing unit 112]
The filter processing unit 112 controls the transfer of e-mail to the user as in the first embodiment, but performs a control different from that in the first embodiment. Specifically, if the bit pattern comparison unit 114 performs comparison, the filter processing unit 112 determines that the bit having the same rank as the bit having the value “1” in the bit pattern calculated by the bit pattern calculation unit 113 is Even if the sender information is such that the result of the bit pattern held by the pattern table 131 is “1” is all obtained (the sender of the sender that the user permits the transfer of e-mails) If the source information corresponds to the source information held by the prohibited address table 132, the electronic mail is controlled not to be transferred to the user.

  For example, when the filter processing unit 112 is activated by the mail communication unit 111, first, the caller information included in the e-mail is transmitted by the prohibited address table 132 before the bit pattern calculation unit 113 is activated. It is checked whether or not it corresponds to the original information, and when it is confirmed that it is not included, the bit pattern calculation unit 113 is activated and the process proceeds to the same process as in the first embodiment.

  Note that such control of the filter processing unit 112 brings the same result as deleting the transmission source information from the bit pattern held in the bit pattern table 131. In other words, in the method of registering by replacing source information with a bit pattern (method of registering source information superimposed on one bit pattern), the source information cannot be deleted (once registered) Source information cannot be changed to disallow message forwarding). However, as in the filter processing unit 112 in the second embodiment, even when the user is sender information that permits the transfer of an e-mail, the sender information is held by the prohibited address table 132. If this is the case, if the e-mail is controlled not to be forwarded to the user, the result is the same as deleting the sender information (even if the sender information has been registered once, message forwarding is not permitted) Can be controlled as well).

[Processing on mail filter server]
As shown in FIG. 10, the mail filter server 110 performs the processing procedure from step S1011 to step S1014 in the same manner as the mail filter server 110 in the first embodiment (see FIG. 7). The difference from the first embodiment is that step S1010 is added before step S1011.

  That is, the mail filter server 110 according to the second embodiment does not calculate the bit pattern H (A) of the caller address (A) in the bit pattern calculation unit 113 after receiving the input of the caller address (A). First, it is confirmed whether or not the sender address (A) corresponds to the prohibited address held by the prohibited address table 132 (step S1010), and if not (No at step S1010), the bit pattern calculation unit In 113, the process proceeds to the process of calculating the bit pattern H (A) of the caller address (A). If applicable (Yes in Step S1010), it is determined that the transfer is possible or not (Step S1014b). ), The process is terminated.

  In this way, the message transfer system according to the second embodiment uses the sender information (black list) of the sender that the user refuses to transfer the message to use the sender information once registered. However, it is also possible not to allow message transfer.

  In the second embodiment, the mail filter server 110 confirms whether or not the sender address (A) corresponds to the prohibited address, and then proceeds to the process of calculating the bit pattern H (A). Although the procedure has been described, the present invention is not limited to this. For example, the mail filter server 110 calculates the bit pattern H (A) from the sender address (A) and holds it in the bit pattern table 131. After the comparison with the bit pattern W, the order may be any, for example, confirming whether the sender address (A) corresponds to the prohibited address.

[Effect of Example 2]
As described above, according to the second embodiment, the message transfer system further holds the source information and the user information of the sender that the user refuses to transfer the message, and calculates the comparison result. Even if the bit pattern in which all the bits having the same order as the bits having the value of 1 are held in the bit pattern has a value of 1, the sender information included in the message is retained in the rejected sender information. If applicable, the message is controlled so that it is not forwarded to the user, so that the source information is registered by replacing it with a bit pattern (the method in which the source information is registered over one bit pattern) ) Cannot delete sender information (for sender information registered once, do not allow message forwarding) However, by using the sender information (black list) of the sender who refuses to forward the message, the message can be forwarded even for the sender information once registered. It is also possible not to do so.

  In addition, in the method of registering by replacing the sender information with a bit pattern, an erroneous determination (e-mail from a sender that the user originally does not permit e-mail transfer is erroneously transferred to the user). However, if the user keeps the sender information (black list) of the sender who refuses to transfer the message and uses it together, at least the user can actively It is also possible to avoid that an e-mail from a sender who does not permit transfer is erroneously transferred to the user.

  By the way, as the first and second embodiments so far, the message transfer system has described the method of holding the correspondence between one bit pattern and user information (the method having no concept of the cycle). Old registered sender information cannot be deleted (source information registered once cannot be deleted for old registered sender information), and misjudgment as more sender information is registered There is a risk that the probability of occurrence will increase. Therefore, in the following, as a third embodiment according to the present invention, a bit pattern and usage are used for the purpose of realizing a function of deleting old registration source information and increasing the probability of erroneous determination. A method will be described in which the association with the person information is held in units of periods from the current period to a certain period in the past, and the bit pattern is replaced as the period elapses.

  The message transfer system according to the third embodiment is configured in substantially the same manner as the first embodiment, but the bit pattern table 131 held in the data management server 130 is changed, and the sender information is registered in the message transfer system Since the processing procedure is changed, the processing procedure in the mail filter server is changed from the first embodiment, the bit pattern table 131, the permitted sender registration processing unit 122, the filter processing unit are described below. 112 and the bit pattern comparison unit 114 will be described in order with reference to FIG. FIG. 11 is a diagram for explaining the bit pattern table.

[Bit pattern table 131]
The bit pattern table 131 in the third embodiment holds the correspondence between the bit pattern and the user information as in the first embodiment, but unlike the first embodiment, the correspondence is changed from the current cycle to a past cycle. It is held in units. Sources that require users to allow email transfer are usually, for example, senders that have been disconnected for a long period of time, or sources that no longer need to allow email transfer due to environmental changes. It is considered that it changes with the passage of time. For this reason, the bit pattern table 131 according to the third embodiment manages the source information in time series by holding the source information in units of periods.

  For example, as shown in FIG. 11, the bit pattern table 131 associates a bit pattern with user information (user ID) from a current cycle w (0) to a certain cycle (w (L−1)). ) Until the period. For example, w (1) indicates that the cycle is one cycle before the current cycle w (0), and w (L-1) is the current cycle w (0) to (L-1). It indicates that the cycle is before the cycle.

  Also, the bit pattern table 131 in the third embodiment is different from the first embodiment in that the bit pattern of the current cycle is replaced with a bit pattern consisting of a value of “0” as the cycle elapses, and a past cycle Are discarded, and a bit pattern of a period other than a past period is replaced with a bit pattern of the previous period and held.

  Specifically, as the cycle progresses, the bit pattern table 131 replaces the bit pattern of the current cycle w (0) with a bit pattern consisting of all values of “0”, and (L−1) cycles before And discarding a bit pattern of a period other than (L-1) period (period from w (1) to w (L)) to a bit pattern of the previous period (w ( 2) to w (L-1)) and hold.

  In addition, the bit pattern table 131 in the third embodiment transmits the held bit pattern to the permitted caller registration server 120 as in the first embodiment, or the held bit pattern is replaced by the permitted caller registration server 120. . Also, the bit pattern held in the bit pattern table 131 is used by the bit pattern comparison unit 114 of the mail filter server 110 as in the first embodiment.

  However, since the bit pattern table 131 in the third embodiment holds the association in units of periods from the current period to a certain period in the past, the permitted sender registration server 120 permits the user (suzuki). When the sender information of the sender is registered, the bit pattern of the current period is transmitted to the permitted sender registration server 120 among the bit patterns held in association with the user information “suzuki”. In addition, when a new bit pattern stored in association with the user information “suzuki” is received from the permitted caller registration server 120, the bit pattern table 131 replaces and holds the bit pattern of the current period.

  In addition, since the bit pattern table 131 in the third embodiment holds the correspondence in units of cycles from the current cycle to a past cycle, as a result of the comparison by the bit pattern comparison unit 114, a cycle other than the current cycle is stored. When the filter processing unit 112 controls to transfer the e-mail to the user by setting all the bit patterns of “1” to “1”, the user information “ Among the bit patterns held in association with “suzuki”, the bit pattern of the current cycle is transmitted to the permitted caller registration server 120.

[Permitted caller registration processing unit 122]
The permitted sender registration processing unit 122 according to the third embodiment registers the sender information in the bit pattern table 131 of the data management server 130 as in the first embodiment, but unlike the first embodiment, the bit pattern table 131 includes the bit pattern table 131. Since the association between the pattern and the user information is held in units of periods from the current period to a certain period in the past, the permitted sender registration processing unit 122 uses the bit pattern of the current period in the bit pattern table 131. Register the sender information.

  Specifically, when the authorized caller registration processing unit 122 is activated by the HTTP communication unit 121 as in the first embodiment, it first activates the bit pattern calculation unit 123 to transmit source information (at this time). The bit pattern is calculated by the bit pattern calculation unit 123), and the calculated bit pattern is acquired from the bit pattern calculation unit 123. Next, unlike the first embodiment, the permitted caller registration processing unit 122 uses the bit pattern of the current period held in the bit pattern table 131 and the bit pattern calculated by the bit pattern calculation unit 123 in bit units. The bit pattern of the current period held in the bit pattern table 131 is replaced and registered with the bit pattern obtained by the OR operation.

  Further, unlike the first embodiment, the permitted caller registration processing unit 122 performs the filtering process by setting all the bit patterns in the cycles other than the current cycle to a value of “1” as a result of the comparison by the bit pattern comparison unit 114. Even when the electronic mail is controlled to be transferred to the user by the unit 112, the bit pattern calculation unit 123 is activated and the source information included in the electronic mail is transmitted. The bit pattern of the current period held by is replaced and registered.

[Filter processing unit 112]
The filter processing unit 112 in the third embodiment controls the transfer of e-mails to the user as in the first embodiment, but unlike the first embodiment, the bit pattern table 131 associates the bit pattern with the user information. Since the filter processing unit 112 receives the comparison result from the bit pattern comparison unit 114, the received comparison result is, for example, “ In the calculated bit pattern, when the bit having the same order as the bit having the value of “1” is the result of “all the values having the value of“ 1 ”in any of the bit patterns of the period”, The received electronic mail is controlled to be transferred to the user.

  Further, the filter processing unit 112 shows that the comparison result indicates that any bit having the same rank as the bit having the value “1” in the calculated bit pattern is in any bit pattern of the bit patterns of all periods. If the result is “not a value of“ 1 ””, the received electronic mail is controlled not to be transferred to the user.

[Bit pattern comparison unit 114]
The bit pattern comparison unit 114 according to the third embodiment compares the bit pattern held by the bit pattern table 131 and the bit pattern calculated by the bit pattern calculation unit 113 in units of bits as in the first embodiment. Unlike Example 1, since the bit pattern table 131 holds the correspondence between the bit pattern and the user information in units of cycles from the current cycle to a past cycle, the bit pattern comparison unit 114 calculates The bit pattern and the bit patterns of all periods held in the bit pattern table 131 are compared in bit units, and the comparison result is transmitted to the filter processing unit 112.

[Processing Procedure by Message Transfer System According to Third Embodiment]
Next, a processing procedure by the message transfer system according to the third embodiment will be described with reference to FIGS. 12 is a sequence diagram showing a processing procedure for registering sender information in the message transfer system, and FIG. 13 is a flowchart showing a processing procedure in the mail filter server and the permitted sender registration server. FIG. 9 is a flowchart showing a procedure of processing associated with the passage of a cycle in the bit pattern table 131.

[Process to register sender information in the message transfer system]
As in the first embodiment, the message transfer system according to the third embodiment registers an e-mail address “matsui@isp-b.ne.jp” as a permitted address, as shown in FIG. In the message transfer system according to the third embodiment, as in the first embodiment, the permitted caller registration is performed by performing communication between the user A terminal 220 (the user A230) and the permitted caller registration server 120. The case where the permitted address registration process in the server 120 is started will be exemplified.

  First, as in the first embodiment, the user A terminal 220 accepts the input of the permitted address by the user A230 (step S1211), and transmits a permitted address registration request to the permitted caller registration server 120 (step S1212). On the other hand, the permitted caller registration server 120 calculates the bit pattern H (A) of the permitted address (step S1213).

  Next, the permitted caller registration server 120 acquires the bit pattern corresponding to the user ID from the bit pattern table 131 of the data management server 130 as in the first embodiment, but unlike the first embodiment, the bit pattern table 131 However, since the association between the bit pattern and the user information is held in units of cycles from the current cycle to a certain past cycle, among the bit patterns corresponding to the user ID (suzuki), The bit pattern w (0) is acquired from the bit pattern table 131 (step S1214).

  Then, as in the first embodiment, the permitted caller registration server 120 sets the bit pattern obtained as a result of performing an OR operation on the bit pattern w (0) and the bit pattern H (A) as W ′ (step S1215). ).

  Subsequently, the permitted caller registration server 120 registers the resulting bit pattern W ′ in the bit pattern table 131 as a bit pattern corresponding to the user ID, as in the first embodiment. The bit pattern W ′ is registered in the bit pattern table 131 as the bit pattern w (0) of the current cycle among the bit patterns corresponding to the user ID (step S1216).

  Next, the permitted caller registration server 120 returns a permitted address registration response to the user A terminal 220 as in the first embodiment (step S1217).

[Processing on mail filter server and permitted caller registration server]
As shown in FIG. 13, as in the first embodiment, the mail filter server 110 first receives an input of the caller address (A) in the bit pattern calculation unit 113 and receives the bit pattern H ( A) is calculated (step S1311).

  Next, the mail filter server 110 obtains the bit pattern corresponding to the destination user (R) from the bit pattern table 131 in the bit pattern comparison unit 114 as in the first embodiment. Since the pattern table 131 holds the correspondence between the bit pattern and the user information in units of cycles from the current cycle to a past cycle, the bit pattern comparison unit 114 corresponds to the destination user (R). The bit pattern w (L-1) having a past period is acquired from the bit pattern w (0) of the current period from the bit pattern w (0) of the current period from the bit pattern table 131 (step S1312).

  Similarly to the first embodiment, the mail filter server 110 causes the bit pattern comparison unit 114 to set all the bits in the same order as the bits having the value “1” in the bit pattern H (A) to “1” even in the bit pattern W. However, unlike the first embodiment, in the bit pattern comparison unit 114, the bits having the same order as the bits having the value “1” in the bit pattern H (A) It is determined whether or not all the bit patterns of the bit pattern W are “1” (step S1313).

  Then, in the same manner as in the first embodiment, the mail filter server 110 causes the filter processing unit 112 to check that the bit having the same rank as the bit having the value “1” in the bit pattern H (A) is the bit pattern w ( If all the bit patterns from 0) to w (L−1) are “1” values ”(Yes in step S1313), the transferability is“ transferable ”. Judgment is made (step S1314a), and the comparison result is “any bit in the same order as the bit having the value of“ 1 ”in bit pattern H (A) is from bit pattern w (0) to w (L−1)”. If any of the bit patterns is not “1” (No in step S1313), it is determined that the transfer is not possible (step S13). 314b).

  Next, unlike the first embodiment, if the mail filter server 110 determines that the transfer possibility is “transferable” as a result of comparison with a bit pattern other than the bit pattern w (0), the bit pattern H (A) is transmitted to the permitted caller registration server 120, and the permitted caller registration server 120 uses the bit pattern H (A) and the current bit pattern table 131 stored in the permitted caller registration processing unit 122. The bit pattern w (0) of the current cycle is replaced with the bit pattern w 'obtained as a result of performing an OR operation on the bit pattern w (0) of the current cycle in bit units (step S1315).

  Then, as in the first embodiment, the mail filter server 110 outputs the transfer permission / prohibition determined in steps S1314a and S1314b, and ends the process.

  In the third embodiment, when the mail filter server 110 determines that “transfer is possible” (step S1314a), the bit pattern of the current period held in the bit pattern table 131 is replaced and registered in step S1315. Although the processing procedure has been described, the present invention is not limited to this. For example, it is determined that the mail filter server 110 is “transferable” (step S1314a), and then the mail filter server 110 notifies the user. When an e-mail is transferred, the user sends an e-mail to the sender information included in the e-mail or when the user replies the e-mail to the sender information included in the e-mail. When the bit pattern of the current period held by the bit pattern table 131 is Also processing procedure for registering replacing down, it is possible to apply the present invention likewise.

[Processing procedure associated with the passage of cycles in the bit pattern table]
The bit pattern table 131 in the third embodiment is different from the first embodiment in that the association between the bit pattern and the user information is performed from the current cycle w (0) to a past cycle (w (L-1)). Since it is held in units, with the passage of the cycle, the bit pattern of a cycle other than a past cycle (w (L-1)) is replaced with the bit pattern of the previous cycle and held (step) S1411). Specifically, the bit pattern having the cycle of w (n) is replaced with the bit pattern of the previous cycle w (n−1) and held. Accordingly, a bit pattern having a past period (w (L-1)) is discarded.

  Next, as the cycle elapses, the bit pattern table 131 replaces the bit pattern of the current cycle w (0) with a bit pattern consisting of all values of “0” (step S1412).

  In this way, the message transfer system according to the third embodiment holds the bit pattern in units of cycles from the current cycle to the past predetermined cycle, and discards the bit pattern of the past predetermined cycle as the cycle elapses. By doing so, it is possible to delete the old registered sender information even if it is registered once.

[Effect of Example 3]
As described above, according to the third embodiment, the message transfer system holds the correspondence between the bit pattern and the user information in units of cycles from the current cycle to a predetermined cycle in the past. Over time, the bit pattern of the current cycle is replaced with a bit pattern consisting of all zero values, the bit pattern of the past predetermined cycle is discarded, and the bit pattern of the cycle other than the past predetermined cycle Is replaced with the bit pattern of the previous cycle, and the resulting bit pattern is obtained by ORing the bit pattern of the current cycle and the bit pattern calculated from the source information in bit units. By replacing the bit pattern of the current period and registering it, the bit pattern of all held periods and the calculated bit pattern are In contrast, when the bit having the same order as the 1-valued bit in the calculated bit pattern is all 1-valued in any of the bit patterns of all periods, the message is transferred to the user. As a result of the comparison, it is calculated from the source information included in the message that is controlled to transfer the message to the user by having all values of 1 in the bit pattern of the period other than the current period. Since the bit pattern of the current period is replaced with the bit pattern of the result obtained by ORing the bit pattern and the bit pattern of the current period held in bit units, the source information is a bit. A method registered by replacing with a pattern (source information is superimposed on one bit pattern and registered) ), The sender information cannot be deleted (the sender information once registered cannot be deleted even for the old registered sender information), but the bit pattern is past from the current cycle. Even if the source information has been registered once, the old registered source information is deleted by holding the predetermined period until the specified period and discarding the bit pattern of the past predetermined period as the period elapses. It is also possible to do.

  In addition, in the method of registering by replacing the sender information with a bit pattern, an erroneous determination (e-mail from a sender that the user originally does not permit e-mail transfer is erroneously transferred to the user). The probability of occurrence of (determination) is likely to increase as more source information is registered (the value of “1” registered in the bit pattern increases), but the bit pattern is retained on a period basis. By suppressing the value of “1” registered in the bit pattern, it is possible to reduce the probability of occurrence of erroneous determination.

  By the way, although the message transfer system which is a mail transfer system was demonstrated as Examples 1-3 until now, this invention is not restricted to this, The message transfer system which is an IP (Internet Protocol) telephone system is also included. The present invention can be similarly applied. Therefore, in the following, an embodiment in which the present invention is applied to a message transfer system that is an IP telephone system will be described as a fourth embodiment. Since the message transfer system (IP telephone system) according to the fourth embodiment is configured in substantially the same manner as the message transfer system (mail transfer system) according to the first embodiment, the message transfer system according to the first embodiment will be described below. The differences will be mainly described.

[Configuration of Message Transfer System According to Embodiment 4]
First, the configuration of the message transfer system according to the fourth embodiment will be described with reference to FIGS. 15 and 16. FIG. 15 is a block diagram illustrating the configuration of the message transfer system according to the fourth embodiment, and FIG. 16 is a diagram for explaining the bit pattern table of the data management server.

  First, the configuration of the message transfer system according to the fourth embodiment will be described with reference to FIG. 15. The message transfer system according to the fourth embodiment includes the IP phone terminal 620 of the user A and the IP phone terminal 720 of the user B. Are connected via the user A side IP network 640, the Internet 800 and the user B side IP network 740.

  The IP phone terminal 620 of user A and the IP phone terminal 720 of user B are generally used as IP phone terminals used when the user A 630 and the user B 730 make an IP phone connection via the Internet 800, respectively. And connected to the user A side IP network 640 and the user B side IP network 740 via the router R, respectively.

  In the message transfer system according to the fourth embodiment, an authorized caller registration server 520, a data management server 530, and an IP telephone connection control server 510 are provided, which are particularly closely related to the present invention. These permitted caller registration server 520, data management server 530, and IP telephone connection control server 510 are connected to a LAN 500 connected to the Internet 800 via a firewall FW. In the following, devices and units configured in the same manner as the message transfer system according to the first embodiment will be briefly described.

[Allowed caller registration server 520]
The permitted caller registration server 520 in the fourth embodiment is a server for registering caller information of a caller that permits the transfer of IP telephone control messages and the like, and is particularly closely related to the present invention. As with the permitted caller registration server 120 in the first embodiment, as shown in FIG. 15, an HTTP communication unit 521, a permitted caller registration processing unit 522, and a bit pattern calculation unit 523 are provided.

[Data management server 530]
The data management server 530 according to the fourth embodiment is a server that manages transmission source information (bit pattern) that allows a user to transfer a control message of an IP phone, and is particularly closely related to the present invention. Similar to the data management server 130 in the first embodiment, a bit pattern table 531 is provided as shown in FIG.

  Similarly to the first embodiment, the bit pattern table 531 holds a bit pattern of the number of bits m consisting of values of “0” and “1” and user information in association with each other. As shown in FIG. 4, a telephone number is stored in association with user information (address). In the fourth embodiment, the bit pattern table 531 has been described as a method in which a telephone number is associated and stored as user information. However, the present invention is not limited to this, and SIP URI ( The present invention can be similarly applied to a technique for associating and holding a Session Initiation Protocol Uniform Resource Identifier). In this case, the bit pattern table 531 holds, for example, a bit pattern and user information “sip: suzuki@isp-a.ne.jp” in association with each other.

[IP telephone connection control server 510]
The IP telephone connection control server 510 according to the fourth embodiment is a server that controls the transfer of IP telephone control messages and the like to the user. The mail filter server 110 according to the first embodiment is particularly relevant to the present invention. 15 includes a connection signal transmission / reception unit 511, a filter processing unit 512, a bit pattern calculation unit 513, and a bit pattern comparison unit 514, as shown in FIG. The connection signal transmission / reception unit 511 receives an IP telephone control message or the like from the caller, similar to the mail communication unit 111 in the first embodiment, and sends the IP telephone to the user's IP telephone terminal according to the processing in the filter processing unit 512. Send control messages and so on.

[Processing Procedure by Message Transfer System According to Embodiment 4]
Next, a processing procedure performed by the message transfer system according to the fourth embodiment will be described with reference to FIGS. FIG. 17 is a sequence diagram illustrating a processing procedure for registering source information in the message transfer system, and FIG. 18 is a sequence diagram illustrating a processing procedure for controlling message transfer based on the registered source information. FIG. 19 is a flowchart showing a processing procedure in the IP telephone connection control server.

[Process to register sender information in the message transfer system]
The process of registering the sender information in the message transfer system according to the fourth embodiment is substantially the same as the process of registering in the message transfer system according to the first embodiment (see FIG. 5), but the IP phone terminal of the user A The permitted address that can be input at 620 (step S1711) and the information that is added to the permitted address registration request transmitted from the IP phone terminal 620 of user A to the permitted caller registration server 520 are different (step S1712). ).

  More specifically, in the first embodiment, the user A terminal 220 accepts a mail address such as “matsui@isp-b.ne.jp” as a permitted address, and the permitted caller registration server from the user A terminal 220. For example, information such as the user ID “suzuki” and the permission address A “matsui@isp-b.ne.jp” is added to the permission address registration request transmitted to 120, but the message transfer system according to the fourth embodiment. Is an IP telephone system, the user A's IP telephone terminal 620 accepts a telephone number such as “050-1234-5678” as a permitted address, and the permitted telephone registration server 520 from the user A's IP telephone terminal 620. For example, information such as a user address “050-2345-6789” and a permission address A “050-1234-5678” is added to the permission address registration request transmitted to.

  Thereafter, as in the first embodiment, the message transfer system according to the fourth embodiment calculates the bit pattern H (A) of the permitted address A, acquires the bit pattern W corresponding to the user address from the bit pattern table 531, and The result bit pattern obtained by ORing the pattern W and the bit pattern H (A) is set as W ′, and the resulting bit pattern W ′ is registered in the bit pattern table 531 as a bit pattern corresponding to the user address, For example, a permitted address registration response is returned to the IP telephone terminal 620 of the user A (step S1713 to step S1717), and the process is terminated.

[Process to control message forwarding based on registered sender information]
In the following, as shown in FIG. 18, the message transfer system according to the fourth embodiment is an IP phone control message for the user A's IP phone terminal 620 (user A 630), and the user B's IP phone terminal. The case where the control message transmitted from 720 (user B 730) is transferred to the IP phone terminal 620 of user A via the IP phone connection control server 510 is illustrated.

  First, the IP phone terminal 720 of the user B receives the IP phone connection request from the user B 730 and transmits a connection request (INVITE request message by SIP) to the IP phone connection control server 510 (step S1811). . For example, the IP phone terminal 720 of the user B receives an input of the phone number (called number) “050-2345-6789” of the IP phone terminal 620 of the user A, and an INVITE request generated from the input phone number The message is transmitted to IP telephone connection control server 510.

  Next, when receiving a connection request (INVITE request message) from the IP phone terminal 720 of the user B, the IP phone connection control server 510 performs a filtering process (connection possibility determination) (step S1812).

  Subsequently, if the result of the filtering process (connection permission determination) is “transferable”, the IP phone connection control server 510 transfers a connection request (INVITE request message) to the IP phone terminal 620 of the user A (step S1813).

  Thereafter, IP phone terminal 620 of user A transmits a connection response (for example, response code “200 OK”) to IP phone connection control server 510 in response to the transferred connection request (INVITE request message). (Step S1814) The IP telephone connection control server 510 transfers the received connection response (for example, response code “200 OK” or the like) to the IP telephone terminal 720 of the user B (Step S1815). The transfer control of the IP telephone control message by the message transfer system according to 4 ends.

  If the result of the filtering process (connection possibility determination) in step S 1812 is “transfer impossible”, the IP telephone connection control server 510 sends a connection rejection response (for example, response code “403” to the IP telephone terminal 720 of user B). Forbidden "etc.) is transmitted, and the process is terminated.

[Process in IP phone connection control server]
The processing in the IP telephone connection control server 510 in the fourth embodiment is almost the same as the processing in the mail filter server 110 in the first embodiment (see FIG. 7), but the sender address to be processed is different (step S1911). ). That is, in Example 1, the sender address (A) from which the bit pattern H (A) is calculated is information such as “matsui@isp-b.ne.jp”. Since the message transfer system is an IP telephone system, the sender address (A) is information such as “050-1234-5678”, for example.

  After that, the IP telephone connection control server 510 in the fourth embodiment calculates the bit pattern H (A) of the caller address (A) and corresponds to the user address (R), like the mail filter server 110 in the first embodiment. The bit pattern W is acquired from the bit pattern 531, and it is determined whether or not all the bits having the same rank as the bit having the value “1” in the bit pattern H (A) have the value “1” in the bit pattern W. Then, for example, it is determined whether transfer is possible (steps S1912 to S1914), and the process is terminated.

  In this way, the message transfer system according to the fourth embodiment, as in the first embodiment, does not increase the storage area used for registration of source information and determines whether message transfer is permitted or not in the message transfer system. In this case, the efficiency of searching for the sender information is not lowered, and as a result, the number of registered sender information cannot be restricted.

[Effect of Example 4]
As described above, according to the fourth embodiment, as in the first embodiment, the message transfer system controls the transfer of the message to the user based on the source information included in the message. A bit pattern of a predetermined number of bits consisting of a value and user information are stored in association with each other, and a bit pattern of a predetermined number of bits from a source information of a source that allows the user to transfer a message The bit pattern obtained by performing OR operation on the bit pattern and the calculated bit pattern in units of bits is registered by replacing the held bit pattern and a message to the user When received, the bit pattern of a predetermined number of bits is calculated from the source information included in the message using a predetermined function, The bit pattern held is compared with the calculated bit pattern on a bit-by-bit basis, and when the calculated bit pattern has all the values of 1 in the bit pattern in which the bits having the same rank as the bits of 1 value are held Since the message is controlled to be transferred to the user, the message transfer system does not increase the storage area used for registration of the source information, and the source information is used when determining whether the message transfer is permitted or not. Thus, it is possible to prevent the number of registered sender information from being limited.

  That is, according to the message transfer system according to the fourth embodiment, similar to the first embodiment, the transmission source information is registered by being replaced with a bit pattern having a predetermined number of bits (the transmission source information is included in one bit pattern). Therefore, the storage area used for registering the source information is not increased in proportion to the number of registered source information. Further, since the storage area used for registration of the sender information is not increased, the storage area for searching the sender information is not increased when determining whether or not the message transfer is permitted. Does not decrease. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered sender information is not limited.

  By the way, in Example 4 so far, as a method of registering the caller information in the message transfer system, the user's IP (Internet Protocol) telephone terminal transmits a permitted address registration request to the permitted caller registration server, thereby making a call. Although the method of starting the process of registering the original information in the message transfer system has been described, the present invention is not limited to this, and the IP telephone connection control server that has received the caller information not registered in the message transfer system However, the present invention is also applied to a method (consent-based method) in which processing for confirming consent to register sender information to a user and registration of sender information is started upon consent. The same can be applied. Therefore, in the following, a consent-based method will be described as a fifth embodiment. Since the message transfer system according to the fifth embodiment is configured in substantially the same manner as the message transfer system according to the fourth embodiment, the following description will mainly focus on differences from the message transfer system according to the fourth embodiment.

[IP telephone connection control server 510]
First, the IP telephone connection control server 510 according to the fifth embodiment will be described with reference to FIGS. FIG. 20 is a block diagram showing the configuration of the IP telephone connection control server, and FIG. 21 is a diagram for explaining the consent confirmation transmission destination holding unit.

  The IP telephone connection control server 510 according to the fifth embodiment is a server that controls the transfer of the IP telephone connection control message to the user as in the fourth embodiment. Particularly, the IP telephone connection control server 510 according to the fifth embodiment is closely related to the present invention. Similar to the fourth example, in addition to the connection signal transmission / reception unit 511, the filter processing unit 512, the bit pattern calculation unit 513, and the bit pattern comparison unit 514, unlike the fourth example, the consent confirmation transmission destination holding unit 515 , An agreement confirmation transmission unit 516 and an agreement notification reception unit 517. The consent confirmation transmission destination holding unit 515 corresponds to the “consent confirmation transmission destination holding unit” described in the claims, and the consent confirmation transmission unit 516 is the “consent confirmation transmission unit” described in the claims. The consent notification receiving unit 517 corresponds to “consent notification receiving means” described in the claims.

  The consent confirmation transmission destination holding unit 515 holds the transmission destination of the consent confirmation message and user information in association with each other. Specifically, the consent confirmation transmission destination holding unit 515 uses the transmission destination of the consent confirmation message (e.g., mail) for confirming the user's consent to register the sender information in the bit pattern table 531, and the usage User information for identifying a user is stored in association with each other. For example, the consent confirmation transmission destination holding unit 515, as shown in FIG. 21, a mail address such as “aaa@nnn.co.jp” as the transmission destination (consent control communication address) of the consent confirmation message, and user information A telephone number such as “050-2345-6789” is stored in association with (destination communication address).

  The consent confirmation transmission unit 516 transmits the consent confirmation message to the transmission destination held by the consent confirmation transmission destination holding unit 515 together with the transmission source information and the user information. Specifically, the consent confirmation transmission unit 516, when the result of the determination in the filter processing unit 512 is “non-transferable”, sends the consent confirmation message to the transmission source information (such as the telephone number of the transmission source) and the user. It is sent to the destination together with information (user phone number, etc.).

  For example, the consent confirmation transmitting unit 516 includes user information (such as a user's telephone number) included in the To header of a connection request (INVITE request message) by SIP (Session Initiation Protocol) and source information ( The sender's telephone number and the like are acquired, and the sender information and user information are encoded and included in an HTTP URL (HyperText Transfer Protocol Uniform Resource Locator) in the mail text. By doing in this way, the user who is the destination of the consent confirmation message is connected to the consent notification receiving unit 517 (to be described later) by clicking on the HTTP URL in the mail body, and can transmit consent as an HTTP request. It becomes.

  In the fifth embodiment, the technique of including the sender information and the user information in the mail body of the consent confirmation message has been described. However, the present invention is not limited to this, and for example, sending the consent confirmation message. Any of the methods including the sender information and the user information in the original address or the like may be used.

  The consent notification receiving unit 517 receives the consent notification together with the sender information and user information. Specifically, the consent notification receiving unit 517 transmits the consent notification notified from the user as a response to the consent confirmation message transmitted by the consent confirmation transmitting unit 516, from the sender information (such as the telephone number of the sender). And user information (user phone number, etc.).

  As described above, the consent confirmation transmission unit 516 includes the transmission source information and the user information in the consent confirmation message, and the consent notification reception unit 517 receives the consent notification together with the transmission source information and the user information. Since the user information is reproduced, the IP telephone connection control server 510 does not need to manage the status of the connection request during confirmation of consent. Note that specific processing by the above-described consent confirmation transmission destination holding unit 515, consent confirmation transmission unit 516, and consent notification reception unit 517 will be described in detail in the following description of the processing.

[Process to register sender information in the message transfer system]
Next, a process for registering source information in the message transfer system will be described with reference to FIG. FIG. 22 is a sequence diagram showing a procedure of processing for registering source information in the message transfer system.

  In the fifth embodiment, the processing for registering the sender information in the message transfer system is different from the fourth embodiment in that the IP telephone connection control server 510 that has received the sender information not registered in the message transfer system sends the user A The consent for registering the sender information is confirmed, and the consent by the user A is started.

  First, the IP phone terminal 720 of the user B receives the IP phone connection request from the user B 730 as in the fourth embodiment, and transmits a connection request to the IP phone connection control server 510 (step S2211). Subsequently, as in the fourth embodiment, when receiving a connection request from the IP phone terminal 720 of the user B, the IP phone connection control server 510 performs a filtering process (connection possibility determination) (step S2212).

  Here, the IP telephone connection control server 510 according to the fifth embodiment simply sends to the IP telephone terminal 720 of the user B as in the fourth embodiment when the result of the filtering process (connection possibility determination) is “transfer impossible”. Instead of transmitting a connection rejection response, an agreement confirmation confirmation notification is transmitted to the IP phone terminal 720 of the user B (step S2213).

  In addition, IP phone connection control server 510 transmits consent confirmation message together with sender information (such as the telephone number of the sender) and user information (such as the telephone number of the user) in consent confirmation transmitting unit 516. It transmits to the transmission destination acquired from the destination holding unit 515 (step S2214). For example, the IP telephone connection control server 510 encodes the sender information “050-1234-5678” and the user information “050-2345-6789” in the HTTP URL in the mail body in the consent confirmation transmission unit 516. Send included emails to "aaa@nnn.co.jp".

  Then, the user A terminal 621 that is the destination of the consent confirmation message accepts the consent response to the transmitted consent confirmation message by clicking on the HTTP URL in the mail body by the user A, and the like. Is transmitted to the IP telephone connection control server 510, the IP telephone connection control server 510 receives the consent notification together with the sender information and the user information at the consent notification receiving unit 517 (step S2215). For example, the IP telephone connection control server 510 receives the consent notice together with the source information “050-1234-5678” and the user information “050-2345-6789” at the consent notice receiving unit 517.

  Subsequently, the IP telephone connection control server 510 transmits the sender information and user information received by the consent notification receiver 517 to the permitted caller registration server 520 as a permitted address registration request (step S2216). The permitted caller registration server 520 registers the caller information in the permitted caller registration processing unit 522, the bit pattern calculation unit 523, and the like (step S2217).

  Specifically, the permitted caller registration server 520 calculates the bit pattern from the caller information in the permitted caller registration processing unit 522, the bit pattern calculation unit 523, and the like, and the bit pattern stored in the bit pattern table 531 The bit pattern stored in the bit pattern table 531 corresponding to the user information is replaced and registered by the bit pattern obtained by performing an OR operation on the calculated bit pattern in bit units.

  Thereafter, the permitted caller registration server 520 returns a permitted address registration response to the user A terminal 621 (step S2218), and the process ends.

  In this way, the message transfer system according to the fifth embodiment can also register source information based on consent confirmation for registering unregistered source information in an IP telephone system, for example. become.

  In the fifth embodiment, the IP telephone connection control server that has received the sender information that is not registered in the message transfer system confirms the user's consent to register the sender information, and gives the consent. Although the case where the method of starting the process of registering the sender information at an opportunity (consent-based method) is applied to a message transfer system that is an IP telephone system, the present invention is not limited to this. The consent-based method can be similarly applied to a message transfer system that is a mail transfer system (message transfer systems according to the first to third embodiments).

  For example, the mail filter server does not send the consent confirmation message to the transmission destination of the consent confirmation message separately associated with the user information, but simply receives the electronic mail received from the sender by the mail filter server. A method of transferring the consent confirmation message to the original transfer destination of the mail may be used. In this case, only the sender information is reproduced when the consent confirmation sending part of the mail filter server includes only the sender information in the consent confirmation message, and the consent notice receiving part receives the consent notice together with only the sender information. However, since the mail filter server can recognize the user information of the user who sent the consent notification (the sender of the consent notification is the original transfer destination of the e-mail), There is no need to manage the status of connection requests during consent confirmation.

[Effect of Example 5]
As described above, according to the fifth embodiment, the transmission destination of the consent confirmation message for confirming the consent to register the sender information and the user information are held in association with each other, and the comparison result is obtained. If any bit in the same order as the 1-valued bit in the bit pattern calculated from the source information does not become 1 in the retained bit pattern, an agreement confirmation message is sent to the source information. To the destination stored with the user information, and the consent notification notified from the user as a response to the consent to the transmitted consent confirmation message is received together with the sender information and the user information, and received together with the consent notification. The bit pattern is calculated from the source information using a predetermined function, and the stored bit pattern and the calculated bit pattern are calculated in bit units. Since the bit pattern associated with the user information is replaced and registered by the bit pattern of the result obtained by OR operation, for example, unregistered source information is registered in the IP telephone system. On the other hand, the sender information can be registered based on the consent confirmation.

  Also, by including the sender information and user information in the consent confirmation message, and receiving the consent notification together with the sender information and user information, the sender information and user information are reproduced. As a result, it becomes unnecessary to manage the connection status during confirmation of consent, so that an area for storing the status during confirmation of consent becomes unnecessary, and the storage area can be prevented from increasing.

  By the way, although the message transfer system for controlling the transfer of a message having a normal message address as the destination has been described as the first to fifth embodiments, the present invention is not limited to this, and is used for identifying a user. The present invention can be similarly applied to a message transfer system that controls transfer of a message whose destination is a message address including user information and a keyword (hereinafter referred to as a keyword address). Therefore, in the following, as an embodiment 6, an embodiment in which the present invention is applied to a message transfer system that controls transfer of a message having a keyword address as a destination will be described. In the following, a general mechanism of message transfer having a keyword address as a destination, characteristics of the message transfer system according to the sixth embodiment, a configuration of the message transfer system according to the sixth embodiment, and a message transfer system according to the sixth embodiment. Processing procedures and effects of the sixth embodiment will be described in order.

[Message forwarding mechanism with keyword address as destination]
First, a general mechanism of message transfer with a keyword address as a destination will be described with reference to FIG. FIG. 23 is a diagram for explaining a mechanism of message transfer with a keyword address as a destination. In the following, description will be given focusing on two stages: a stage in which a disclosed word is registered in the message transfer system, and a stage in which the message transfer system controls message transfer based on the registered valid word or disclosure word. FIG. 23A shows a stage of registering a disclosure word in a message transfer system, and FIG. 23B controls message transfer based on a valid word or disclosure word registered in the message transfer system. It is a stage.

  As shown in FIG. 23, an e-mail message transfer system with a keyword address as a destination controls the transfer of e-mails with a keyword address including user information and a keyword as a destination. For example, as shown in FIG. 23, the message transfer system uses an e-mail addressed to a keyword address “suzuki.web060620@kwmail.ne.jp” including “suzuki” as user information and “web060620” as a keyword. Control the transfer.

  Here, considering why the message transfer system controls the transfer of e-mails using keyword addresses instead of real addresses (actual mail addresses held by users), the user sets the real address to the communication partner. This is because there is a case where it is not desired to disclose. For example, if the communication partner is a mail order dealer on the Internet, and the user unnecessarily discloses the real address, the real address is spread to other vendors through a mailing list, etc. There may be situations where mail must be received. Therefore, the e-mail message transfer system destined for the keyword address controls e-mail transfer without disclosing the real address, as will be described below.

  In such a message transfer system, as shown in FIG. 23A, the valid word holding unit holds user information and one or more valid words in association with each other. For example, the message transfer system holds “suzuki” as user information and “web, ml, hiroba, it” as one or more valid words in association with each other. Here, the valid word is included in the keyword as a part of the keyword in order for the message transfer system to determine whether or not the keyword address is valid. In other words, a keyword address including a keyword including a valid word is considered to be a valid keyword address in principle (except when the valid word is locked due to leakage). Such a valid word is, for example, registered in advance by the user when the message transfer system is used, and held in the valid word holding unit.

  As shown in FIG. 23A, the message transfer system holds the user information and one or more disclosure words in association with each other in the disclosure word holding unit. For example, the message transfer system holds “suzuki” as user information and “book 305” as one or more disclosure words in association with each other. Here, the disclosed word is a keyword in use including a valid word that has been leaked. That is, the message transfer system must lock a valid word when a valid word is leaked (it is impossible to generate a new keyword including a leaked valid word, and the leaked valid word is regarded as a valid word). Even if it is a keyword that includes a leaked valid word, the disclosed word that is a keyword that has already been disclosed to the communication partner is also locked when the valid word is locked. Treated as a valid keyword. Such a disclosure word is forwarded when the email addressed to the keyword address is received in the message transfer system, and when any of the valid words partially matches the keyword, It is registered as a disclosure word and held in the disclosure word holding unit.

  Next, the step of registering the disclosure word in the message transfer system will be specifically described. As shown in FIG. 23A, the message transfer system receives an e-mail addressed to the keyword address (FIG. 23). Among the valid words held by the valid word holding unit, each of one or more valid words corresponding to the user information contained in the keyword address is included in the keyword address. Compare with the keyword (see (2) in FIG. 23A). For example, when the message transfer system receives an email addressed to the keyword address “suzuki.web060620@kwmail.ne.jp”, the valid word (web, ml, hiroba, it) corresponding to the user information “suzuki” is received. Compare each of these with the keyword “web060620”.

  If any of the valid words partially matches the keyword, the message transfer system registers the keyword as a disclosed word in the disclosed word holding unit (see (3) in FIG. 23A). For example, since the valid word “web” partially matches the keyword “web060620”, the message transfer system registers the keyword “web060620” as a disclosure word in the disclosure word holding unit. Then, the disclosed word holding unit holds “web060620” in addition to “book305”.

  Next, a description will be given of a stage in which the message transfer system controls message transfer based on a registered valid word or disclosed word. First, as shown in FIG. “Ml, hiroba, it” is associated and retained as the above valid words, and “Web” is not retained. That is, in the following, it is assumed that the valid word “web” is locked (deleted from the valid word).

  When the message transfer system receives an e-mail addressed to the keyword address, each of the one or more valid words corresponding to the user information extracted from the keyword address among the valid words held in the valid word holding unit. Is compared with the keyword extracted from the keyword address to determine whether any of the valid words partially matches the keyword, and if it partially matches, it is determined that the e-mail can be transferred.

  Further, when the message transfer system receives an e-mail addressed to the message address including the keyword, one or more corresponding to the user information extracted from the keyword address among the disclosure words held in the disclosure word holding unit Each of the disclosed words is compared with the keyword, and it is determined whether or not any of the disclosed words completely matches the keyword.

  For example, when a message address “suzuki.hiroba2006@kwmail.ne.jp” including user information “suzuki” and a keyword “hiroba2006” is received as shown in (1) -1 of FIG. The message transfer system compares each of the disclosure words (book305, web060620) held in the disclosure word holding unit with the keyword “hiroba2006” and determines whether any of the disclosure words completely matches the keyword. None of the disclosure words match exactly. In addition, the message transfer system includes one or more valid words (ml, hiroba, it) corresponding to the user information (suzuki) extracted from the keyword address among the valid words held in the valid word holding unit. Is compared with the keyword “hiroba2006” to determine whether any of the valid words partially matches the keyword. Then, since the valid word “hiroba” partially matches the keyword “hiroba2006”, the message forwarding system determines that an email addressed to the keyword address “suzuki.hiroba2006@kwmail.ne.jp” can be forwarded. .

  Also, for example, as shown in (1) -2 of FIG. 23B, the keyword address “suzuki.web060620@kwmail.ne.jp” including the user information “suzuki” and the keyword “web060620” is received. Then, the message transfer system compares each of the disclosure words (book305, web060620) held in the disclosure word holding unit with the keyword “web060620” to determine whether any of the disclosure words completely matches the keyword. To do. Then, since the disclosure word “web060620” completely matches the keyword “web060620”, the message transfer system determines that the e-mail addressed to the keyword address “suzuki.web060620@kwmail.ne.jp” can be transferred.

  Also, for example, as shown in (1) -3 of FIG. 23B, the keyword address “suzuki.book555@kwmail.ne.jp” including the user information “suzuki” and the keyword “book555” is received. Then, the message transfer system compares each of the disclosed words (book305, web060620) held in the disclosed word holding unit with the keyword “book555” and determines whether any of the disclosed words completely matches the keyword. However, none of the disclosure words match exactly. In addition, the message transfer system compares each of one or more valid words (ml, hiroba, it) with the keyword “book555” to determine whether any of the valid words partially matches the keyword. But none of the valid words match. For this reason, the message transfer system determines that the electronic mail cannot be transferred.

[Features of Message Transfer System According to Embodiment 6]
By the way, in the message transfer mechanism described above, in the message transfer system, the storage area used for registering the keyword (disclosure word) increases, and the keyword (disclosure word) is searched when determining whether the message transfer is permitted or not. Efficiency, and consequently, there is a problem that the number of registered keywords (disclosure words) must be limited.

  That is, in the above method of registering the keyword itself as a disclosure word, the storage area used for registration of the disclosure word increases in proportion to the number of disclosure words registered. Further, when the storage area used for registering the disclosure word increases, the storage area for searching for the disclosure word increases when determining whether to permit message transfer, so that the efficiency of searching for the disclosure word decreases. As a result, in order to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, the number of registered disclosure words must be limited.

  Therefore, in order to solve such a problem, the message transfer system according to the sixth embodiment does not increase a storage area used for registering a keyword (disclosure word) and determines whether to permit message transfer. The main feature is that the efficiency of searching for a keyword (disclosure word) is not lowered and the number of registered keywords (disclosure word) is not limited.

  This main feature will be briefly described with reference to FIG. FIG. 24 is a diagram for explaining the characteristics of the message transfer system according to the sixth embodiment. As in the bit pattern table in the first embodiment, the message transfer system according to the sixth embodiment has a disclosure word holding unit (corresponding to the “bit pattern holding unit” recited in the claims) as shown in FIG. , A bit pattern of a certain number of bits composed of values of “0” and “1” and user information for identifying the user are stored in association with each other. For example, as shown in FIG. 24A, the bit pattern “010000010011...” And user information “suzuki” are stored in association with each other.

  Here, the bit pattern associated with the user information “suzuki” will be briefly described. The message transfer system according to the sixth embodiment receives an e-mail addressed to a keyword address in the message transfer system and receives a valid word. When any of the above partially matches the keyword, this keyword is registered as a disclosure word. That is, in the sixth embodiment, the bit pattern in a state where no disclosure word is registered (initial state) is “000000000000 ...”, and therefore, the bit pattern “01000100011... Shown in FIG. "Represents a state in which one or more disclosure words are registered. A specific method for registering the disclosure word will be described in detail later.

  In FIG. 24, the state in which one or more disclosure words are registered has been described. However, the present invention is not limited to this, and no disclosure word is registered (initial state). In the present invention, the present invention can be similarly applied. In FIG. 24, for convenience of explanation, the disclosed word holding unit shows only the bit pattern associated with the user information “suzuki”. However, in actuality, the disclosed word holding unit For one or more users who use the transfer system, a bit pattern associated with each user information is held.

  With such a configuration, the message transfer system according to the sixth embodiment controls the transfer of an e-mail addressed to a keyword address. In the following, a step of registering a disclosure word in the message transfer system; A description will be given focusing on two stages, that is, a stage in which the message transfer system controls message transfer based on a registered disclosure word. FIG. 24A is a stage in which a disclosure word is registered in the message transfer system, and FIG. 24B is a stage in which the message transfer system controls message transfer based on the registered disclosure word. .

  First, the stage of registering the disclosure word in the message transfer system will be described. As shown in FIG. 24A, the message transfer system according to the sixth embodiment receives a message addressed to the keyword address (FIG. 24). Among the valid words held by the valid word holding unit, each of one or more valid words corresponding to the user information contained in the keyword address is included in the keyword address. Compare with the keyword (see (2) in FIG. 24A).

  If any of the valid words partially matches the keyword, a bit pattern of a certain number of bits from the keyword is calculated by a function (see (3) in (A) of FIG. 24). Next, the message transfer system performs an OR operation on the bit pattern held by the disclosed word holding unit and the calculated bit pattern in units of bits (see (4) in FIG. 24A). Then, the message transfer system replaces and registers the bit pattern held by the disclosed word holding unit with the bit pattern obtained by the OR operation (see (5) in FIG. 24A). .

  Next, the stage in which the message transfer system controls message transfer based on the registered disclosure word will be described. As shown in FIG. 24B, the message transfer system according to the sixth embodiment uses a keyword address. When an e-mail address is received (see (1) in FIG. 24B), a bit pattern of a certain number of bits is calculated from a keyword included in the message using a certain function ((B in FIG. 24). (See (2) of)). Note that the number of bits and the function must be the same as the number of bits and the function described in (3) of FIG.

  Then, the message transfer system compares the bit pattern held by the disclosed word holding unit with the calculated bit pattern in units of bits (see (3) in (B) of FIG. 24). Then, when all the bits having the same rank as the value of “1” in the calculated bit pattern are values of “1” in the bit pattern held by the disclosed word holding unit, the message transfer system Control is performed to forward the received electronic mail to the user (see (4) of FIG. 25B).

  As described above, the message transfer system according to the sixth embodiment has a small burden of managing the message address for the user, and when the message address is leaked, it is easy to specify the leak source and only the leaked message address is stored. In a message system that can be easily invalidated, the storage area used for registering the keyword (disclosure word) included in the message address is not increased, and the keyword (disclosure) is determined when determining whether message transfer is permitted or not. It is possible not to reduce the efficiency of searching for (words) and to limit the number of registered keywords (disclosure words).

  In the sixth embodiment, the message transfer system compares the disclosed word held in the disclosed word holding unit with the keyword, and then compares the valid word held in the valid word holding unit with the keyword. The procedure will be described, but the present invention is not limited to this. The effective word held in the effective word holding unit is compared with the keyword, and then the disclosed word and keyword held in the disclosed word holding unit are compared. Judgment that e-mail can be transferred if any of the disclosed words matches the keyword, such as the processing procedure to be compared, and e-mail is determined to be transferable if any of the valid words partially matches the keyword If necessary, any processing procedure may be used.

  In the sixth embodiment, a mail transfer system for transferring electronic mail will be described as a message transfer system. However, the present invention is not limited to this, and control messages for IP (Internet Protocol) telephones, instant messages, The present invention can be similarly applied to a system for transferring a SIP (Session Initiation Protocol) message such as a presence exchange message.

[Configuration of Message Transfer System According to Embodiment 6]
Next, the configuration of the message transfer system according to the sixth embodiment will be described with reference to FIGS. FIG. 25 is a block diagram illustrating the configuration of the message transfer system according to the sixth embodiment, FIG. 26 is a diagram for explaining the real address table, and FIG. 27 is a diagram for explaining the valid word table. FIG. 28 is a diagram for explaining the disclosed word table.

  First, the configuration of the message transfer system according to the sixth embodiment will be described with reference to FIG. 25. The message transfer system according to the sixth embodiment is similar to the first embodiment in that the user A terminal 220, the user B terminal 320, Are connected via the user A side IP network 240, the Internet 400, and the user B side IP network 340.

  The user A terminal 220 and the user B terminal 320 are terminal devices that are used when the user A 230 and the user B 330 exchange e-mails over the Internet 400, respectively, as in the first embodiment, and are generally spread. Web browser software and electronic mail software are installed in a personal computer (PC) connected to the user A side IP network 240 and the user B side IP network 340 via the router R, respectively. The user A side IP network 240 and the user B side IP network 340 are each connected to the Internet 400 via the router R as in the first embodiment.

  The user A mail server 140 and the user B mail server 310 are so-called existing mail servers as in the first embodiment. In the sixth embodiment, for convenience of explanation, a case in which only two terminal devices and a mail server are configured will be described. However, the present invention is not limited to this, and many terminal devices and many The present invention can be similarly applied to a case where the mail server is configured.

  In addition, in the message transfer system according to the sixth embodiment, a word registration server 920, a data management server 930, and a mail filter server 910 are provided as particularly closely related to the present invention. These word registration server 920, data management server 930, and mail filter server 910 are connected to a LAN 900 connected to the Internet 400 via a firewall FW. Hereinafter, the word registration server 920, the data management server 930, and the mail filter server 910 will be described.

[Word registration server 920]
The word registration server 920 in the sixth embodiment is a server that registers a valid word or a disclosed word or locks a valid word. Particularly, as closely related to the present invention, as shown in FIG. Unit 921, a valid word registration processing unit 922, a valid word lock processing unit 923, and a disclosed word registration processing unit 924. The word registration server 920 can be realized by installing a program corresponding to these units in a commercially available personal computer (PC) or workstation (WS). The disclosed word registration processing unit 924 corresponds to the “bit pattern registration unit” recited in the claims.

  The HTTP communication unit 921 includes a general library for HTTP (HyperText Transfer Protocol) communication, and performs communication using HTTP with other communication devices. The valid word registration processing unit 922 receives valid word registration transmitted from the user A terminal 220 or the like via a Web browser, and registers the valid word in a valid word table 932 of the data management server 930 described later. Specifically, the valid word registration processing unit 922 receives a user ID (user information) and a valid word from the user A terminal 220 or the like and registers them in the valid word table 932. The valid word lock processing unit 923 receives a valid word lock request transmitted from the user A terminal 220 or the like via a Web browser, and locks the valid word in the valid word table 932. Specifically, the valid word lock processing unit 923 receives a user ID (user information) and a lock target word from the user A terminal 220 and the like, and from the valid word table 932 corresponding to the user ID, the lock target word. delete.

  The disclosed word registration processing unit 924 registers the disclosed word in a disclosed word table 933 of the data management server 930 described later. Specifically, the disclosed word registration processing unit 924 determines that any of the valid words held in the valid word table 932 partially matches the keyword at the keyword address in the filter processing unit 912 of the mail filter server 910 described later. If it is determined, first, a bit pattern of a certain number of bits is calculated from this keyword by a certain function.

  For example, the disclosed word registration processing unit 924 calculates a bit pattern of a certain number of bits from the acquired keyword using a certain function, like the bit pattern calculation unit 123 in the first embodiment. Here, the calculation method of the disclosed word registration processing unit 924 will be specifically described. The disclosed word registration processing unit 924 in the sixth embodiment is calculated by applying a Bloom filter in the same manner as the bit pattern calculation unit 123 in the first embodiment. Therefore, first, a plurality of positive integer values are derived for each hash function from the keyword using a plurality of hash functions for deriving a positive integer value equal to or less than a certain number of bits (m). Next, the disclosed word registration processing unit 924 calculates a bit pattern from the keyword by performing an OR operation on the generated bit patterns in units of bits.

  In the sixth embodiment, the disclosure word registration processing unit 924 has described the method of calculating the bit pattern from the keyword using the function as described above. However, the present invention is not limited to this, and a simple hash is used. The present invention is similarly applied to a method of calculating a bit pattern from a keyword using a function, a method of converting a keyword into a bit pattern by another algorithm, cutting out the number of bits m, and a method using other functions. be able to. In the method of calculating simply using a hash function, for example, when the disclosed word registration processing unit 924 acquires “web060620” (A) as a keyword, it uses a hash function h () that derives a bit pattern of m bits. For example, a bit pattern H (A) having a bit number m is calculated. Further, in the method of cutting out only the number of bits m, for example, the number of bits m is cut out from a bit pattern in which “web060620” is expressed by the values “0” and “1”.

  Next, the disclosed word registration processing unit 924 performs the disclosed word table 933 based on the bit pattern obtained by ORing the bit pattern held in the disclosed word table 933 and the calculated bit pattern in units of bits. The bit pattern held by is replaced and registered.

  For example, the disclosed word registration processing unit 924 performs an OR operation on the bit pattern “01000110111...” Held by the disclosed word table 933 and the calculated bit pattern “0101111010000. "0101111011 ..." is obtained. Next, the disclosed word registration processing unit 924 replaces the bit pattern held in the disclosed word table 933 with the bit pattern “01011101111...” Obtained as a result.

[Data management server 930]
The data management server 930 in the sixth embodiment is a server that manages an actual mail address (real address), a valid word, and a disclosure word held by a user. Particularly, the data management server 930 is closely related to the present invention. An address table 931, a valid word table 932, and a disclosed word table 933 are provided. The data management server 930 can be realized by installing a program such as an RDBMS (Relational DataBase Management System) on a commercially available personal computer (PC) or workstation (WS). The valid word table 932 corresponds to “valid word holding means” recited in the claims, and the disclosed word table 933 corresponds to “bit pattern holding means” recited in the claims.

  The real address table 931 holds user information for identifying a user and an actual mail address (real address) held by the user in association with each other. Specifically, the real address stored in the real address table 931 is stored in the filter processing unit 912 when the filter processing unit 912 of the mail filter server 910 described later is controlled to transfer an e-mail to the user. Acquired and used for e-mail transfer control by the filter processing unit 912. For example, as shown in FIG. 26, the real address table 931 stores a user ID (user information) “suzuki” and a real address “suzuki1010@anywhere.ne.jp” in association with each other, and the real address “suzuki1010”. @ anywhere.ne.jp ”is acquired by the filter processing unit 912 when the filter processing unit 912 is controlled to transfer the e-mail to the user“ suzuki ”. The forwarding of the e-mail is controlled to forward to the address “suzuki1010@anywhere.ne.jp”.

  The valid word table 932 holds user information and one or more valid words in association with each other. Specifically, the valid words held in the valid word table 932 are registered as valid words by the valid word registration processing unit 922, or the lock target words are deleted by the valid word lock processing unit 923. The valid word is used for e-mail transfer control by the filter processing unit 912, which will be described later. For example, as shown in FIG. 27, the valid word table 932 holds a user ID (user information) “suzuki” and a valid word “web, ml, hiroba, it” in association with each other.

  The disclosed word table 933 holds the bit pattern of the number of bits m composed of the values “0” and “1” and the user information in association with each other. Specifically, the disclosed word table 933 transmits a bit pattern to be held to the disclosed word registration processing unit 924, or the bit pattern to be held is replaced by the disclosed word registration processing unit 924. The bit pattern held in the disclosed word table 933 is used by the bit pattern comparison unit 914 of the mail filter server 910 described later.

  For example, as shown in FIG. 28, the disclosed word table 933 holds a bit pattern and a user ID (user information) in association with each other, like the bit pattern table 131 in the first embodiment. In FIG. 28, a bit pattern “0x5g9341ab...” Is shown, but in actuality, it is processed as a bit pattern of the number of bits m consisting of values “0” and “1”.

  Further, for example, the disclosed word table 933 is a bit pattern that is stored in association with the user information “suzuki” when the registered word is registered in the word registration server 920. Is transmitted to the word registration server 920. Further, for example, when the disclosed word table 933 receives a bit pattern such as “0101110111011...” From the word registration server 920 as a new bit pattern to be stored in association with the user information “suzuki”, for example, “010001000111”. ... ”Is replaced with“ 0101111011.

  By the way, at the start of operation of the message transfer system according to the sixth embodiment, the bit pattern held in the disclosed word table 933 is considered to be in a state (initial state) in which no disclosed word is registered. What bit pattern should be held in association with user information as an initial state differs depending on the operation form, but the most typical method is “000000000000 ...” as in the first embodiment. A method of holding a bit pattern in which all bits have a value of “0” is conceivable. In this way, the disclosed word table 933 holds bit patterns that are all “0” values in the initial state in association with user information, and each time a disclosed word is registered, the value of “0” is “1”. It will be replaced with the value of "."

  As in the first embodiment, theoretically, all bits are eventually replaced with a value of “1”, and a bit pattern in which all bits have a value of “1” such as “111111111111. However, as in the first embodiment, setting the number of bits m according to the operation mode avoids a state in which all bits have a bit pattern having a value of “1”.

[Mail Filter Server 910]
The mail filter server 910 according to the sixth embodiment is a server that controls the transfer of e-mail to the user. Particularly, as closely related to the present invention, as shown in FIG. 25, a mail communication unit 911, a filter, A processing unit 912, a bit pattern calculation unit 913, and a bit pattern comparison unit 914 are provided. The mail filter server 910 can be realized by installing a program corresponding to these units in a commercially available personal computer (PC) or workstation (WS). The bit pattern calculation unit 913 corresponds to the “bit pattern calculation unit” described in the claims, and the filter processing unit 912 and the bit pattern comparison unit 914 include the “message transfer control unit” described in the claims. ".

  Similarly to the mail communication unit 111 in the first embodiment, the mail communication unit 911 receives an e-mail from the mail server of the transmission source, and transmits the e-mail to the user's mail server according to the process in the filter processing unit 912. .

  The filter processing unit 912 controls the transfer of e-mail to the user. Specifically, when activated by the mail communication unit 911, the filter processing unit 912 activates the bit pattern calculation unit 913 and transmits the email received from the mail communication unit 911 to the bit pattern calculation unit 913. Also, the filter processing unit 912 receives the comparison result from the bit pattern comparison unit 914, controls the transfer of the e-mail to the user based on the received comparison result, and transmits it to the mail communication unit 911. .

  For example, the filter processing unit 912 indicates that the result of the comparison received from the bit pattern comparison unit 914 is “all the bits in the same order as the bits having the value of“ 1 ”in the calculated bit pattern” If the result is “a value of 1”, the received electronic mail is controlled to be transferred to the user. In other words, the filter processing unit 912 acquires the real address associated with the user information included in the e-mail from the real address table 931 of the data management server 930, and forwards the e-mail to the acquired real address. Control.

  Further, the filter processing unit 912 indicates that the comparison result indicates that any bit having the same rank as the bit having the value “1” in the calculated bit pattern is not the value “1” in the held bit pattern. Next, one or more valid words corresponding to the user information included in the email are acquired from the valid words held by the valid word table 932 of the data management server 930. Then, each of the acquired valid words is compared with the keyword included in the e-mail to determine whether any of the valid words partially matches the keyword.

  For example, since the user information of the e-mail addressed to the keyword address “suzuki.web060620@kwmail.ne.jp” is “suzuki”, the filter processing unit 912 stores the effective word stored in the effective word table 932. Among them, the effective word “web, ml, hiroba, it” corresponding to “suzuki” is acquired, and each of the acquired effective words is compared with the keyword included in the email, and the effective word “web” is the keyword “web060620 "Is partially matched.

  If the filter processing unit 912 determines that any of the valid words partially matches the keyword, the filter processing unit 912 controls the received e-mail to be transferred to the user, and the keyword is disclosed to the disclosure word table 933. The keyword is transmitted to the word registration server 920 for the purpose of registering to the word registration server. For example, the filter processing unit 912 transmits the keyword “web060620” to the word registration server 920 for the purpose of registering in the disclosed word table 933.

  Note that the filter processing unit 912 indicates that the comparison result indicates that any bit in the same rank as the bit having the value “1” in the calculated bit pattern is not the value “1” in the held bit pattern. If it is determined that any of the valid words does not partially match the keyword, control is performed so that the received electronic mail is not transferred to the user.

  When the bit pattern calculation unit 913 receives an e-mail to the user, the bit pattern calculation unit 913 calculates a bit pattern of the number of bits m from a keyword included in the keyword address using a certain function. Specifically, when activated by the filter processing unit 912, the bit pattern calculation unit 913 calculates a bit pattern of m bits from a keyword included in the keyword address received from the filter processing unit 912 using a certain function. Then, the calculated bit pattern is transmitted to the bit pattern comparison unit 914.

  Here, the calculation method of the bit pattern calculation unit 913 will be specifically described. Similarly to the bit pattern calculation unit 113 in the first embodiment, the bit pattern calculation unit 913 in the sixth embodiment performs the disclosed word registration process of the word registration server 920. It is assumed that the same calculation method as that of the unit 924 is used. That is, the message transfer system according to the sixth embodiment is calculated by the disclosed word registration processing unit 924 of the word registration server, and is calculated by the bit pattern registered in the disclosed word table 933 and the bit pattern calculation unit 913 of the mail filter server 910. Since the transfer to the e-mail is controlled by comparing the generated bit pattern, the disclosure word registration processing unit 924 and the bit pattern calculation unit 913 must have the same calculation method.

  The bit pattern comparison unit 914 compares the bit pattern held in the disclosed word table 933 of the data management server 930 with the bit pattern calculated by the bit pattern calculation unit 913 in bit units. Specifically, the bit pattern comparison unit 914 compares the bit pattern held by the disclosed word table 933 with the bit pattern calculated by the bit pattern calculation unit 913 in bit units, and compares the comparison result with the filter processing unit. To 912.

  For example, the bit pattern comparison unit 914 uses the bit pattern calculated by the bit pattern calculation unit 913 when the bit pattern held by the disclosed word table 933 is “0101110111011...” As in the bit pattern comparison unit 114 in the first embodiment. If the pattern is “0101111010000...”, “010111011111...” And “0101111010000. Then, since the bit pattern comparison unit 914 has the bit of the value “1” in the calculated bit pattern, the bit of the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank, In the bit pattern held in the disclosed word table 933, when compared with the bits of the second rank, the fourth rank, the fifth rank, the seventh rank, and the eighth rank, all are values of “1”. The result of the comparison that the bits having the same order as the bits having the value “1” in the calculated bit pattern are all “1” in the held bit pattern ”is transmitted to the filter processing unit 912.

  Similarly to the bit pattern comparison unit 114 in the first embodiment, the bit pattern comparison unit 914 compares the bit pattern held in the disclosed word table 933 with the bit pattern calculated by the bit pattern calculation unit 913 in bit units. If any bit in the same order as the bit having the value of “1” in the calculated bit pattern is not the value of “1” in the bit pattern held by the disclosed word table 933, the “calculated” The result of the comparison that any bit in the same order as the bit having the value “1” in the bit pattern is not the value “1” in the held bit pattern ”is transmitted to the filter processing unit 912.

[Processing Procedure by Message Transfer System According to Embodiment 6]
Next, a processing procedure performed by the message transfer system according to the sixth embodiment will be described with reference to FIGS. FIG. 29 is a sequence diagram showing a processing procedure for registering a disclosed word in the message transfer system, and FIG. 30 is a flowchart showing a processing procedure in the mail filter server.

[Process of registering disclosure word in message transfer system]
In the following, as shown in FIG. 29, the message transfer system according to the sixth embodiment is an e-mail to the user A230, and an e-mail transmitted from the user B terminal 320 (user B330) is sent to the user. The case where it transfers to the user A terminal 220 (user A230) via the B mail server 310, the mail filter server 910, the user A mail server 140, etc. is illustrated.

  First, the user B terminal 320 accepts an email transmission process by the user B330 and transmits an email to the user B mail server 310 (step S2911). For example, in the message transfer system according to the sixth embodiment, assuming that the user B terminal 320 is equipped with mail software, the user B terminal 320 has “destination address (suzuki.web060620@kwmail.ne.jp)”. And other text input by the user B 330 is received, and the input electronic mail is transmitted to the user B mail server 310.

  Next, the user B mail server 310 transmits the electronic mail transmitted from the user B terminal 320 to the mail filter server 910 (step S2912). Specifically, the user B mail server 310 accepts an e-mail transmitted from the user B terminal 320, and sends a “destination address (suzuki.web060620@kwmail.ne.jp)” or other text to a mail filter server. To 910.

  Then, when the mail filter server 910 receives an e-mail from the user B mail server 310, the mail filter server 910 performs a filtering process (determination of transfer possibility) (step S2913). Specifically, the mail filter server 910 activates the filter processing unit 912 when the mail communication unit 911 receives an email, and the filter processing unit 912 activates the bit pattern calculation unit 913 and the bit pattern comparison unit 914. To control the transfer of e-mail.

  For example, in the mail filter server 910, first, the bit pattern calculation unit 913 calculates a bit pattern of the number of bits m from a keyword included in the keyword address using a certain function, and the calculated bit pattern is converted into a bit pattern comparison unit. To 914. Next, the mail filter server 910 compares the disclosed word table 933 of the data management server 930 with the bit pattern calculated by the bit pattern calculation unit 913 in bit units in the bit pattern comparison unit 914, and compares the comparison result. And transmitted to the filter processing unit 912.

  Subsequently, the mail filter server 910 determines that the result of the filtering process (transfer possibility determination) is “in the bit pattern in which one of the bits having the same order as the bit having the value“ 1 ”in the calculated bit pattern is stored” If the result is “not 1”, then each of the valid words held by the valid word table 932 is compared with the keyword, and any of the valid words partially matches the keyword. Judge whether to do. For example, the effective word “web, ml, hiroba, it” held in the effective word table 932 is compared with the keyword.

  If the result is “match”, the mail filter server 910 controls to transfer the received electronic mail to the user (steps S2914 and S2915), and registers this keyword in the disclosure word table 933. For this purpose, the keyword is transmitted to the word registration server 920 (steps S2916 and S2917). For example, the filter processing unit 912 transmits the keyword “web060620” to the word registration server 920 for the purpose of registering in the disclosed word table 933.

  Then, when the word registration server 920 receives the disclosure word registration request from the mail filter server 910, the word registration server 920 calculates the bit pattern of the disclosure word (step S2931). Specifically, when receiving the disclosure word registration request, the word registration server 920 activates the disclosure word registration processing unit 924 and calculates the bit pattern of the disclosure word. For example, the disclosed word registration processing unit 924 calculates the bit pattern H (k) of the disclosed word “web060620” (k).

  Next, the word registration server 920 acquires the bit pattern W corresponding to the user ID from the disclosed word table 933 of the data management server 930 (step S2932). Specifically, the word registration server 920 acquires the bit pattern W corresponding to the user ID (suzuki) from the disclosed word table 933 in the disclosed word registration processing unit 924.

  Then, the word registration server 920 sets the bit pattern as a result obtained by performing an OR operation on the bit pattern W and the bit pattern H (k) as W ′ (step S2933). Specifically, the word registration server 920 performs an OR operation on the bit pattern W acquired from the disclosed word table 933 and the calculated bit pattern H (k) in bit units in the disclosed word registration processing unit 924. Let the resulting bit pattern be W ′.

  Subsequently, the word registration server 920 registers the resulting bit pattern W ′ as a bit pattern corresponding to the user ID in the disclosed word table 933 (step S2934). Specifically, the word registration server 920 registers the disclosed word registration processing unit 924 by replacing the bit pattern W held in the disclosed word table 933 with the resulting bit pattern W ′.

  Since the bit pattern held in the disclosed word table 933 is replaced from the bit pattern W to the bit pattern W ′, the bit pattern W corresponding to the user ID in step S2932 when a new disclosed word is registered. 'Will be acquired.

[Processing on mail filter server]
As shown in FIG. 30, the mail filter server 910 first receives an input of a destination address in the bit pattern calculation unit 913, and acquires a user ID (u) and a keyword (k) from the destination address (step S3011). .

  Next, the mail filter server 910 calculates the bit pattern H (k) of the keyword (k) included in the destination address in the bit pattern calculation unit 913 (step S3012).

  Then, the mail filter server 910 acquires the bit pattern W corresponding to the destination user from the disclosed word table 933 in the bit pattern comparison unit 914 (step S3013). Specifically, the mail filter server 910 acquires the bit pattern W corresponding to the destination user (suzuki) from the disclosed word table 933 of the data management server 930 in the bit pattern comparison unit 914.

  Then, the mail filter server 910 determines in the bit pattern comparison unit 914 whether all the bits in the same order as the bits having the value “1” in the bit pattern H (k) are also the value “1” in the bit pattern W. It is determined whether or not (step S3014). Specifically, the mail filter server 910 uses the bit pattern comparison unit 914 to convert the bit pattern W held by the disclosed word table 933 and the bit pattern H (k) calculated by the bit pattern calculation unit 913 in bit units. In the bit pattern H (k), it is determined whether or not all the bits having the same rank as the bit having the value “1” are also the value “1” in the bit pattern W, and the comparison result is filtered. The data is transmitted to the processing unit 912.

  Then, the mail filter server 910 causes the filter processing unit 912 to compare all the bits in the same order as the bits having the value “1” in the bit pattern H (k) with the value “1” in the bit pattern W. If the result is “Yes” (Yes at Step S3014), it is determined that the transfer possibility is “Transferable” (Step S3017a).

  On the other hand, in the mail filter server 910, the filter processing unit 912 indicates that the comparison result is “one bit in the same order as the bit having the value“ 1 ”in the bit pattern H (k) is“ 1 ”in the bit pattern W”. If the result is “not a value of” (No in step S3014), then, a valid word list corresponding to the user ID (u) is acquired from the valid word table 932 (step S3015).

  Subsequently, the mail filter server 910 sets the element in the acquired valid word list to “w” in the filter processing unit 912 and determines whether there is “w” included in the keyword (k) (any valid word). Is partially matched with the keyword (k)) (step S3016).

  As a result of the determination, if there is “w” included in the keyword (k) (Yes in step S3016), the mail filter server 910 determines that the transfer permission is “transferable” in the filter processing unit 912. For the purpose of registering the keyword (k) in the disclosed word table 933, the keyword is transmitted to the word registration server 920 (step S3017b).

  On the other hand, as a result of the determination, if there is no “w” included in the keyword (k) (No in step S3016), the mail filter server 910 determines in the filter processing unit 912 that the transfer is “transfer impossible”. (Step S3017c).

  As described above, the message transfer system according to the sixth embodiment has a small burden of managing the message address for the user, and when the message address is leaked, it is easy to specify the leak source and only the leaked message address is stored. In a message system that can be easily invalidated, the storage area used for registering the keyword (disclosure word) included in the message address is not increased, and the keyword (disclosure) is determined when determining whether message transfer is permitted or not. It is possible not to reduce the efficiency of searching for (words) and to limit the number of registered keywords (disclosure words).

[Effect of Example 6]
As described above, according to the sixth embodiment, there is provided a message transfer system for controlling transfer of a message whose destination is a message address including user information for identifying a user and a keyword. One or more valid words are stored in association with each other, and a bit pattern of a certain number of bits consisting of values of 0 and 1 and user information are stored in association with each other when a message addressed to the message address is received. Of the stored valid words, each of one or more valid words corresponding to the user information contained in the message address is compared with the keyword contained in the message address, and any of the valid words is partially included in the keyword. If they match, a bit pattern of a predetermined number of bits is calculated from the keyword using a predetermined function, and the stored bit When the received bit pattern is received by replacing the stored bit pattern with the resulting bit pattern obtained by performing an OR operation on the bit pattern and the calculated bit pattern, A user included in the message address among the stored valid words when a bit pattern of a predetermined number of bits is calculated from a keyword included in the message address by a predetermined function and a message addressed to the message address is received. Each of the one or more valid words corresponding to the information is compared with the keyword included in the message address, and either of the valid words partially matches the keyword, or the bit pattern and the calculated bit Calculated by comparing the pattern bit by bit If the bit pattern in which all the bits having the same order as the bits having the value of 1 in the bit pattern are all 1's, control is performed so that the message is transferred. In a message system that is easy to specify the source of a leak when the message address is leaked and can easily invalidate only the leaked message address, the keyword (disclosure word) included in the message address The storage area used for registration is not increased, the efficiency of searching for a keyword (disclosure word) is not reduced when determining whether message transfer is permitted, and the registration number of the keyword (disclosure word) is not limited. It becomes possible.

  That is, according to the message transfer system according to the sixth embodiment, a keyword (disclosure word) is registered by being replaced with a bit pattern having a predetermined number of bits (a keyword (disclosure word) is superimposed on one bit pattern). Therefore, the storage area used for registering the keyword (disclosure word) is not increased in proportion to the number of registered keywords (disclosure word). Further, since the storage area used for registering the keyword (disclosure word) is not increased, the storage area for searching for the keyword (disclosure word) is not increased when determining whether or not the message transfer is permitted. Does not reduce the efficiency of searching for words. As a result, it is not necessary to avoid an increase in the storage area and a decrease in search efficiency due to an increase in the storage area, so that the number of registered keywords (disclosure words) is not limited.

  By the way, although the message transfer system which concerns on Examples 1-6 was demonstrated so far, this invention may be implemented with a various different form other than an above-described Example. Therefore, different embodiments will be described below as the message transfer system according to the seventh embodiment.

  In the second embodiment, the message transmission is permitted even for the sender information once registered by holding and using the sender information (black list) of the sender who refuses to transfer the message. However, the present invention is not limited to this. For example, the message transfer system separately transmits the source information of the source that the user permits the message transfer to another storage area. Each time a new registration or deletion of the sender information is performed, the bit is again registered and deleted. A method of calculating a pattern (source information is registered over one bit pattern) and holding the calculated bit pattern in the message transfer system Etc. also, it is possible to apply the present invention likewise.

[System configuration, etc.]
In addition, among the processes described in the above embodiments, all or a part of the processes described as being automatically performed can be manually performed, or the processes described as being manually performed Perform all or part of the process automatically (for example, by registering the sender information by sending a permission address registration request from the user terminal) (for example, included in the message returned by the user terminal) For example, registering the sender information included in the message sent by the user terminal). In addition, the processing procedure, control procedure, specific name, and information including various data and parameters shown in the above-mentioned document and drawings can be arbitrarily changed unless otherwise specified.

  Each component of each illustrated apparatus is functionally conceptual, and does not necessarily need to be physically configured as illustrated (for example, FIG. 2). In other words, the specific form of distribution / integration of each device is not limited to that shown in the figure, and all or a part thereof may be functionally or physically distributed or arbitrarily distributed in arbitrary units according to various loads or usage conditions. The data management server 130 and the permitted caller registration server 120 may be integrated and configured, for example. Further, all or any part of each processing function performed in each device may be realized by a CPU and a program analyzed and executed by the CPU, or may be realized as hardware by wired logic.

  The message transfer method described in the above embodiment (for example, FIG. 6 and the like) can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program can be distributed via a network such as the Internet. The program can also be executed by being recorded on a computer-readable recording medium such as a hard disk, a flexible disk (FD), a CD-ROM, an MO, and a DVD and being read from the recording medium by the computer.

  As described above, the message transfer system and the message transfer program according to the present invention are useful for controlling the message transfer to the user based on the sender information included in the message. , Does not increase the storage area used for registration of sender information, and does not reduce the efficiency of searching sender information when determining whether message transfer is permitted or not, and thus limits the number of sender information registered. Suitable for not letting.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram for explaining an overview and characteristics of a message transfer system according to a first embodiment. 1 is a block diagram illustrating a configuration of a message transfer system according to a first embodiment. It is a figure for demonstrating a bit pattern calculation part. It is a figure for demonstrating the bit pattern table of a data management server. It is a sequence diagram which shows the procedure of the process which registers transmission origin information in a message transfer system. It is a sequence diagram which shows the procedure of the process which controls the transfer of a message based on the registered transmission origin information. It is a flowchart which shows the procedure of the process in a mail filter server. FIG. 10 is a diagram for explaining a data management server according to a second embodiment. It is a figure for demonstrating a prohibition address table. It is a flowchart which shows the procedure of the process in a mail filter server. It is a figure for demonstrating a bit pattern table. It is a sequence diagram which shows the procedure of the process which registers transmission origin information in a message transfer system. It is a flowchart which shows the procedure of the process in a mail filter server and a permission caller registration server. It is a flowchart which shows the procedure of the process accompanying progress of the period in a bit pattern table. FIG. 10 is a block diagram illustrating a configuration of a message transfer system according to a fourth embodiment. It is a figure for demonstrating the bit pattern table of a data management server. It is a sequence diagram which shows the procedure of the process which registers transmission origin information in a message transfer system. It is a sequence diagram which shows the procedure of the process which controls the transfer of a message based on the registered transmission origin information. It is a flowchart which shows the procedure of the process in an IP telephone connection control server. It is a block diagram which shows the structure of an IP telephone connection control server. It is a figure for demonstrating an agreement confirmation transmission destination holding | maintenance part. It is a sequence diagram which shows the procedure of the process which registers transmission origin information in a message transfer system. It is a figure for demonstrating the mechanism of the message transfer which makes a keyword address a destination. It is a figure for demonstrating the characteristic of the message transfer system which concerns on Example 6. FIG. FIG. 10 is a block diagram illustrating a configuration of a message transfer system according to a sixth embodiment. It is a figure for demonstrating a real address table. It is a figure for demonstrating an effective word table. It is a figure for demonstrating a disclosure word table. It is a sequence diagram which shows the procedure of the process which registers a disclosure word with a message transfer system. It is a flowchart which shows the procedure of the process in a mail filter server.

Explanation of symbols

100 LAN
DESCRIPTION OF SYMBOLS 110 Mail filter server 111 Mail communication part 112 Filter process part 113 Bit pattern calculation part 114 Bit pattern comparison part 120 Permitted caller registration server 121 HTTP communication part 122 Permitted caller registration process part 123 Bit pattern calculation part 130 Data management server 131 bits Pattern table 140 User A mail server 141 SMTP / POP communication unit 142 Mail storage unit 220 User A terminal 230 User A
240 User A IP network 310 User B mail server 320 User B terminal 330 User B
340 User B IP network 400 Internet

Claims (10)

A message transfer system that controls message transfer to a user based on sender information that is information about the sender of the message included in the message,
Bit pattern holding means for holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and user information for identifying the user in association with each other;
The bit pattern of the number of bits is calculated using a predetermined function from the sender information of the sender that allows the user to transfer the message, and the bit pattern held by the bit pattern holding means and the calculated bit A bit pattern registration unit that replaces and registers the bit pattern held by the bit pattern holding unit with a bit pattern obtained by performing an OR operation on the pattern in units of bits;
A bit pattern calculation means for calculating a bit pattern of the number of bits from the source information included in the message when the message for the user is received, using the function;
The bit pattern held by the bit pattern holding unit and the bit pattern calculated by the bit pattern calculating unit are compared in bit units, and the bit having the same rank as the bit having a value of 1 is calculated in the calculated bit pattern. A message transfer control means for controlling the message to be transferred to the user when all of the held bit patterns are 1 values;
A message transfer system comprising:   The message transfer system according to claim 1, wherein the bit pattern registration unit calculates a bit pattern from the source information using a hash function as the predetermined function.   The bit pattern registration means derives a plurality of positive integer values from the source information for each hash function using a plurality of hash functions that derive a positive integer value equal to or less than the number of bits as the predetermined function. Generating a bit pattern of the number of bits for each of the hash functions, with the bit of the rank corresponding to the positive integer value being a value of 1, and ORing the generated bit patterns in units of bits. The message transfer system according to claim 1, wherein a bit pattern is calculated from the source information. Further comprising rejected sender information holding means for holding the sender information and the user information in association with each other, wherein the user refuses to transfer the message,
The message transfer control means may determine that the message even if all the bits having the same rank as the 1-value bits in the calculated bit pattern are 1 in the held bit pattern as a result of the comparison, When the sender information included in the message corresponds to the sender information held by the reject sender information holding means, the message is controlled not to be transferred to the user. 4. The message transfer system according to any one of 3. The bit pattern holding means holds the correspondence between the bit pattern and the user information in a cycle unit from a current cycle to a predetermined cycle in the past, and with the elapse of the cycle, the current cycle Is replaced with a bit pattern consisting of all values of 0, the bit pattern of the previous predetermined period is discarded, and a bit pattern of a period other than the previous predetermined period is discarded by the previous period Replace with the bit pattern of
The bit pattern registration unit is configured to perform an OR operation on the bit pattern of the current period held by the bit pattern holding unit and the bit pattern calculated from the transmission source information in a bit unit. , Register by replacing the bit pattern of the current cycle,
The message transfer control means compares the bit patterns of all periods held by the bit pattern holding means with the bit patterns calculated by the bit pattern calculation means, and sets the value of 1 in the calculated bit pattern. If the bits in the same order as the bits are all 1 values in any of the bit patterns of all the cycles, control is performed so that the message is transferred to the user,
The bit pattern registration means is controlled to transfer the message to the user by setting all the values to 1 in the bit pattern of a period other than the current period as a result of comparison by the message transfer control means. The bit pattern calculated from the source information included in the message and the bit pattern of the current period held by the bit pattern holding means are obtained by performing an OR operation on a bit basis, and the current pattern 5. The message transfer system according to claim 1, wherein the message pattern is further registered by replacing the bit pattern of the period. As a result of the comparison by the message transfer control means, any bit in the same order as a bit having a value of 1 in the bit pattern calculated from the source information does not have a value of 1 in the held bit pattern. An agreement confirmation transmitting means for transmitting an agreement confirmation message for confirming consent to register the sender information to the held bit pattern to the user together with the sender information;
An agreement notification receiving means for receiving an agreement notification notified from the user together with the source information as a response to the agreement with respect to the agreement confirmation message transmitted by the agreement confirmation transmission means;
The bit pattern registration means calculates the bit pattern from the source information received together with the consent notice by the consent notice receiving means using a predetermined function, and the bit pattern held by the bit pattern holding means 6. The bit pattern held by the bit pattern holding means is replaced and registered by a bit pattern obtained by performing an OR operation on the calculated bit pattern in bit units. The message transfer system according to any one of the above. An agreement confirmation transmission destination holding means for holding the user information in association with the transmission destination of the consent confirmation message for confirming the consent to register the sender information in the bit pattern holding means;
As a result of the comparison by the message transfer control means, any bit in the same order as a bit having a value of 1 in the bit pattern calculated from the source information does not have a value of 1 in the held bit pattern. The consent confirmation transmitting means for transmitting the consent confirmation message to the transmission destination held by the consent confirmation transmission destination holding means together with the sender information and the user information;
An agreement notification receiving unit that receives an agreement notification notified from the user as a response to the agreement with respect to the agreement confirmation message transmitted by the agreement confirmation transmission unit together with the source information and the user information;
The bit pattern registration means calculates the bit pattern from the source information received together with the consent notice by the consent notice receiving means using a predetermined function, and the bit pattern held by the bit pattern holding means Register the bit pattern associated with the user information and held by the bit pattern holding means by the bit pattern obtained by performing an OR operation on the calculated bit pattern in bit units. The message transfer system according to any one of claims 1 to 5. A message transfer system for controlling transfer of a message whose destination is a message address including user information for identifying a user and a keyword,
Valid word holding means for holding the user information in association with one or more valid words;
Bit pattern holding means for holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and the user information in association with each other;
When a message addressed to the message address is received, among the valid words held by the valid word holding unit, each of one or more valid words corresponding to the user information included in the message address When any of the valid words partially matches the keyword as compared with the keyword included in the message address, the bit pattern of the number of bits is calculated from the keyword by a predetermined function, and the bit pattern holding unit Bit pattern registration that replaces and registers the bit pattern held by the bit pattern holding means with the bit pattern obtained by ORing the bit pattern held by the bit pattern and the calculated bit pattern in bit units Means,
Bit pattern calculating means for calculating a bit pattern of the number of bits by the function from a keyword included in the message address when a message addressed to the message address is received;
When a message addressed to the message address is received, among the valid words held by the valid word holding unit, each of one or more valid words corresponding to the user information included in the message address The bit pattern held by the bit pattern holding unit and the bit pattern calculated by the bit pattern calculating unit when any of the valid words partially matches the keyword compared with the keyword included in the message address If the bits having the same rank as the 1-valued bits in the calculated bit pattern are all 1-values in the stored bit pattern by comparing the pattern with the bit unit, the message is transferred. Message transfer control means for controlling
A message transfer system comprising: A message transfer program that causes a computer to execute a method for controlling message transfer to a user based on source information that is information about a source of the message included in a message,
A bit pattern holding procedure for holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and user information for identifying the user in association with each other;
A bit pattern of the number of bits is calculated using a predetermined function from source information of a source that allows the user to transfer a message, and the bit pattern stored by the bit pattern holding procedure and the calculated bit A bit pattern registration procedure for registering by replacing the bit pattern held by the bit pattern holding procedure with a bit pattern of a result obtained by performing an OR operation on the pattern in units of bits;
A bit pattern calculation procedure for calculating a bit pattern of the number of bits from the source information included in the message when the message for the user is received;
The bit pattern held by the bit pattern holding procedure and the bit pattern calculated by the bit pattern calculation procedure are compared in units of bits, and the bit having the same rank as the bit having a value of 1 is calculated in the calculated bit pattern. A message transfer control procedure for controlling the message to be transferred to the user when all the held bit patterns are 1;
A message transfer program for causing a computer to execute the program. A message transfer program for causing a computer to execute a method for controlling transfer of a message addressed to a message address including user information for identifying a user and a keyword,
A valid word holding procedure for holding the user information in association with one or more valid words;
A bit pattern holding procedure for holding a bit pattern of a predetermined number of bits consisting of values of 0 and 1 and the user information in association with each other;
When the message addressed to the message address is received, among the valid words held by the valid word holding procedure, each of one or more valid words corresponding to the user information included in the message address is If any of the valid words partially matches the keyword compared to the keyword included in the message address, the bit pattern of the number of bits is calculated from the keyword using a predetermined function, and the bit pattern holding procedure Bit pattern registration that replaces and registers the bit pattern held by the bit pattern holding procedure with the bit pattern obtained by ORing the bit pattern held by the bit pattern and the calculated bit pattern in bit units Procedure and
A bit pattern calculation procedure for calculating the bit pattern of the number of bits by the function from a keyword included in the message address when a message addressed to the message address is received;
When the message addressed to the message address is received, among the valid words held by the valid word holding procedure, each of one or more valid words corresponding to the user information included in the message address is If any of the valid words partially matches the keyword compared to the keyword included in the message address, or the bit pattern held by the bit pattern holding procedure and the bit calculated by the bit pattern calculation procedure If the bits having the same rank as the 1-valued bits in the calculated bit pattern are all 1-values in the stored bit pattern by comparing the pattern with the bit unit, the message is transferred. Message transfer control procedure to control
A message transfer program for causing a computer to execute the program.

Images