US 12,254,110 B2
Searching, matching, and masking of composite formats
Ariel Farkash, Shimshit (IL); and Micha Gideon Moffie, Zichron Yaakov (IL)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Jun. 1, 2021, as Appl. No. 17/335,855.
Prior Publication US 2022/0391529 A1, Dec. 8, 2022
Int. Cl. G06F 21/62 (2013.01); G06F 16/2455 (2019.01); G06F 16/25 (2019.01); G06F 18/21 (2023.01); G06F 21/60 (2013.01); G06K 9/62 (2022.01); G06N 20/00 (2019.01)
CPC G06F 21/6227 (2013.01) [G06F 16/2456 (2019.01); G06F 16/258 (2019.01); G06F 18/217 (2023.01); G06F 21/602 (2013.01); G06N 20/00 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system, comprising a processor to:
generate regular expressions representing textual pattern facets of sub-formats of a composite format, and a regular expression representing a composite textual pattern of the composite format based on sub-format and composition type;
search data using the generated regular expressions representing composite textual patterns to detect an occurrence of a candidate match;
recursively match and validate the detected occurrence with the composite format and hierarchically match and validate sub-formats in the detected occurrence; and
mask in place the matched and validated occurrence of the composite format in the data using a rank-then-cipher based format preserving masking.