IP Library Granted Patent US 12,647,404
Granted Patent B2
US 12,647,404 · App. 18/471,041 · Granted Jun 2, 2026

Coordination and management of keys and instructions for multiple encryption

Inventor: Tanner Young (Eagle Mountain, UT)
Assignee: DigiCert, Inc.
H04L63/062H04L63/045
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,647,404
App. No.
18/471,041
Granted
Jun 2, 2026
Kind
B2
Abstract

Systems and methods for coordination and management of keys and instructions for multiple encryption include, responsive to receiving encrypted data that has been encrypted via a plurality of layers of encryption, accessing a coordinator to determine instructions for multiple encryption; and decrypting the encrypted data based on the instructions and utilizing a plurality of keys with a key for each of the plurality of layers of encryption.

Claims (16)

1 . A method for managing multiple encryption, implemented at a recipient, the method comprising steps of:

performing handshake between a source and a coordinator located at the recipient to obtain a plurality of keys, each key including a key value and an instruction payload comprising coordinator-readable metadata specifying at least one of a decryption layer order, an encryption algorithm, or an association with another key of the plurality of keys, wherein instructions for the multiple encryption are included with the plurality of keys;

responsive to receiving encrypted data that has been encrypted via a plurality of layers of encryption of the multiple encryption, accessing and parsing by the coordinator the instruction payloads to determine the instructions for the plurality of layers of encryption of the multiple encryption, wherein the instructions are distributed between the plurality of keys such that at least one key includes instructions specifying an encryption algorithm or an encryption layer associated with another key of the plurality of keys; and

decrypting the encrypted data based on the parsed instructions and utilizing a plurality of keys with a key for each of the plurality of layers of encryption.

2 . The method of claim 1 , wherein the instructions include details which describe any of a direction of the plurality of layers of encryption, an encryption algorithm for each of the plurality of layers of encryption, and identification of the plurality of keys for each of the plurality of layers of encryption.

3 . The method of claim 1 , wherein the plurality of layers of encryption include symmetric-key encryption, asymmetric-key encryption, and a combination thereof.

4 . The method of claim 1 , wherein the plurality of keys are associated with at least two users, and wherein the steps further include:

obtaining consent from the at least two users by the coordinator prior to the decrypting.

5 . A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors at a recipient to perform steps of:

performing handshake between a source and a coordinator located at the recipient to obtain a plurality of keys, each key including a key value and an instruction payload comprising coordinator-readable metadata specifying at least one of a decryption layer order an encryption algorithm, or an association with another key of the plurality of keys, wherein instructions for the multiple encryption are included with the plurality of keys;

responsive to receiving encrypted data that has been encrypted via a plurality of layers of encryption of the multiple encryption, accessing and parsing by the coordinator the instruction payloads to determine the instructions for plurality of layers of encryption of the multiple encryption, wherein the instructions are distributed between the plurality of keys such that at least one key includes instructions specifying an encryption algorithm or an encryption layer associated with another key of the plurality of keys; and

decrypting the encrypted data based on the parsed instructions and utilizing a plurality of keys with a key for each of the plurality of layers of encryption.

6 . The non-transitory computer-readable medium of claim 5 , wherein the instructions include details which describe any of a direction of the plurality of layers of encryption, an encryption algorithm for each of the plurality of layers of encryption, and identification of the plurality of keys for each of the plurality of layers of encryption.

7 . The non-transitory computer-readable medium of claim 5 , wherein the plurality of layers of encryption include symmetric-key encryption, asymmetric-key encryption, and a combination thereof.

8 . The non-transitory computer-readable medium of claim 5 , wherein the plurality of keys are associated with at least two users, and wherein the steps further include:

obtaining consent from the at least two users by the coordinator prior to the decrypting.

Assignments (3)
FIRST LIEN INTELLECTUAL PROPERTY AGREEMENT SUPPLEMENT Recorded Sep 24, 2025
From: DIGICERT, INC.
To: HPS INVESTMENT PARTNERS, LLC, AS COLLATERAL AGENT
Reel/Frame 072947/0203 →
SECOND LIEN INTELLECTUAL PROPERTY SECURITY AGREEMENT SUPPLEMENT Recorded Jul 30, 2025
From: DIGICERT, INC.
To: UBS AG, STAMFORD BRANCH, AS COLLATERAL AGENT
Reel/Frame 072295/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 20, 2023
From: YOUNG, TANNER
To: DIGICERT, INC.
Reel/Frame 064973/0354 →
Continuity (1)
Related Publication 20250097207A1 · Mar 20, 2025
References Cited (13)
US 6553493B1 · Okumura et al. · 2003 [cited by applicant]
US 9270449B1 · Tribble · 2016 [cited by examiner]
US 9350536B2 · Sabin · 2016 [cited by applicant]
US 10277580B1 · Klieman et al. · 2019 [cited by applicant]
US 11206134B2 · Kumar et al. · 2021 [cited by applicant]
US 20110208962A1 · Andrews et al. · 2011 [cited by applicant]
US 20140019762A1 · Sabin · 2014 [cited by applicant]
US 20160269412A1 · Farah · 2016 [cited by examiner]
US 20160365985A1 · Pilcher et al. · 2016 [cited by applicant]
US 20170270283A1 · Shiraishi · 2017 [cited by examiner]
US 20210036851A1 · Villapakkam · 2021 [cited by examiner]
US 20220092168A1 · Brown et al. · 2022 [cited by applicant]
US 20220417037A1 · Ounsworth · 2022 [cited by examiner]