A patent for string matching in security gates
US 10,681,007 B2, granted on 9 June 2020
Reference note by Armanas Povilionis-Muradian
On this page
Original work
String search and matching for gate functionality
- Type & status
- Patent · Granted patent
- Granted
- Inventors
- Maurizio Talamo; Franco Arcieri; Christian H. Schunck; Armanas Povilionis
- Venue
- United States Patent and Trademark Office
- Patent number
- US10681007B2
At a glance
A granted patent records joint work on data structures for efficient string matching in access-control infrastructure.
I am one of four named inventors of this patent, granted on 9 June 2020 and assigned to Konvax Corporation. It concerns string matching in firewalls, routers, load balancers and access-control applications.
These systems repeatedly compare incoming information with rule sets. Growing policies can increase the cost of matching and storing rules. The patent describes a data structure called a Bipartite Concatenated Representation, together with methods for organising and querying it.
For its packet-rule scenarios, the document presents matching performance largely independent of rule count and discusses storage growth. Those results depend on the described method and evaluation context.
The 2020 grant records joint work on an infrastructure problem: enforcing detailed security policies efficiently as rule sets expand.
Granted patent: Maurizio Talamo, Franco Arcieri, Christian H. Schunck and Armanas Povilionis. “String search and matching for gate functionality.” US 10,681,007 B2, 9 June 2020. Assignee: Konvax Corporation. Granted patent document.