IP Library › Granted Patent US 12,591,692
Granted Patent B2
US 12,591,692 · App. 17/966,268 · Granted Mar 31, 2026

Methods for securing data

Inventors: David M. Bridges (Toms River, NJ); Ezekiel Kruglick (Poway, CA); Mitchell Mond (East Brunswick, NJ); Alex Devia (Live Oak, TX); Balram Singh (Manalapan, NJ); Timothy Werner Regewitz (Dunellen, NJ)
Assignee: PAPERCLIP, INC.
G06F21/602G06F16/221G06F16/90344G06F21/554G06F21/6218G06F2221/034
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,591,692
App. No.
17/966,268
Filed
Oct 14, 2022
Granted
Mar 31, 2026
Kind
B2
Art Unit
2408
USPC
713/193
Abstract

A method for securely processing data is provided. The method allows for processing data out of context to assure security and can use a combination of multiple encryptions, hashing techniques, homomorphic searching, two or more key owners and threat detection and response to further enhance the security of the data.

Claims (25)

1 . A method for securely searching encrypted data using compound searching, comprising the steps of:

processing with an SSE query analyzer comprising “AND”, “OR”, and nested queries;

receiving an SSE API search request that contains multiple data components;

using SSE encryption to detect a compound query syntax that triggers the SSE query analyzer;

separating a plurality of search data components into a first data value and at least a second data value;

processing the first data value;

wherein the SSE query analyzer processes SSE encryption steps once on the first data value;

wherein the SSE query analyzer decrypts an SSE index value of a tenant keyword table once revealing a first encrypted generation;

using the SSE index value to search the index ID of a tenant index table for a match;

using the SSE query analyzer to process accumulated row counts stored in temporary machine memory;

using the SSE query analyzer to process the SSE encryption steps once on the second data value;

using the SSE query analyzer to decrypt the SSE index value of the tenant keyword table once, revealing the first encrypted generation;

using the SSE index value used to search the index ID of the tenant index table for a match;

wherein the SSE query analyzer processes the accumulated row counts stored in temporary machine memory;

wherein the SSE query analyzer processes the accumulated row counts stored in temporary machine memory;

using the SSE query analyzer to sort the accumulated row counts and selecting the smallest number of accumulated row counts;

wherein the SSE query analyzer triggers the SSE encryption to process a first selected search data value and store its encrypted results in a first RAM temporary database;

using the SSE query analyzer to sort the accumulated row counts and selecting the second smallest number of accumulated row counts;

wherein the SSE Query Analyzer triggers the SSE encryption to process the second selected search data value using the first RAM temporary database to search and store its encrypted results in a second RAM temporary database; and

wherein the second RAM temporary database containing the index ID of the tenant index table is processed by the SSE encryption to decrypt the token ID of the tenant index table.

2 . The method of claim 1 , further comprising:

using random forest and machine learning to predict the accumulated row count selection.

3 . The method of claim 1 , further comprising:

receiving an SSE API search request that contains multiple data components; wherein SSE encryption detects the compound query syntax for an “OR” operation;

wherein SSE encryption processes each data component and stores results in one “n” RAM temporary database.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 23, 2023
From: BRIDGES, DAVID M.; KRUGLICK, EZEKIEL; MOND, MITCHELL; DEVIA, ALEX; SINGH, BALRAM; REGEWITZ, TIMOTHY
To: PAPERCLIP INC.
Reel/Frame 064076/0095 →
Continuity (3)
Provisional Application 63284833 · Dec 1, 2021
Provisional Application 63255738 · Oct 14, 2021
Related Publication 20230205896A1 · Jun 29, 2023
References Cited (26)
US 12045364B1 · Trepetin · 2024 [cited by examiner]
US 20140164774A1 · Nord · 2014 [cited by examiner]
US 20150039912A1 · Payton et al. · 2015 [cited by applicant]
US 20170061151A1 · Baessler et al. · 2017 [cited by applicant]
US 20180084008A1 · Turuvekere Nataraja · 2018 [cited by examiner]
US 20180157703A1 · Wang · 2018 [cited by examiner]
US 20180260469A1 · Paris et al. · 2018 [cited by applicant]
US 20200202036A1 · Baruch · 2020 [cited by examiner]
US 20200228322A1 · Bridges et al. · 2020 [cited by applicant]
US 20200382488A1 · Liu · 2020 [cited by examiner]
US 20210042305A1 · Barnes, II · 2021 [cited by applicant]
US 20210365413A1 · Shilane · 2021 [cited by examiner]
US 20220156303A1 · De Sousa Webber · 2022 [cited by examiner]
US 20220222366A1 · Nagaraja · 2022 [cited by examiner]
US 20240372562A1 · Cooper · 2024 [cited by examiner]
WO 2018039481A1 · 2018 [cited by applicant]
WO 2019136438A1 · 2019 [cited by applicant]
Seny Kamara, Dynamic Searchable Symmetric Encryption, 2012 (Year: 2012). [cited by examiner]
International Preliminary Report on Patentability dated Apr. 25, 2024 from corresponding International Patent Application No. PCT/US2022/046715, 8 pages. [cited by applicant]
International Search Report and Written Opinion dated Mar. 29, 2023 from corresponding International Patent Application No. PCT/US2022/046715, 11 pages. [cited by applicant]
Ahmadian et al.; “SecureNoSQL: An approach for secure search of encrypted NoSQL databases in the public cloud”, International Journal of Information Management 37.2, 2017, pp. 63-74. Retrieved on Mar. 7, 2023 from <http… [cited by applicant]
Brown University; “How to Search on Encrypted Data: Searchable Symmetric Encryption (Part 5)”, Encrypted Systems Lab. Aug. 2014, Retrieved on Mar. 7, 2023 from <https://esl.cs.brown.edu/blog/how-to-search-on-encrypted-d… [cited by applicant]
Partial European Search Report dated Aug. 8, 2025 from corresponding European Patent Application No. 22881834.0, 13 pages. [cited by applicant]
Gan Qingqing et al: “Dynamic Searchable 1-12 Symmetric Encryption with Forward and Backward Privacy: A Survey”, Dec. 10, 2019 (Dec. 10, 2019), pp. 37-52, XP047532092, [retrieved on Dec. 10, 2019]. [cited by applicant]
Leontiadis et al.; “Storage 1-12 Efficient Substring Searchable Symmetric Encryption”, IACR, International Association for Cryptologic Research, vol. 20170628:221707, Jun. 29, 2017, pp. 1-23, XP061023751, Retrieved from… [cited by applicant]
Mexico First Examination Search Report dated Sep. 30, 2025 from corresponding Mexican Patent Application No. 202417030101, 7 pages. [cited by applicant]