System and method for secure messaging in a hybrid peer-to-peer network

• US 9,712,507 B2
• Filed: 09/16/2015
• Issued: 07/18/2017
• Est. Priority Date: 06/23/2010
• Status: Active Grant

• Current Assignee: Damaka, Inc.
• Original Assignee: Damaka, Inc.
• Inventors: Chaturvedi, Sivakumar, Gundabathula, Satish
• Primary Examiner(s): Moorthy, Aravind
• Application Number:
  US14/856,263
• Publication Number:
  US 20160014101A1
• Time in Patent Office: 671 Days
• Field of Search: 380273, 380255, 713150, 713153, 713171, 713181, 726 4, 726 14
• CPC Class Codes: H04L 63/061 for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838
• CPC Class Codes: H04L 63/068 using time-dependent keys, e.g. periodically changing keys cryptographic mechanisms or cryptographic arrangements for controlling usage of secret information H04L9/088
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks

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.

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, wherein each of the first and second encryption keys is used by the first and second endpoints to form a plurality of known key iterations, and wherein each of the plurality of known key iterations is a valid encryption key for the first endpoint; 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.

2. The method of claim 1 further comprising:

sending, by the first endpoint, a first message to a second endpoint that the first endpoint is going to change to the second encryption key, wherein the first message is defined for use with a transactional state model and includes information representing the second encryption key;

receiving, by the first endpoint, in response to the first message, a second message from the second endpoint indicating that the second endpoint received the first message, wherein the second message is defined for use with the transactional state model; and

sending, by the first endpoint, a third message to the second endpoint acknowledging receipt of the second message, wherein the third message is defined for use with the transactional state model.

3. The method of claim 1 further comprising:

receiving, by the first endpoint, a message from the second endpoint that is encrypted using the second encryption key;

applying, by the first endpoint, a first key iteration of the first encryption key to the message to determine if the first key iteration will decrypt the 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 message;

applying, by the first endpoint, the next key iteration to the message to determine if the next key iteration will decrypt the message; and

as long as untried key iterations are available, continuing the steps of rotating and applying for each key iteration until either the message is decrypted or the first endpoint fails to decrypt the message after trying all possible key iterations.

4. The method of claim 3 wherein the first encryption key has a fixed number of bytes, and wherein rotating the first encryption key includes shifting each of the bytes in a predefined direction.

5. The method of claim 3 wherein each rotation of the first encryption key randomly selects an iteration of the first encryption key, and wherein an iteration can be repeated before every iteration is used.

6. The method of claim 5 wherein every iteration of the first encryption key is used before any iteration is repeated.

7. The method of claim 1 further comprising:

encrypting, by the first endpoint, a message using a first iteration of a third encryption key corresponding to the second endpoint, wherein the third encryption key is used by the first and second endpoints to form a plurality of known key iterations, and wherein each of the plurality of known key iterations is a valid encryption key for the second endpoint; and

sending, by the first endpoint, the message to the second endpoint.

8. The method of claim 7 further comprising:

rotating, by the first endpoint, the third encryption key to form a second iteration of the third encryption key;

encrypting, by the first endpoint, a second message using the second iteration of the third encryption key; and

sending, by the first endpoint, the second message to the second endpoint.

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 to determine if the first key iteration will decrypt the 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.

10. The method of claim 9 further comprising receiving, by the first endpoint from a second endpoint, the first message that is encrypted using the first encryption key corresponding to the first endpoint, wherein the first encryption key is used by the first and second endpoints to form a plurality of known key iterations, and wherein each of the plurality of known key iterations is a valid encryption key for the first endpoint.

11. The method of claim 10 wherein each message received from the second endpoint uses a different key iteration than the previous message.

12. The method of claim 10 wherein each rotation of the first encryption key by the second endpoint randomly selects an iteration of the first encryption key, and wherein an iteration can be repeated before every iteration is used.

13. The method of claim 9 wherein the first encryption key replaces a second encryption key that was in use by the first endpoint immediately prior to the first encryption key, the method further comprising:

determining, by the first endpoint, that a defined period of time has not ended since the second encryption key was replaced by the first encryption key; and

attempting to decrypt the first message with the second encryption key as well as the first encryption key.

14. The method of claim 13 wherein attempting to decrypt the first message with the second encryption key includes:

applying, by the first endpoint, a first key iteration of the second encryption key to the first message to determine if the first key iteration of the second encryption key will decrypt the first message;

rotating, by the first endpoint, the second encryption key to form a next key iteration of the second encryption key from the second encryption key if the first key iteration of the second encryption key will not decrypt the first message;

applying, by the first endpoint, the next key iteration of the second encryption key to the first message to determine if the next key iteration of the second encryption key 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 of the second encryption key until either the first message is decrypted or the first endpoint fails to decrypt the first message after trying all possible key iterations of the second encryption key.

15. The method of claim 9 wherein the first encryption key replaces a second encryption key that was in use by the first endpoint immediately prior to the first encryption key, the method further comprising:

determining, by the first endpoint, that a defined period of time has ended since the second encryption key was replaced by the first encryption key; and

attempting to decrypt the first message with only the first encryption key and not the second encryption key, wherein the first endpoint would also attempt to decrypt the first message using the second encryption key if the defined period of time had not ended.

16. The method of claim 9 further comprising:

encrypting, by the first endpoint, a second message using a first iteration of a second encryption key corresponding to a second endpoint, wherein the second encryption key is used by the first and second endpoints to form a plurality of known key iterations, and wherein each of the plurality of known key iterations is a valid encryption key for the second endpoint; and

sending, by the first endpoint, the second message to the second endpoint.

17. The method of claim 16 further comprising:

rotating, by the first endpoint, the second encryption key to form a second iteration of the second encryption key;

encrypting, by the first endpoint, a third message using the second iteration of the second encryption key; and

sending, by the first endpoint, the third message to the second endpoint.

18. The method of claim 9 wherein the first encryption key has a fixed number of bytes, and wherein rotating the first encryption key includes shifting each of the bytes in a predefined direction.

19. The method of claim 9 wherein every iteration of the first encryption key is used before any iteration is repeated.

20. The method of claim 9 wherein, if the first message is decrypted, the method further comprises:

determining, by the first endpoint, whether the first message corresponds to a current state of a state machine of the first endpoint; and

rejecting the first message if the first message does not correspond to the current state.