Invalidity dossier
US 9135456
Secure data parser method and system
Current assignee: International Business Machines Corporation
Added 5/14/2026, 6:01:14 AM
Active provider: Google · gemini-2.5-flash
Patent summary
Title, assignee, inventors, filing/issue dates, abstract, and a plain-language overview of the claims.
As of the current date, April 26, 2026, a search for US patent 9135456 in the CAFC 2026 dockets did not return any specific cases related to this patent. The provided PTAB case IPR2025-01202 is noted, but no corresponding CAFC appeal in 2026 dockets was found.
Here's a concise summary of US Patent 9135456:
Title: Secure data parser method and system
Assignee: Security First Innovations LLC
Inventors: Mark S. O'Hare, Rick L. Orsini, Roger S. Davenport, Steven Winick
Filing Date: 2014-08-29
Issue Date: 2015-09-15
Abstract: The patent describes a method and system for securing data from unauthorized access or use. This is achieved by parsing, splitting, or separating data into two or more portions. These portions can then be encrypted, and stored in one or multiple locations. The method also includes reconstituting or re-assembling the secured data into its original form for authorized access or use. The system may include a data splitting module, a cryptographic handling module, and a data assembly module.
Plain-language overview of independent claims:
- Claim 1 (Method): This claim describes a method for securing data by taking the data and dividing it into at least two separate parts or "portions." It also involves encrypting the data (which can happen before or after the splitting) and then storing these portions in at least two different locations. The method further includes a step to put these portions back together to restore the original data when authorized.
- Claim 11 (System): This claim outlines a system designed to secure data. It includes a "data splitting module" that divides data into at least two portions, and a "cryptographic handling module" that encrypts the data. The system also has at least two data storage facilities for keeping these portions in different places, and a "data assembly module" that can process the stored portions to reconstruct the original data.
- Claim 21 (System for facilitating cryptographic functions): This claim describes a cryptographic system that uses one or more secure servers (a "trust engine") to store cryptographic keys and user authentication data. It's designed so that users can access cryptographic functions through this trust engine without the actual private cryptographic keys ever being released to them. The system can associate users with specific keys, receive authentication data from users to verify their identity, and then perform cryptographic functions using those keys on the user's behalf, all while keeping the keys within the secure trust engine.
- Claim 30 (Method of storing data using random values): This claim details a method for storing data securely. It involves receiving data at a "trust engine," combining that data with a first random value to create a first combined value, and combining the data with a second random value to create a second combined value. It then creates a first pairing (of the first random value and the second combined value) and a second pairing (of the first random value and the second random value), storing these two pairings in separate secure data storage facilities.
- Claim 35 (Method of storing cryptographic data using random values): Similar to Claim 30, this claim focuses specifically on storing cryptographic data. It involves receiving cryptographic data at a "trust engine," combining it with a first random value to form a first combined value, and combining it with a second random value to form a second combined value. It then creates a first pairing (of the first random value and the second combined value) and a second pairing (of the first random value and the second random value), and stores these two pairings in distinct secure data storage facilities.
Generated 5/19/2026, 6:50:34 PM