Verifiable Pattern Matching on Outsourced Texts

DOI10.1007/978-3-319-44618-9_18zbMath1478.68458OpenAlexW2508247577MaRDI QIDQ2827727

Dario Catalano, Simone Faro, Mario Di Raimondo

Publication date: 21 October 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_18

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32) Computer security (68M25)

Related Items (1)

Verifiable pattern matching on outsourced texts

Uses Software

• gmp
• NTL
• ADSNARK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic (trapdoor) one-way functions: constructions and applications
• Efficient string matching with k mismatches
• Computationally private randomizing polynomials and their applications
• Fully Homomorphic Message Authenticators
• Homomorphic Signatures with Efficient Verification for Polynomial Functions
• The exact online string matching problem
• Efficient Network Coding Signatures in the Standard Model
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• Homomorphic Signatures and Message Authentication Codes
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Homomorphic Signatures for Polynomial Functions
• Adaptive Pseudo-free Groups and Applications
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Homomorphic Network Coding Signatures in the Standard Model
• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
• Secure Network Coding over the Integers
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Fast Pattern Matching in Strings
• Algebraic (Trapdoor) One-Way Functions and Their Applications
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
• Practical Homomorphic MACs for Arithmetic Circuits
• Directed Transitive Signature Scheme
• Generalizing Homomorphic MACs for Arithmetic Circuits

This page was built for publication: Verifiable Pattern Matching on Outsourced Texts