Confidential communication method
First Claim
1. In a confidential communication method of messages transmitted and received between a transmission source client that is a subordinate of one communication server of a plurality of communication servers, and a transmission destination client that is a subordinate of another communication server of the plurality of communication servers, wherein the transmission source client and the transmission destination client are connected to a loop network which forwards a message on a basis of a predetermined rule, and in the confidential communication method of the messages,the transmission source clientcreates first confidential address information including a hash value of a generated random bit string, and a code string obtained by encrypting the random bit string using a public key of the transmission destination client, and second confidential address information including a code string obtained by encrypting the random bit string using a public key of the another communication server to which the transmission destination client connects, and the hash value, andforwards a message including at least the first confidential address information, the second confidential address information, and a message body, to the loop network via the one communication server.
1 Assignment
0 Petitions
Accused Products
Abstract
It is an object of the present invention to solve a problem included in the onion routing which is used as a confidential communication method, that if a system down occurs in a computer within a communication route, connection is not made to further components at all, or a problem that the system and the traffic become slow by using multiplexed encryption. It is a communication method in which a client of an information providing source encrypts random numbers and calculates its hash value using respective public keys of an information server to which it connects, a function server of a destination to be sent, and an information server to which the function server connects, respective servers decrypt the encrypted random number using their own secret keys to compare the random number with the hash value, and thus, the client determines whether or not the route is related to the client. In such a way, information can be provided as an information providing source and an information provided destination are hidden, and as a response to provided contents from the function server which is the information provided source can also be kept anonymous.
-
Citations
11 Claims
-
1. In a confidential communication method of messages transmitted and received between a transmission source client that is a subordinate of one communication server of a plurality of communication servers, and a transmission destination client that is a subordinate of another communication server of the plurality of communication servers, wherein the transmission source client and the transmission destination client are connected to a loop network which forwards a message on a basis of a predetermined rule, and in the confidential communication method of the messages,
the transmission source client creates first confidential address information including a hash value of a generated random bit string, and a code string obtained by encrypting the random bit string using a public key of the transmission destination client, and second confidential address information including a code string obtained by encrypting the random bit string using a public key of the another communication server to which the transmission destination client connects, and the hash value, and forwards a message including at least the first confidential address information, the second confidential address information, and a message body, to the loop network via the one communication server.
Specification