Paper 2023/643
Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata
Abstract
Motivated by the privacy requirements in network intrusion detection and DNS policy checking, we have developed a suite of protocols and algorithms for regular expression matching with enhanced privacy:
- A new regular expression matching algorithm that is oblivious to the input strings, of which the complexity is only
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- regular expression pattern matchingzero knowledge proofsecure multi-party computationNFA
- Contact author(s)
-
ning luo @ northwestern edu
ckweng @ u northwestern edu
singjasp @ oregonstate edu
gefeitan @ u northwestern edu
ruzica piskac @ yale edu
marianar @ google com - History
- 2023-05-08: approved
- 2023-05-05: received
- See all versions
- Short URL
- https://ia.cr/2023/643
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/643, author = {Ning Luo and Chenkai Weng and Jaspal Singh and Gefei Tan and Ruzica Piskac and Mariana Raykova}, title = {Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/643}, year = {2023}, url = {https://eprint.iacr.org/2023/643} }