System and method for secure messaging in a hybrid peer-to-peer network
First Claim
Patent Images
1. A method for changing an encryption key in a hybrid peer-to-peer network comprising:
- receiving, by a first endpoint, an instruction to change from a first encryption key to a second encryption key; and
changing, by the first endpoint, from the first encryption key to the second encryption key, wherein all incoming messages for the first endpoint are to be encrypted using the second encryption key, and wherein both the first and second encryption keys are used to decrypt messages received by the first endpoint until a defined period of time has elapsed since the second encryption key was replaced by the first encryption key.
1 Assignment
0 Petitions
Accused Products
Abstract
An improved system and method are disclosed for peer-to-peer communications. In one example, the method enables endpoints to securely send and receive messages to one another within a hybrid peer-to-peer environment.
310 Citations
20 Claims
-
1. A method for changing an encryption key in a hybrid peer-to-peer network comprising:
-
receiving, by a first endpoint, an instruction to change from a first encryption key to a second encryption key; and changing, by the first endpoint, from the first encryption key to the second encryption key, wherein all incoming messages for the first endpoint are to be encrypted using the second encryption key, and wherein both the first and second encryption keys are used to decrypt messages received by the first endpoint until a defined period of time has elapsed since the second encryption key was replaced by the first encryption key. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for identifying a correct encryption key comprising:
-
applying, by a first endpoint, a first key iteration of a first encryption key to a first message; rotating, by the first endpoint, the first encryption key to form a next key iteration from the first encryption key if the first key iteration will not decrypt the first message; applying, by the first endpoint, the next key iteration to the first message to determine if the next key iteration will decrypt the first message; and as long as untried key iterations are available, continuing the steps of rotating and applying for each key iteration until either the first message is decrypted or the first endpoint fails to decrypt the first message after trying all possible key iterations. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification