IP Library Granted Patent US 9,361,481
Granted Patent B2
US 9,361,481 · App. 14/846,167 · Granted Jun 7, 2016

Systems and methods for contextualized data protection

Inventors: Malcolm Gary LaFever (Lyons, CO); Ted N. Myerson (New York, NY); Steven Mason (Las Vegas, NV)
Assignee: Anonos Inc.
G06F21/6254G06F21/6218G06F21/6263H04L63/0414H04L63/0281
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 9,361,481
App. No.
14/846,167
Granted
Jun 7, 2016
Kind
B2
Abstract

Various systems, computer-readable media, and computer-implemented methods of providing improved data privacy, anonymity, and security by enabling subjects to which data pertains to remain “dynamically anonymous,” i.e., anonymous for as long as is desired—and to the extent that is desired—are disclosed herein. This concept is also referred to herein as Just-In-Time-Identity, or “JITI.” Embodiments include systems that create, access, use, store and/or erase data with increased privacy, anonymity and security—thereby facilitating the availability of more qualified information—via the use of temporally unique, dynamically changing de-identifiers (“DDIDs”). In some embodiments, specialized JITI keys may be used to “unlock” different views of the same DDID (or its underlying value), thereby providing granular control over the level of detail or obfuscation visible to each user based on the context of said user's authorized use of data, e.g., authorized purpose(s), place(s), time(s), or other attributes of the use.

Claims (75)

1. A system, comprising:

a communication interface for sending data over a network;

a memory having, stored therein, computer program code;

and one or more processing units operatively coupled to the memory and configured to execute instructions in the computer program code that cause the one or more processing units to:

generate one or more dynamically-changing, temporally unique identifiers;

receive, over the network, a first request from a first data subject for a generated dynamically-changing, temporally unique identifier to be related to an attribute of the first data subject;

associate, in response to the first request, a first generated dynamically-changing, temporally unique identifier with the attribute of the first data subject;

transform the value of the first generated dynamically-changing, temporally unique identifier into a first unintelligible form,

wherein a first key may be used to transform the first unintelligible form back into a first view of the first generated dynamically-changing, temporally unique identifier,

wherein a second key may be used to transform the first unintelligible form back into a second view of the first generated dynamically-changing, temporally unique identifier,

wherein the first key is different from the second key, and

wherein the first view is different from the second view;

store, in the memory, the first generated dynamically-changing, temporally unique identifier, the first key, the second key, and the first unintelligible form; and

send the first unintelligible form over the network to the first data subject.

2. The system of claim 1 , wherein the first view provides more detail than the second view.

3. The system of claim 1 , wherein the unintelligible form comprises encrypted text.

4. The system of claim 1 , wherein the instructions in the computer program code further comprise instructions that cause the one or more processing units to also associate the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject.

5. The system of claim 4 , wherein the instructions in the computer program code that cause the one or more processing units to also associate the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject are executed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

6. The system of claim 1 , wherein the instructions in the computer program code further comprise instructions that cause the one or more processing units to:

associate a second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject.

7. The system of claim 6 , wherein the instructions in the computer program code that cause the one or more processing units to associate the second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject are executed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

8. A non-transitory computer readable medium comprising computer executable instructions stored thereon to cause one or more processing units to:

generate one or more dynamically-changing, temporally unique identifiers;

receive, over a network, a first request from a first data subject for a generated dynamically-changing, temporally unique identifier to be related to an attribute of the first data subject;

associate, in response to the first request, a first generated dynamically-changing, temporally unique identifier with the attribute of the first data subject;

transform the value of the first generated dynamically-changing, temporally unique identifier into a first unintelligible form,

wherein a first key may be used to transform the first unintelligible form back into a first view of the first generated dynamically-changing, temporally unique identifier,

wherein a second key may be used to transform the first unintelligible form back into a second view of the first generated dynamically-changing, temporally unique identifier,

wherein the first key is different from the second key, and

wherein the first view is different from the second view;

store, in a memory, the first generated dynamically-changing, temporally unique identifier, the first key, the second key, and the first unintelligible form; and

send the first unintelligible form over the network to the first data subject.

9. The non-transitory computer readable medium of claim 8 , wherein the first view provides more detail than the second view.

10. The non-transitory computer readable medium of claim 8 , wherein the unintelligible form comprises non-encrypted text.

11. The non-transitory computer readable medium of claim 8 , wherein the instructions further comprise instructions that cause the one or more processing units to also associate the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject.

12. The non-transitory computer readable medium of claim 11 , wherein the instructions that cause the one or more processing units to also associate the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject are executed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

13. The non-transitory computer readable medium of claim 8 , wherein the instructions further comprise instructions that cause the one or more processing units to:

associate a second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject.

14. The non-transitory computer readable medium of claim 13 , wherein the instructions that cause the one or more processing units to associate the second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject are executed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

15. A computer-implemented method comprising:

generating one or more dynamically-changing, temporally unique identifiers;

receiving, over a network, a first request from a first data subject for a generated dynamically-changing, temporally unique identifier to be related to an attribute of the first data subject;

associating, in response to the first request, a first generated dynamically-changing, temporally unique identifier with the attribute of the first data subject;

transforming the value of the first generated dynamically-changing, temporally unique identifier into a first unintelligible form,

wherein a first key may be used to transform the first unintelligible form back into a first view of the first generated dynamically-changing, temporally unique identifier,

wherein a second key may be used to transform the first unintelligible form back into a second view of the first generated dynamically-changing, temporally unique identifier,

wherein the first key is different from the second key, and

wherein the first view is different from the second view;

storing, in a memory, the first generated dynamically-changing,

temporally unique identifier, the first key, the second key, and the first unintelligible form; and

sending the first unintelligible form over the network to the first data subject.

16. The computer-implemented method of claim 15 , wherein the first view provides more detail than the second view.

17. The computer-implemented method of claim 15 , further comprising also associating the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject.

18. The computer-implemented method of claim 17 , wherein the act of also associating the first generated dynamically-changing, temporally unique identifier with an attribute of a second data subject is performed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

19. The computer-implemented method of claim 15 , further comprising:

associating a second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject.

20. The computer-implemented method of claim 19 , wherein act of associating the second generated dynamically-changing, temporally unique identifier with the attribute of the first data subject is performed in at least one of the following situations:

at a different time than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject;

at a different physical or virtual location than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject; and

for a different purpose than the first generated dynamically-changing, temporally unique identifier is associated with the attribute of the first data subject.

Assignments (7)
RELEASE OF SECURITY INTEREST Recorded May 8, 2026
From: ANKURA TRUST COMPANY, LLC
To: ANONOS IP LLC
Reel/Frame 074607/0340 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 4, 2026
From: ANONOS TECHNOLOGIES LLC
To: ANONOS INNOVATIONS LLC
Reel/Frame 073688/0692 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 2, 2026
From: SONONA LLC
To: ANONOS TECHNOLOGIES LLC
Reel/Frame 073661/0128 →
ASSIGNMENT OF INTELLECTUAL PROPERTY Recorded Oct 3, 2025
From: ANKURA TRUST COMPANY, LLC
To: SONONA LLC
Reel/Frame 072997/0822 →
SECURITY INTEREST Recorded Oct 12, 2022
From: ANONOS IP LLC
To: ANKURA TRUST COMPANY, LLC
Reel/Frame 061395/0457 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 2, 2022
From: ANONOS INC.
To: ANONOS IP LLC
Reel/Frame 060978/0927 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 25, 2016
From: LAFEVER, MALCOLM GARY; MYERSON, TED N.; MASON, STEVEN
To: ANONOS INC.
Reel/Frame 038376/0733 →
Continuity (42)
Continuation In Part 14530304 · Oct 31, 2014
Continuation In Part 14529960 · Oct 31, 2014
Provisional Application 62087226 · Dec 3, 2014
Provisional Application 62110287 · Jan 30, 2015
Provisional Application 62112654 · Feb 6, 2015
Provisional Application 62118612 · Feb 20, 2015
Provisional Application 62127824 · Mar 3, 2015
Provisional Application 62153392 · Apr 27, 2015
Provisional Application 62154049 · Apr 28, 2015
Provisional Application 62161408 · May 14, 2015
Provisional Application 62164013 · May 20, 2015
Provisional Application 62174527 · Jun 12, 2015
Provisional Application 62181772 · Jun 19, 2015
Provisional Application 62183606 · Jun 23, 2015
Provisional Application 62189237 · Jul 7, 2015
Provisional Application 62193127 · Jul 16, 2015
Provisional Application 62199292 · Jul 31, 2015
Provisional Application 62203424 · Aug 11, 2015
Provisional Application 62210457 · Aug 27, 2015
Provisional Application 61899096 · Nov 1, 2013
Provisional Application 61938631 · Feb 11, 2014
Provisional Application 61941242 · Feb 18, 2014
Provisional Application 61944565 · Feb 25, 2014
Provisional Application 61945821 · Feb 27, 2014
Provisional Application 61948575 · Mar 6, 2014
Provisional Application 61969194 · Mar 23, 2014
Provisional Application 61974442 · Apr 3, 2014
Provisional Application 61988373 · May 5, 2014
Provisional Application 61992441 · May 13, 2014
Provisional Application 61994076 · May 15, 2014
Provisional Application 61994715 · May 16, 2014
Provisional Application 61994721 · May 16, 2014
Provisional Application 62001127 · May 21, 2014
Provisional Application 62015431 · Jun 21, 2014
Provisional Application 62019987 · Jul 2, 2014
Provisional Application 62037703 · Aug 15, 2014
Provisional Application 62043238 · Aug 28, 2014
Provisional Application 62045321 · Sep 3, 2014
Provisional Application 62051270 · Sep 16, 2014
Provisional Application 62055669 · Sep 26, 2014
Provisional Application 62059882 · Oct 4, 2014
Related Publication 20150379303A1 · Dec 31, 2015