skip to main content
10.1145/2897845.2897906acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

Efficient Authenticated Multi-Pattern Matching

Published: 30 May 2016 Publication History

Abstract

Multi-pattern matching compares a large set of patterns against a given query string, which has wide application in various domains such as bio-informatics and intrusion detection. This paper shows how to authenticate the classic Aho-Corasick multi-pattern matching automation, without requiring the verifier to store the whole pattern set, nor downloading a proof for every single matching step. The storage complexity for the authentication metadata at the server side is the same as that of the unauthenticated version. The communication overhead is minimal since the proof size is linear in the query length and does not grow with the sizes of query result nor the pattern set. Our evaluation has shown that the query and verification times are practical.

References

[1]
Crypto++ Library. http://www.cryptopp.com. Accessed: 2015-Jul-11.
[2]
English Wordlists Source. http://www-01.sil.org/linguistics/wordlists/english. Accessed: 2015-Nov-11.
[3]
The PBC (Pairing-Based Cryptography) Library. https://crypto.stanford.edu/pbc. Accessed: 2015-Jul-11.
[4]
T. Acar, S. S. M. Chow, and L. Nguyen. Accumulators and U-Prove Revocation. In Financial Cryptography, pages 189--196, 2013.
[5]
A. V. Aho and M. J. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Commun. ACM, 18(6):333--340, 1975.
[6]
E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. In CRYPTO, pages 90--108, 2013.
[7]
E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security Symposium, pages 781--796, 2014.
[8]
E. Bertino, B. Carminati, E. Ferrari, B. M. Thuraisingham, and A. Gupta. Selective and Authentic Third-Party Distribution of XML Documents. IEEE Trans. Knowl. Data Eng., 16(10):1263--1278, 2004.
[9]
N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. From Extractable Collision Resistance to Succinct Non-interactive Arguments of Knowledge, and Back Again. In ACM ITCS, pages 326--349, 2012.
[10]
N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. Recursive Composition and Bootstrapping for SNARKS and Proof-carrying Data. In ACM STOC, pages 111--120, 2013.
[11]
N. Bitansky, A. Chiesa, Y. Ishai, R. Ostrovsky, and O. Paneth. Succinct Non-interactive Arguments via Linear Interactive Proofs. In Theory of Cryptography Conference (TCC), pages 315--333, 2013.
[12]
D. Boneh and X. Boyen. Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups. J. Cryptology, 21(2):149--177, 2008.
[13]
R. S. Boyer and J. S. Moore. A Fast String Searching Algorithm. Commun. ACM, 20(10):762--772, 1977.
[14]
B. Braun, A. J. Feldman, Z. Ren, S. T. V. Setty, A. J. Blumberg, and M. Walfish. Verifying Computations with State. In ACM SOSP, pages 341--357, 2013.
[15]
Y. Chen, S. S. M. Chow, K. Chung, R. W. F. Lai, W. Lin, and H. Zhou. Cryptography for Parallel RAM from Indistinguishability Obfuscation. In ACM ITCS, pages 179--190, 2016.
[16]
C. Costello, C. Fournet, J. Howell, M. Kohlweiss, B. Kreuter, M. Naehrig, B. Parno, and S. Zahur. Geppetto: Versatile Verifiable Computation. In IEEE Symp. on Security and Privacy, pages 253--270, 2015.
[17]
P. T. Devanbu, M. Gertz, and A. Kwong. Flexible Authentication of XML Documents. Journal of Computer Security, 12(6):841--864, 2004.
[18]
S. Faust, C. Hazay, and D. Venturi. Outsourced Pattern Matching. In ICALP, pages 545--556, 2013.
[19]
R. Gennaro, C. Gentry, and B. Parno. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. In CRYPTO, pages 465--482, 2010.
[20]
R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic Span Programs and Succinct NIZKs without PCPPs. In EUROCRYPT, pages 626--645, 2013.
[21]
T. Granlund and the GMP Development Team. The GNU Multiple Precision Arithmetic Library. https://gmplib.org, 2006. Accessed: 2015-Jul-11.
[22]
D. E. Knuth, J. H. M. Jr., and V. R. Pratt. Fast Pattern Matching in Strings. SIAM J. Comput., 6(2):323--350, 1977.
[23]
C. U. Martel, G. Nuckolls, P. T. Devanbu, M. Gertz, A. Kwong, and S. G. Stubblebine. A General Model for Authenticated Data Structures. Algorithmica, 39(1):21--41, 2004.
[24]
R. C. Merkle. A Certified Digital Signature. In CRYPTO, pages 218--238, 1989.
[25]
M. Naor and K. Nissim. Certificate Revocation and Certificate Update. IEEE Journal on Selected Areas in Communications, 18(4):561--570, 2000.
[26]
L. Nguyen. Accumulators from Bilinear Pairings and Applications. In CT-RSA, pages 275--292, 2005.
[27]
D. Papadopoulos, C. Papamanthou, R. Tamassia, and N. Triandopoulos. Practical Authenticated Pattern Matching with Optimal Proof Size. PVLDB, 8(7):750--761, 2015.
[28]
B. Parno, J. Howell, C. Gentry, and M. Raykova. Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symp. on Security and Privacy, pages 238--252, 2013.
[29]
S. T. V. Setty, B. Braun, V. Vu, A. J. Blumberg, B. Parno, and M. Walfish. Resolving the Conflict between Generality and Plausibility in Verified Computation. In EuroSys, pages 71--84, 2013.
[30]
S. T. V. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making Argument Systems for Outsourced Computation Practical (Sometimes). In NDSS, 2012.
[31]
V. Vu, S. T. V. Setty, A. J. Blumberg, and M. Walfish. A Hybrid Architecture for Interactive Verifiable Computation. In IEEE Symp. on Security and Privacy, pages 223--237, 2013.

Cited By

View all
  • (2024)Privacy-Preserving and Lightweight Verification of Deep Packet Inspection in CloudsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328210032:1(159-174)Online publication date: Feb-2024
  • (2023)Differentially Oblivious Two-Party Pattern Matching With Sublinear Round ComplexityIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.320675820:5(4101-4117)Online publication date: 1-Sep-2023
  • (2021)Suffix array for multi-pattern matching with variable length wildcardsIntelligent Data Analysis10.3233/IDA-20508725:2(283-303)Online publication date: 4-Mar-2021
  • Show More Cited By

Index Terms

  1. Efficient Authenticated Multi-Pattern Matching

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ASIA CCS '16: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security
    May 2016
    958 pages
    ISBN:9781450342339
    DOI:10.1145/2897845
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 May 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. authenticated data structure
    2. pattern matching
    3. verifiable computation

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    ASIA CCS '16
    Sponsor:

    Acceptance Rates

    ASIA CCS '16 Paper Acceptance Rate 73 of 350 submissions, 21%;
    Overall Acceptance Rate 418 of 2,322 submissions, 18%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Privacy-Preserving and Lightweight Verification of Deep Packet Inspection in CloudsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328210032:1(159-174)Online publication date: Feb-2024
    • (2023)Differentially Oblivious Two-Party Pattern Matching With Sublinear Round ComplexityIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.320675820:5(4101-4117)Online publication date: 1-Sep-2023
    • (2021)Suffix array for multi-pattern matching with variable length wildcardsIntelligent Data Analysis10.3233/IDA-20508725:2(283-303)Online publication date: 4-Mar-2021
    • (2021)Towards Dynamic Verifiable Pattern MatchingIEEE Transactions on Big Data10.1109/TBDATA.2018.28686577:2(421-435)Online publication date: 1-Jun-2021
    • (2019)Towards Verifiable Performance Measurement over In-the-Cloud MiddleboxesIEEE INFOCOM 2019 - IEEE Conference on Computer Communications10.1109/INFOCOM.2019.8737435(1162-1170)Online publication date: Apr-2019
    • (2018)Multi-pattern matching with variable-length wildcards using suffix treePattern Analysis & Applications10.5555/3288219.328824421:4(1151-1165)Online publication date: 1-Nov-2018
    • (2018)Multi-pattern matching with variable-length wildcards using suffix treePattern Analysis and Applications10.1007/s10044-018-0733-021:4(1151-1165)Online publication date: 25-Sep-2018
    • (2018)An Effective Content-Based Strategy Analysis for Large-Scale Deduplication Using a Multi-level Pattern-Matching AlgorithmInformation and Communication Technology for Intelligent Systems10.1007/978-981-13-1747-7_23(235-248)Online publication date: 15-Dec-2018
    • (2017)Privacy-Preserving Multi-pattern MatchingSecurity and Privacy in Communication Networks10.1007/978-3-319-59608-2_11(199-218)Online publication date: 14-Jun-2017

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media