	US 12,147,551 B1
	Secure data parser method and system
Mark S. O'Hare, Coto De Caza, CA (US); Rick L. Orsini, Flower Mound, TX (US); Roger Davenport, Campbell, TX (US); and Steven Winick, Roslyn Heights, NY (US)
Assigned to Security First Innovations, LLC, Ashburn, VA (US)
Filed by Security First Innovations, LLC, Ashburn, VA (US)
Filed on Jul. 23, 2024, as Appl. No. 18/781,806.
Application 18/781,806 is a continuation of application No. 18/229,122, filed on Aug. 1, 2023, granted, now 12,093,412.
Application 18/229,122 is a continuation of application No. 18/124,530, filed on Mar. 21, 2023, granted, now 11,734,437, issued on Aug. 22, 2023.
Application 18/124,530 is a continuation of application No. 17/347,268, filed on Jun. 14, 2021.
Application 17/347,268 is a continuation of application No. 16/658,506, filed on Oct. 21, 2019, granted, now 11,068,609, issued on Jul. 20, 2021.
Application 16/658,506 is a continuation of application No. 16/127,077, filed on Sep. 10, 2018, granted, now 10,452,854, issued on Oct. 22, 2019.
Application 16/127,077 is a continuation of application No. 14/546,887, filed on Nov. 18, 2014, granted, now 10,108,807, issued on Oct. 23, 2018.
Application 14/546,887 is a continuation of application No. 14/133,903, filed on Dec. 19, 2013, granted, now 9,317,705, issued on Apr. 19, 2016.
Application 14/133,903 is a continuation of application No. 13/668,433, filed on Nov. 5, 2012, granted, now 8,644,502, issued on Feb. 4, 2014.
Application 13/668,433 is a continuation of application No. 13/172,682, filed on Jun. 29, 2011, granted, now 8,320,560, issued on Nov. 27, 2012.
Application 13/172,682 is a continuation of application No. 11/602,667, filed on Nov. 20, 2006, granted, now 8,009,830, issued on Aug. 30, 2011.
Claims priority of provisional application 60/738,231, filed on Nov. 18, 2005.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 21/62 (2013.01); H04L 9/08 (2006.01); H04L 9/32 (2006.01); H04L 9/40 (2022.01)

CPC G06F 21/62 (2013.01) [H04L 9/085 (2013.01); H04L 9/3231 (2013.01); H04L 9/3247 (2013.01); H04L 63/0428 (2013.01); H04L 2209/56 (2013.01); H04L 2209/80 (2013.01)]

27 Claims

1. A method comprising:

obtaining, by a computer system, a key encryption key;

obtaining, by the computer system, a plurality of data blocks;

obtaining, by the computer system, a first data block of the plurality of data blocks, the first data block having first user data;

splitting, by the computer system, the first user data of the first data block into a first plurality of data portions, wherein each of the first plurality of data portions comprises less than all of the first user data, and wherein the first user data can be reassembled using two or more of the first plurality of data portions;

obtaining, by the computer system, a first plurality of data encryption keys which are distinct from each other;

encrypting, by the computer system, each of the first plurality of data portions with a respective one of the first plurality of data encryption keys to provide a first plurality of encrypted data portions;

encrypting, by the computer system, each of the first plurality of data encryption keys with the key encryption key to provide a first plurality of encrypted data encryption keys;

storing, by the computer system, each of the first plurality of encrypted data portions with a respective data indicative of a respective one of the first plurality of encrypted data encryption keys; and

storing, by the computer system, the key encryption key separate from the first plurality of encrypted data portions and the respective data indicative of the respective one of the first plurality of encrypted data encryption keys.