Verifiable pattern matching on outsourced texts

DOI10.1016/j.jda.2018.08.002zbMath1412.68309OpenAlexW2896403162WikidataQ129085927 ScholiaQ129085927MaRDI QIDQ1757465

Dario Catalano, Simone Faro, Mario Di Raimondo

Publication date: 4 January 2019

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.08.002

zbMATH Keywords

design of algorithmsstring matchingexperimental resultsverified computationtext processingoutsourced texts

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Uses Software

• gmp
• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Simple deterministic wildcard matching
• Efficient string matching with k mismatches
• Verifiable Pattern Matching on Outsourced Texts
• Fully Homomorphic Message Authenticators
• The exact online string matching problem
• Homomorphic Signatures and Message Authentication Codes
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Homomorphic Signatures for Polynomial Functions
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Fast Pattern Matching in Strings
• Practical Homomorphic MACs for Arithmetic Circuits
• Faster Filters for Approximate String Matching
• Outsourced Pattern Matching
• Generalizing Homomorphic MACs for Arithmetic Circuits

This page was built for publication: Verifiable pattern matching on outsourced texts