CINXE.COM
Efficient Post-Quantum Pattern Matching on Encrypted Data
<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no"> <link href="/css/bootstrap/css/bootstrap.min.css" rel="stylesheet"> <script src="/css/bootstrap/js/bootstrap.bundle.min.js"></script> <title>Efficient Post-Quantum Pattern Matching on Encrypted Data</title> <link rel="stylesheet" href="/css/iacrcc.css"> <link rel="icon" type="image/png" href="/favicon.ico"> <style> div.authorname { font-weight: 500; margin-bottom: .3rem; } div.author { margin-bottom: 1rem; } span.keyword { font-weight: 500; } span.keyword a { color: black; } div.reference { margin-bottom: .5rem; } ol.bib li:before { margin-left: -1.5rem; content: "[" counter(bcounter) "] "; margin-right: .5rem; } ol.bib { list-style: none; counter-reset: bcounter; } ol.bib li { counter-increment: bcounter; margin-bottom: .5rem; } .card-header { background-color: #d1e7dd !important; } .authorlist { /* border: 1px solid #aaa; padding: 1rem; margin-bottom: 1rem; background-color: white;*/ } </style> <script> MathJax = { tex: { inlineMath: [['$', '$'], ['\\(', '\\)']], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEnvironments: false, processEscapes: true }, "HTML-CSS": { linebreaks: { automatic: true } } }; </script> <script id="MathJax-script" async src="/js/mathjax/tex-chtml.js"></script> <link rel="schema.DC" href="http://purl.org/dc/elements/1.1/"> <meta name="DC.Creator.PersonalName" content="Anis Bkakria"> <meta name="DC.Creator.PersonalName" content="Malika Izabachène"> <meta name="DC.Date.created" content="2024-07-08 15:12:34"> <meta name="DC.Date.dateSubmitted" content="2024-04-09"> <meta name="DC.Date.dateAccepted" content="2024-06-03"> <meta name="DC.Description" xml:lang="en" lang="en" content="<p>Pattern matching methods are essential in various applications where users must disclose highly sensitive information. Among these applications are genomic data analysis, financial records inspection, and intrusion detection processes, all of which necessitate robust privacy protection mechanisms. Balancing the imperative of protecting the confidentiality of analyzed data with the need for efficient pattern matching presents a significant challenge.</p><p>In this paper, we propose an efficient post-quantum secure construction that enables arbitrary pattern matching over encrypted data while ensuring the confidentiality of the data to be analyzed. In addition, we address scenarios where a malicious data sender, intended to send an encrypted content for pattern detection analysis, has the ability to modify the encrypted content. We adapt the data fragmentation technique to handle such a malicious sender. Our construction makes use of a well-suited Homomorphic Encryption packing method in the context of fragmented streams and combines homomorphic operations in a leveled mode (i.e. without bootstrapping) to obtain a very efficient pattern matching detection process.</p><p>In contrast to the most efficient state-of-the-art scheme, our construction achieves a significant reduction in the time required for encryption, decryption, and pattern matching on encrypted data. Specifically, our approach decreases the time by factors of $1850$, $10^6$, and $245$, respectively, for matching a single pattern, and by factors of $115$, $10^5$, and $12$, respectively, for matching $2^{10}$ patterns. </p>"> <meta name="DC.Format" content="application/pdf"> <meta name="DC.Identifier.DOI" content="10.62056/a09qxrxqi"> <meta name="DC.Identifier.URI" content="https://cic.iacr.org/p/1/2/22"> <meta name="DC.Language" content="en"> <meta name="DC.Rights" content="Copyright (c) 2023 held by author(s)"> <meta name="DC.Rights" content="https://creativecommons.org/licenses/by/4.0/"> <meta name="DC.Source" content="IACR Communications in Cryptology"> <meta name="DC.Source.ISSN" content="3006-5496"> <meta name="DC.Source.Issue" content="2"> <meta name="DC.Source.Volume" content="1"> <meta name="DC.Subject" xml:lang="en" lang="en" content="Pattern matching over encrypted strings"> <meta name="DC.Subject" xml:lang="en" lang="en" content="multiple distance computation"> <meta name="DC.Subject" xml:lang="en" lang="en" content="data fragmentation"> <meta name="DC.Title" content="Efficient Post-Quantum Pattern Matching on Encrypted Data"> <meta name="DC.Type" content="Text.Serial.Journal"> <meta name="DC.Type.articleType" content="Articles"> <meta name="citation_journal_title" content="IACR Communications in Cryptology"> <meta name="citation_journal_abbrev" content="CiC"> <meta name="citation_issn" content="3006-5496"><meta name="citation_author" content="Anis Bkakria"> <meta name="citation_author_institution" content="IRT SystemX"> <meta name="citation_author" content="Malika Izabachène"> <meta name="citation_author_institution" content="Unaffiliated"> <meta name="citation_title" content="Efficient Post-Quantum Pattern Matching on Encrypted Data"> <meta name="citation_language" content="en"> <meta name="citation_date" content="2024-07-08"> <meta name="citation_volume" content="1"> <meta name="citation_issue" content="2"> <meta name="citation_doi" content="10.62056/a09qxrxqi"> <meta name="citation_abstract_html_url" content="https://cic.iacr.org/p/1/2/22"> <meta name="citation_keywords" xml:lang="en" lang="en" content="Pattern matching over encrypted strings"><meta name="citation_keywords" xml:lang="en" lang="en" content="multiple distance computation"><meta name="citation_keywords" xml:lang="en" lang="en" content="data fragmentation"> <meta name="citation_pdf_url" content="https://cic.iacr.org/p/1/2/22/pdf"> </head> <body> <noscript> <h1 class="text-center">What a lovely hat</h1> <h4 class="text-center">Is it made out of <a href="https://iacr.org/tinfoil.html">tin foil</a>?</h4> </noscript> <div class="pageTop d-flex justify-content-md-around justify-content-between align-items-center"> <a href="https://iacr.org"><img id="logo" class="d-none d-lg-block ms-5" src="/images/iacrlogo_small.png" title="International Association for Cryptologic Research" alt="IACR logo"></a> <span class="headerTitle d-none d-md-block">Communications in Cryptology</span> <span class="headerTitle d-md-none">IACR CiC</span> <div class="dropdown ps-lg-2 me-5"> <button class="btn border-0" type="button" id="dropdownMenuButton1" data-bs-toggle="dropdown" aria-expanded="true"> <img src="/images/search.svg" class="searchIcon" alt="Search Button" style="width:33px;"> </button> <div id="searchDd" class="dropdown-menu dropdown-menu-end bg-transparent border-0" aria-labelledby="dropdownMenuButton1" data-bs-popper="none"> <form action="/search" method="GET" class="me-3"> <div class="input-group"> <input id="searchbox" name="q" type="search" class="form-control shadow-none" autocomplete="off" > <input type="hidden" name="d" value="/var/www/wsgi/cicjournal/webapp/search_index/xapian.db"> <button class="btn btn-outline-dark border border-dark input-group-append"> Search </button> </div> </form> <div id="results" class="bg-light"></div> </div> </div> </div> <nav id="sitenav" class="navbar navbar-expand-md"> <div class="container"> <button class="navbar-toggler" type="button" data-bs-toggle="collapse" data-bs-target="#collapseContent" aria-controls="collapseContent" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="collapse navbar-collapse" id="collapseContent"> <ul class="navbar-nav nav-fill w-100 justify-content-between"> <li class="nav-item"> <a class="nav-link active" aria-current="page" href="/">Home</a> </li> <li class="nav-item"> <a class="nav-link" href="/contents">Papers</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" role="button" data-bs-toggle="dropdown" aria-expanded="false"> Submissions </a> <ul class="dropdown-menu ms-3 ms-lg-5"> <li><a class="dropdown-item" href="/callforpapers">Call for papers</a></li> <li><a class="dropdown-item" href="/ethics">Publication ethics</a></li> <li><a class="dropdown-item" href="/irregular">Irregular submissions</a></li> <li><a class="dropdown-item" href="/conflicts">Conflict of interest</a></li> <li><a class="dropdown-item" href="/retraction">Retraction policy</a></li> </ul> </li> <li class="nav-item"> <a class="nav-link" href="/faq">FAQ</a> </li> <li class="nav-item"> <a class="nav-link" href="/contact">Contact</a> </li> <li class="nav-item"> <a class="nav-link" href="/board">Editorial board</a> </li> <li class="nav-item dropdown"> <a href="#" class="ms-md-5 nav-link dropdown-toggle" data-bs-toggle="dropdown"><img alt="Login" src="/images/user.svg"></a> <ul class="dropdown-menu"> <li><a href="/login" class="dropdown-item">Admin login</a></li> </ul> </li> </ul> </div> </div> </nav> <main id="mainContent" class="container"> <nav aria-label="breadcrumb" class="mt-3"> <ol class="breadcrumb"> <li class="breadcrumb-item"><a href="/">Home</a></li> <li class="breadcrumb-item"><a href="/v/1">Volume 1</a></li> <li class="breadcrumb-item"><a href="/i/1/2">Issue 2</a></li> <li class="breadcrumb-item active" aria-current="page">22</li> </ol> </nav> <h2>Efficient Post-Quantum Pattern Matching on Encrypted Data</h2> <div class="row mt-3"> <div class="col-12 col-md-8"> <h3 class="mt-2">Authors</h3> <div class="fs-4 mb-4 mt-2 d-flex justify-content-between flex-column flex-lg-row"> <div>Anis Bkakria, Malika Izabachène</div> <button role="button" aria-expanded="false" aria-controls="authorlist" class="ms-4 btn me-3 dropdown-toggle" data-bs-toggle="collapse" data-bs-target="#authorlist">Author Info</button> </div> <div id="authorlist" class="authorlist collapse"> <div class="author"> <div class="authorname">Anis Bkakria <a target="_blank" href="https://orcid.org/0000-0002-9758-4617"><img alt="ORCID" class="align-baseline orcidIcon" src="/images/orcid.svg"></a> </div> <div class="ms-4 mb-2"> IRT SystemX, France<br> <span class="font-monospace">anis dot bkakria at irt-systemx dot fr</span> </div> </div> <div class="author"> <div class="authorname">Malika Izabachène <a target="_blank" href="https://orcid.org/0000-0003-0216-7958"><img alt="ORCID" class="align-baseline orcidIcon" src="/images/orcid.svg"></a> </div> <div class="ms-4 mb-2"> Unaffiliated, France<br> <span class="font-monospace">malika dot izabachene at gmail dot com</span> </div> </div> </div> <div class="mb-3"> <strong class="fs-4">Keywords: </strong> <span class="badge p-2 text-bg-light keyword ms-2 my-1" alt="Pattern matching over encrypted strings" title="Pattern matching over encrypted strings"><a href="/search?q=Pattern%20matching%20over%20encrypted%20strings">Pattern matching over encrypted strings</a></span> <span class="badge p-2 text-bg-light keyword ms-2 my-1" alt="multiple distance computation" title="multiple distance computation"><a href="/search?q=multiple%20distance%20computation">multiple distance computation</a></span> <span class="badge p-2 text-bg-light keyword ms-2 my-1" alt="data fragmentation" title="data fragmentation"><a href="/search?q=data%20fragmentation">data fragmentation</a></span> </div> <h3 class="mt-4">Abstract</h3> <p><p>Pattern matching methods are essential in various applications where users must disclose highly sensitive information. Among these applications are genomic data analysis, financial records inspection, and intrusion detection processes, all of which necessitate robust privacy protection mechanisms. Balancing the imperative of protecting the confidentiality of analyzed data with the need for efficient pattern matching presents a significant challenge.</p><p>In this paper, we propose an efficient post-quantum secure construction that enables arbitrary pattern matching over encrypted data while ensuring the confidentiality of the data to be analyzed. In addition, we address scenarios where a malicious data sender, intended to send an encrypted content for pattern detection analysis, has the ability to modify the encrypted content. We adapt the data fragmentation technique to handle such a malicious sender. Our construction makes use of a well-suited Homomorphic Encryption packing method in the context of fragmented streams and combines homomorphic operations in a leveled mode (i.e. without bootstrapping) to obtain a very efficient pattern matching detection process.</p><p>In contrast to the most efficient state-of-the-art scheme, our construction achieves a significant reduction in the time required for encryption, decryption, and pattern matching on encrypted data. Specifically, our approach decreases the time by factors of $1850$, $10^6$, and $245$, respectively, for matching a single pattern, and by factors of $115$, $10^5$, and $12$, respectively, for matching $2^{10}$ patterns. </p></p> <h3 class="mb-3">References</h3> <div class="d-flex"> <div style="min-width:9rem;">[ABC<sup>+</sup>08]</div> <div><div id="ref-abdalla2008searchable" class="bibitem">Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, and Haixia Shi. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions. <em>Journal of cryptology</em>, 21(3):350–391, 2008. DOI: <a href="https://doi.org/10.1007/S00145-007-9006-6">10.1007/S00145-007-9006-6</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Michel+Abdalla+Mihir+Bellare+Dario+Catalano+Eike+Kiltz+Tadayoshi+Kohno+Tanja+Lange+John+Malone-Lee+Gregory+Neven+Pascal+Paillier+Haixia+Shi+Searchable+encryption+revisited%3A+Consistency+properties%2C+relation+to+anonymous+IBE%2C+and+extensions+2008" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Michel+Abdalla+Mihir+Bellare+Dario+Catalano+Eike+Kiltz+Tadayoshi+Kohno+Tanja+Lange+John+Malone-Lee+Gregory+Neven+Pascal+Paillier+Haixia+Shi&title=Searchable+encryption+revisited%3A+Consistency+properties%2C+relation+to+anonymous+IBE%2C+and+extensions&submittedafter=2007&submittedbefore=2009" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[ACC<sup>+</sup>18]</div> <div><div id="ref-HomomorphicEncryptionSecurityStandard" class="bibitem">Martin Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, and Vinod Vaikuntanathan. Homomorphic Encryption Security Standard. Technical report, HomomorphicEncryption.org. November 2018.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Martin+Albrecht+Melissa+Chase+Hao+Chen+Jintai+Ding+Shafi+Goldwasser+Sergey+Gorbunov+Shai+Halevi+Jeffrey+Hoffstein+Kim+Laine+Kristin+Lauter+Satya+Lokam+Daniele+Micciancio+Dustin+Moody+Travis+Morrison+Amit+Sahai+Vinod+Vaikuntanathan+Homomorphic+Encryption+Security+Standard+2018" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Martin+Albrecht+Melissa+Chase+Hao+Chen+Jintai+Ding+Shafi+Goldwasser+Sergey+Gorbunov+Shai+Halevi+Jeffrey+Hoffstein+Kim+Laine+Kristin+Lauter+Satya+Lokam+Daniele+Micciancio+Dustin+Moody+Travis+Morrison+Amit+Sahai+Vinod+Vaikuntanathan&title=Homomorphic+Encryption+Security+Standard&submittedafter=2017&submittedbefore=2019" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[APS15]</div> <div><div id="ref-EPRINT:AlbPlaSco15" class="bibitem">Martin R. Albrecht, Rachel Player, and Sam Scott. <a href="http://www.degruyter.com/view/j/jmc.2015.9.issue-3/jmc-2015-0016/jmc-2015-0016.xml">On the concrete hardness of Learning with Errors</a>. <em>Journal of Mathemtical Cryptology</em>, 9(3):169–203, 2015. DOI: <a href="https://doi.org/10.1515/jmc-2015-0016">10.1515/jmc-2015-0016</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Martin+R.+Albrecht+Rachel+Player+Sam+Scott+On+the+concrete+hardness+of+Learning+with+Errors+2015" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Martin+R.+Albrecht+Rachel+Player+Sam+Scott&title=On+the+concrete+hardness+of+Learning+with+Errors&submittedafter=2014&submittedbefore=2016" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[BCC20]</div> <div><div id="ref-bkakria2020privacy" class="bibitem">Anis Bkakria, Nora Cuppens, and Frédéric Cuppens. Privacy-Preserving Pattern Matching on Encrypted Data. In <em>International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020, (Part II)</em>, volume 12492, pages 191–220. 2020. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-030-64834-3_7">https://doi.org/10.1007/978-3-030-64834-3_7</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Anis+Bkakria+Nora+Cuppens+Fr%C3%A9d%C3%A9ric+Cuppens+Privacy-Preserving+Pattern+Matching+on+Encrypted+Data+2020" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Anis+Bkakria+Nora+Cuppens+Fr%C3%A9d%C3%A9ric+Cuppens&title=Privacy-Preserving+Pattern+Matching+on+Encrypted+Data&submittedafter=2019&submittedbefore=2021" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[BCS21]</div> <div><div id="ref-bouscatie2021public" class="bibitem">Elie Bouscatié, Guilhem Castagnos, and Olivier Sanders. Public Key Encryption with Flexible Pattern Matching. In <em>Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part IV</em>, volume 13093 of <em>Lecture Notes in Computer Science</em>, pages 342–370. 2021. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-030-92068-5_12">https://doi.org/10.1007/978-3-030-92068-5_12</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Elie+Bouscati%C3%A9+Guilhem+Castagnos+Olivier+Sanders+Public+Key+Encryption+with+Flexible+Pattern+Matching+2021" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Elie+Bouscati%C3%A9+Guilhem+Castagnos+Olivier+Sanders&title=Public+Key+Encryption+with+Flexible+Pattern+Matching&submittedafter=2020&submittedbefore=2022" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[BCS23]</div> <div><div id="ref-bouscatie2023pattern" class="bibitem">Elie Bouscatié, Guilhem Castagnos, and Olivier Sanders. Pattern Matching in Encrypted Stream from Inner Product Encryption. In <em>Public-Key Cryptography - PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7-10, 2023, Proceedings, Part I</em>, volume 13940 of <em>Lecture Notes in Computer Science</em>, pages 774–801. 2023. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-031-31368-4_27">https://doi.org/10.1007/978-3-031-31368-4_27</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Elie+Bouscati%C3%A9+Guilhem+Castagnos+Olivier+Sanders+Pattern+Matching+in+Encrypted+Stream+from+Inner+Product+Encryption+2023" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Elie+Bouscati%C3%A9+Guilhem+Castagnos+Olivier+Sanders&title=Pattern+Matching+in+Encrypted+Stream+from+Inner+Product+Encryption&submittedafter=2022&submittedbefore=2024" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[Bra12]</div> <div><div id="ref-C:Brakerski12" class="bibitem">Zvika Brakerski. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In <em>Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings</em>, volume 7417 of <em>Lecture Notes in Computer Science</em>, pages 868–886. 2012. Springer. DOI: <a href="https://doi.org/10.1007/978-3-642-32009-5_50">10.1007/978-3-642-32009-5_50</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Zvika+Brakerski+Fully+Homomorphic+Encryption+without+Modulus+Switching+from+Classical+GapSVP+2012" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Zvika+Brakerski&title=Fully+Homomorphic+Encryption+without+Modulus+Switching+from+Classical+GapSVP&submittedafter=2011&submittedbefore=2013" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[BSW11]</div> <div><div id="ref-boneh2011functional" class="bibitem">Dan Boneh, Amit Sahai, and Brent Waters. Functional encryption: Definitions and challenges. In <em>Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings</em>, volume 6597 of <em>Lecture Notes in Computer Science</em>, pages 253–273. 2011. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-642-19571-6_16">https://doi.org/10.1007/978-3-642-19571-6_16</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Dan+Boneh+Amit+Sahai+Brent+Waters+Functional+encryption%3A+Definitions+and+challenges+2011" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Dan+Boneh+Amit+Sahai+Brent+Waters&title=Functional+encryption%3A+Definitions+and+challenges&submittedafter=2010&submittedbefore=2012" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[CDK<sup>+</sup>17]</div> <div><div id="ref-canard2017blindids" class="bibitem">Sébastien Canard, Aïda Diop, Nizar Kheir, Marie Paindavoine, and Mohamed Sabt. BlindIDS: Market-compliant and privacy-friendly intrusion detection system over encrypted traffic. In <em>Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2017</em>, pages 561–574. 2017. ACM. DOI: <a href="https://doi.org/https://doi.org/10.1145/3052973.3053013">https://doi.org/10.1145/3052973.3053013</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=S%C3%A9bastien+Canard+A%C3%AFda+Diop+Nizar+Kheir+Marie+Paindavoine+Mohamed+Sabt+BlindIDS%3A+Market-compliant+and+privacy-friendly+intrusion+detection+system+over+encrypted+traffic+2017" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=S%C3%A9bastien+Canard+A%C3%AFda+Diop+Nizar+Kheir+Marie+Paindavoine+Mohamed+Sabt&title=BlindIDS%3A+Market-compliant+and+privacy-friendly+intrusion+detection+system+over+encrypted+traffic&submittedafter=2016&submittedbefore=2018" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[CPST15]</div> <div><div id="ref-canard2015divisible" class="bibitem">Sébastien Canard, David Pointcheval, Olivier Sanders, and Jacques Traoré. Divisible e-cash made practical. In <em>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography</em>, volume 9020 of <em>Lecture Notes in Computer Science</em>, pages 77–100. 2015. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-662-46447-2_4">https://doi.org/10.1007/978-3-662-46447-2_4</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=S%C3%A9bastien+Canard+David+Pointcheval+Olivier+Sanders+Jacques+Traor%C3%A9+Divisible+e-cash+made+practical+2015" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=S%C3%A9bastien+Canard+David+Pointcheval+Olivier+Sanders+Jacques+Traor%C3%A9&title=Divisible+e-cash+made+practical&submittedafter=2014&submittedbefore=2016" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[CS15]</div> <div><div id="ref-chase2015substring" class="bibitem">Melissa Chase and Emily Shen. Substring-Searchable Symmetric Encryption.. <em>Proc. Priv. Enhancing Technol.</em>, 2015(2):263–281, 2015. DOI: <a href="https://doi.org/10.1515/POPETS-2015-0014">10.1515/POPETS-2015-0014</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Melissa+Chase+Emily+Shen+Substring-Searchable+Symmetric+Encryption.+2015" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Melissa+Chase+Emily+Shen&title=Substring-Searchable+Symmetric+Encryption.&submittedafter=2014&submittedbefore=2016" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[DFOS18]</div> <div><div id="ref-DFOS2018" class="bibitem">Nicolas Desmoulins, Pierre-Alain Fouque, Cristina Onete, and Olivier Sanders. Pattern matching on encrypted streams. In <em>International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2018, Proceedings, (Part I)</em>, volume 11272 of <em>Lecture Notes in Computer Science</em>, pages 121–148. 2018. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-030-03326-2_5">https://doi.org/10.1007/978-3-030-03326-2_5</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Nicolas+Desmoulins+Pierre-Alain+Fouque+Cristina+Onete+Olivier+Sanders+Pattern+matching+on+encrypted+streams+2018" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Nicolas+Desmoulins+Pierre-Alain+Fouque+Cristina+Onete+Olivier+Sanders&title=Pattern+matching+on+encrypted+streams&submittedafter=2017&submittedbefore=2019" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[FV12]</div> <div><div id="ref-EPRINT:FanVer12" class="bibitem">Junfeng Fan and Frederik Vercauteren. Somewhat Practical Fully Homomorphic Encryption. <a href="https://eprint.iacr.org/2012/144">https://eprint.iacr.org/2012/144</a>. Cryptology ePrint Archive, Report 2012/144. 2012.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Junfeng+Fan+Frederik+Vercauteren+Somewhat+Practical+Fully+Homomorphic+Encryption+2012" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Junfeng+Fan+Frederik+Vercauteren&title=Somewhat+Practical+Fully+Homomorphic+Encryption&submittedafter=2011&submittedbefore=2013" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[Gen09a]</div> <div><div id="ref-gentry2009fully+" class="bibitem">Craig Gentry. <em>A fully homomorphic encryption scheme</em>. Stanford university, url: 2009.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Craig+Gentry+A+fully+homomorphic+encryption+scheme+2009" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Craig+Gentry&title=A+fully+homomorphic+encryption+scheme&submittedafter=2008&submittedbefore=2010" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[Gen09b]</div> <div><div id="ref-gentry2009fully" class="bibitem">Craig Gentry. Fully homomorphic encryption using ideal lattices. In <em>Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009</em>, pages 169–178. 2009. ACM. DOI: <a href="https://doi.org/10.1145/1536414.1536440">10.1145/1536414.1536440</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Craig+Gentry+Fully+homomorphic+encryption+using+ideal+lattices+2009" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Craig+Gentry&title=Fully+homomorphic+encryption+using+ideal+lattices&submittedafter=2008&submittedbefore=2010" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[KMO18]</div> <div><div id="ref-kamara2018structured" class="bibitem">Seny Kamara, Tarik Moataz, and Olya Ohrimenko. Structured encryption and leakage suppression. In <em>Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Proceedings, Part I</em>, volume 10991 of <em>Lecture Notes in Computer Science</em>, pages 339–370. 2018. Springer. DOI: <a href="https://doi.org/https://doi.org/10.1007/978-3-319-96884-1_12">https://doi.org/10.1007/978-3-319-96884-1_12</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Seny+Kamara+Tarik+Moataz+Olya+Ohrimenko+Structured+encryption+and+leakage+suppression+2018" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Seny+Kamara+Tarik+Moataz+Olya+Ohrimenko&title=Structured+encryption+and+leakage+suppression&submittedafter=2017&submittedbefore=2019" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[PSJNB11]</div> <div><div id="ref-pereira2011family" class="bibitem">Geovandro CCF Pereira, Michael Simplício Jr Marcos A and Naehrig, and Paulo SLM Barreto. A family of implementation-friendly BN elliptic curves. <em>Journal of Systems and Software</em>, 84(8):1319–1326, 2011. DOI: <a href="https://doi.org/10.1016/J.JSS.2011.03.083">10.1016/J.JSS.2011.03.083</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Geovandro+CCF+Pereira+Michael+Simpl%C3%ADcio+Jr+Marcos+A+and+Naehrig+Paulo+SLM+Barreto+A+family+of+implementation-friendly+BN+elliptic+curves+2011" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Geovandro+CCF+Pereira+Michael+Simpl%C3%ADcio+Jr+Marcos+A+and+Naehrig+Paulo+SLM+Barreto&title=A+family+of+implementation-friendly+BN+elliptic+curves&submittedafter=2010&submittedbefore=2012" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[SEA22]</div> <div><div id="ref-sealcrypto" class="bibitem"> Microsoft SEAL (release 4.0). Microsoft Research, Redmond, WA.. <a href="https://github.com/Microsoft/SEAL">https://github.com/Microsoft/SEAL</a>. March 2022.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=+Microsoft+SEAL+%28release+4.0%29+2022" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&title=Microsoft+SEAL+%28release+4.0%29&submittedafter=2021&submittedbefore=2023" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[SLPR15]</div> <div><div id="ref-sherry2015blindbox" class="bibitem">Justine Sherry, Chang Lan, Raluca Ada Popa, and Sylvia Ratnasamy. Blindbox: Deep packet inspection over encrypted traffic. In <em>Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, SIGCOMM 2015, London, United Kingdom</em>, pages 213–226. 2015. ACM. DOI: <a href="https://doi.org/https://doi.org/10.1145/2785956.2787502">https://doi.org/10.1145/2785956.2787502</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Justine+Sherry+Chang+Lan+Raluca+Ada+Popa+Sylvia+Ratnasamy+Blindbox%3A+Deep+packet+inspection+over+encrypted+traffic+2015" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Justine+Sherry+Chang+Lan+Raluca+Ada+Popa+Sylvia+Ratnasamy&title=Blindbox%3A+Deep+packet+inspection+over+encrypted+traffic&submittedafter=2014&submittedbefore=2016" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[SNO98]</div> <div><div id="ref-snort" class="bibitem">SNORT. <a href="https://www.snort.org/">Snort - Network Intrusion Detection & Prevention System</a>. 1998.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=SNORT+Snort+-+Network+Intrusion+Detection+%26+Prevention+System+1998" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=SNORT&title=Snort+-+Network+Intrusion+Detection+%26+Prevention+System&submittedafter=1997&submittedbefore=1999" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[SWP00]</div> <div><div id="ref-song2000practical" class="bibitem">Dawn Xiaoding Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In <em>Proceeding 2000 IEEE symposium on security and privacy. S&P 2000</em>, pages 44–55, url:. 2000. IEEE. DOI: <a href="https://doi.org/10.1109/SECPRI.2000.848445">10.1109/SECPRI.2000.848445</a></div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Dawn+Xiaoding+Song+David+Wagner+Adrian+Perrig+Practical+techniques+for+searches+on+encrypted+data+2000" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Dawn+Xiaoding+Song+David+Wagner+Adrian+Perrig&title=Practical+techniques+for+searches+on+encrypted+data&submittedafter=1999&submittedbefore=2001" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[YSK<sup>+</sup>14]</div> <div><div id="ref-yasuda2014practical" class="bibitem">Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, and Takeshi Koshiba. Practical Packing Method in Somewhat Homomorphic Encryption. In Joaquin Garcia-Alfaro, Georgios Lioudakis, Nora Cuppens-Boulahia, Simon Foley, and William M. Fitzgerald, editors, <em>Data Privacy Management and Autonomous Spontaneous Security</em>, pages 34–50, Berlin, Heidelberg. 2014. Springer Berlin Heidelberg. </div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Masaya+Yasuda+Takeshi+Shimoyama+Jun+Kogure+Kazuhiro+Yokoyama+Takeshi+Koshiba+Practical+Packing+Method+in+Somewhat+Homomorphic+Encryption+2014" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Masaya+Yasuda+Takeshi+Shimoyama+Jun+Kogure+Kazuhiro+Yokoyama+Takeshi+Koshiba&title=Practical+Packing+Method+in+Somewhat+Homomorphic+Encryption&submittedafter=2013&submittedbefore=2015" target="_blank" class="ms-3">ePrint</a> </div> <div class="d-flex"> <div style="min-width:9rem;">[YSK<sup>+</sup>15]</div> <div><div id="ref-yasuda2015new" class="bibitem">Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, and Takeshi Koshiba. New packing method in somewhat homomorphic encryption and its applications. <em>Security and Communication Networks</em>, 8(13):2194–2213, 2015.</div></div> </div> <div class="text-end mb-4"> <a href="https://scholar.google.com/scholar?hl=en&q=Masaya+Yasuda+Takeshi+Shimoyama+Jun+Kogure+Kazuhiro+Yokoyama+Takeshi+Koshiba+New+packing+method+in+somewhat+homomorphic+encryption+and+its+applications+2015" target="_blank" class="ms-3">Google Scholar</a> <a href="https://eprint.iacr.org/search?relevance=on&authors=Masaya+Yasuda+Takeshi+Shimoyama+Jun+Kogure+Kazuhiro+Yokoyama+Takeshi+Koshiba&title=New+packing+method+in+somewhat+homomorphic+encryption+and+its+applications&submittedafter=2014&submittedbefore=2016" target="_blank" class="ms-3">ePrint</a> </div> </div> <div class="col-12 col-md-4"> <p class="mt-4"> <a class="btn btn-outline-dark" href="/p/1/2/22/pdf"><img alt="PDF" class="icon" src="/images/file-pdf.svg">PDF</a> <img style="margin-left: 1rem;max-width: 1.2rem;" src="/images/open_access.svg" title="Open access" alt="Open access"> </p> <div class="my-4"> <span class="fw-bold me-2">DOI:</span> <a href="https://doi.org/10.62056/a09qxrxqi">https://doi.org/10.62056/a09qxrxqi</a> </div> <div class="card mb-4"> <h5 class="card-header">History</h5> <div class="card-body"> <strong>Submitted</strong>: 2024-04-09<br> <strong>Accepted</strong>: 2024-06-03<br> <strong>Published</strong>: 2024-07-08<br> <!-- begin crossmark --> <script src="https://crossmark-cdn.crossref.org/widget/v2.0/widget.js"></script> <a data-target="crossmark"><img style="margin-top:4px;" src="https://crossmark-cdn.crossref.org/widget/v2.0/logos/CROSSMARK_Color_horizontal.svg" width="150" /></a> <!-- end crossmark --> </div> </div> <div class="card mb-4"> <h5 class="card-header">How to cite</h5> <div class="card-body"> <p>Anis Bkakria and Malika Izabachène, Efficient Post-Quantum Pattern Matching on Encrypted Data. <span class="fst-italic">IACR Communications in Cryptology</span>, vol. 1, no. 2, Jul 08, 2024, doi: 10.62056/a09qxrxqi. </p> <button type="button" id="citationModalLabel" class="float-end btn btn-outline-dark" data-bs-toggle="modal" data-bs-target="#citationModal"> BibTeX, etc </button> </div> </div> <div class="card mb-4"> <h5 class="card-header">License</h5> <div class="card-body"> <p>Copyright is held by the author(s)</p> <p> This work is licensed under a <a target="_blank" href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution (CC BY)</a> license. </p> </div> </div> </div> </div> <div class="modal fade" id="citationModal" tabindex="-1" aria-labelledby="citationModalLabel" aria-hidden="true"> <div class="modal-dialog modal-xl"> <div class="modal-content"> <div class="modal-header"> <h1 class="modal-title fs-3">How to cite this</h1> <button type="button" class="btn-close" data-bs-dismiss="modal" aria-label="Close"></button> </div> <div class="modal-body p-4"> <ul class="nav nav-tabs" id="myTab" role="tablist"> <li class="nav-item" role="presentation"> <button class="nav-link active" id="bibtex-tab" data-bs-toggle="tab" data-bs-target="#bibtex-pane" type="button" role="tab" aria-controls="bibtex-pane" aria-selected="true">BibTeX</button> </li> <li class="nav-item" role="presentation"> <button class="nav-link" id="ris-tab" data-bs-toggle="tab" data-bs-target="#ris-pane" type="button" role="tab" aria-controls="ris-pane" aria-selected="false">RIS/Endnote/Zotero/Mendeley</button> </li> <li class="nav-item" role="presentation"> <button class="nav-link" id="text-tab" data-bs-toggle="tab" data-bs-target="#text-pane" type="button" role="tab" aria-controls="text-pane" aria-selected="false">Text</button> </li> </ul> <div class="tab-content p-4"> <div class="tab-pane active" id="bibtex-pane" role="tabpanel" aria-labelledby="bibtex-tab" tabindex="0"> <pre id="bib">@article{CiC-1-2-22, author = "Bkakria, Anis and Izabachène, Malika", journal = "{IACR} {C}ommunications in {C}ryptology", publisher = "{I}nternational {A}ssociation for {C}ryptologic {R}esearch", title = "Efficient Post-Quantum Pattern Matching on Encrypted Data", volume = "1", number = "2", date = "2024-07-08", year = "2024", issn = "3006-5496", doi = "10.62056/a09qxrxqi" } </pre> <button id="bibtexcopy" class="btn btn-sm btn-primary" aria-label="Copy to clipboard" onclick="copyMetadata('bibtexcopy', 'bib')">Copy to clipboard</button> <button id="bibtexdownload" class="ms-3 btn btn-sm btn-primary" aria-label="Download BibTeX .bib file" onclick="sendCitation('bib')">Download .bib file</button> </div> <div class="tab-pane" id="ris-pane" role="tabpanel" aria-labelledby="ris-tab" tabindex="0"> <pre id="ris">TY - JOUR AU - Bkakria, Anis AU - Izabachène, Malika PY - 2024 TI - Efficient Post-Quantum Pattern Matching on Encrypted Data JF - IACR Communications in Cryptology JA - CIC VL - 1 IS - 2 DO - 10.62056/a09qxrxqi UR - https://doi.org/10.62056/a09qxrxqi AB - <p>Pattern matching methods are essential in various applications where users must disclose highly sensitive information. Among these applications are genomic data analysis, financial records inspection, and intrusion detection processes, all of which necessitate robust privacy protection mechanisms. Balancing the imperative of protecting the confidentiality of analyzed data with the need for efficient pattern matching presents a significant challenge.</p><p>In this paper, we propose an efficient post-quantum secure construction that enables arbitrary pattern matching over encrypted data while ensuring the confidentiality of the data to be analyzed. In addition, we address scenarios where a malicious data sender, intended to send an encrypted content for pattern detection analysis, has the ability to modify the encrypted content. We adapt the data fragmentation technique to handle such a malicious sender. Our construction makes use of a well-suited Homomorphic Encryption packing method in the context of fragmented streams and combines homomorphic operations in a leveled mode (i.e. without bootstrapping) to obtain a very efficient pattern matching detection process.</p><p>In contrast to the most efficient state-of-the-art scheme, our construction achieves a significant reduction in the time required for encryption, decryption, and pattern matching on encrypted data. Specifically, our approach decreases the time by factors of $1850$, $10^6$, and $245$, respectively, for matching a single pattern, and by factors of $115$, $10^5$, and $12$, respectively, for matching $2^{10}$ patterns. </p> ER -</pre> <button id="riscopy" class="btn btn-sm btn-primary" aria-label="Copy to clipboard" onclick="copyMetadata('riscopy', 'ris')">Copy to clipboard</button> <button id="risdownload" class="ms-3 btn btn-sm btn-primary" aria-label="Download RIS file" onclick="sendCitation('ris')">Download .ris file</button> </div> <div class="tab-pane" id="text-pane" role="tabpanel" aria-labelledby="text-tab" tabindex="0"> <div class="w-75" id="textcitation">Anis Bkakria and Malika Izabachène, Efficient Post-Quantum Pattern Matching on Encrypted Data. <span class="fst-italic">IACR Communications in Cryptology</span>, vol. 1, no. 2, Jul 08, 2024, doi: 10.62056/a09qxrxqi.</div> <button id="textcopy" class="btn btn-sm btn-primary mt-3" aria-label="Copy to clipboard" onclick="copyMetadata('textcopy', 'textcitation')">Copy to clipboard</button> </div> </div> </div> <div class="modal-footer"> <button type="button" class="btn btn-secondary" data-bs-dismiss="modal">Close</button> </div> </div> </div> </div> <div class="modal fade" id="citationsModal" tabindex="-1" aria-labelledby="citationsModalLabel" aria-hidden="true"> <div class="modal-dialog modal-dialog-scrollable modal-lg"> <div class="modal-content"> <div class="modal-header"> <h1 class="modal-title fs-3">Known citations</h1> <button type="button" class="btn-close" data-bs-dismiss="modal" aria-label="Close"></button> </div> <div class="modal-body p-4"> <p> We do not crawl the web, so we are only able to identify citations from papers that are registered with a DOI in crossref.org and the publisher reports their citations to crossref, and crossref can identify a DOI from the reference. That includes (most) articles from Springer and many from ACM, but it excludes citations from USENIX because they don't issue DOIs. It also excludes citations from arxiv and eprint. You may find more citations in <a href="https://scholar.google.com/scholar?hl=en&q=Efficient+Post-Quantum+Pattern+Matching+on+Encrypted+Data">Google Scholar</a>. </p> <ol> </ol> </div> <div class="modal-footer"> <button type="button" class="btn btn-secondary" data-bs-dismiss="modal">Close</button> </div> </div> </div> </div> <script> function copyMetadata(buttid, id) { let range = document.createRange(); range.selectNode(document.getElementById(id)); window.getSelection().removeAllRanges(); window.getSelection().addRange(range); document.execCommand('copy'); window.getSelection().removeAllRanges(); const copyTooltip = new bootstrap.Tooltip('#' + buttid, {trigger: 'manual', title: 'Copied!'}); copyTooltip.show(); setTimeout(function() { copyTooltip.dispose(); }, 2000); } function sendCitation(typ) { // typ is 'bib' or 'ris' let data = document.getElementById(typ).innerHTML; atag = document.createElement('a'); atag.setAttribute('href', 'data:text/plain;charset=utf-8,' + encodeURIComponent(data)); atag.setAttribute('download', '1-2-22.' + typ); if (document.createEvent) { let event = document.createEvent('MouseEvents'); event.initEvent('click', true, true); atag.dispatchEvent(event); } else { atag.click(); } } </script> </main> <div class="container-fluid mt-auto" id="pageFooter"> </div> <footer class="text-center footer py-3"> <small> <a href="https://iacr.org/copyright.html">Copyright © 2025</a> <span class="d-none d-md-inline">by the </span><span class="d-md-none">IACR</span> <span class="d-none d-md-inline">International Association for Cryptologic Research</span> <span class="d-none d-md-inline">• </span><br class="d-md-none"> <a href="https://iacr.org/privacy.html">Privacy Policy</a> </small> </footer> <script id="results-template" type="text/x-handlebars-template"> <div class="p-3 shadow" style="margin-bottom:1rem;max-height:70vh;overflow-y:scroll"> <p>{{estimated_results}} results (if more than 100, then refine your query)</p> <ol> {{#each results}} <li role="presentation"><a href="{{url}}">{{title}}</a><br> {{#each authors }}{{this}}{{#unless @last}}, {{/unless}}{{/each}}</li> {{/each}} </ol> </div> </script> <script src="/static/js/handlebars-v4.7.7.js"></script> <script> var theTemplateScript = document.getElementById('results-template').innerHTML; var resultsTemplate = Handlebars.compile(theTemplateScript); var textinput = document.getElementById('searchbox'); // Returns a function, that, as long as it continues to be invoked, will not // be triggered. The function will be called after it stops being called for // N milliseconds. If `immediate` is passed, trigger the function on the // leading edge, instead of the trailing. function debounce(func, wait, immediate) { var timeout; return function() { var context = this, args = arguments; var later = function() { timeout = null; if (!immediate) func.apply(context, args); }; var callNow = immediate && !timeout; clearTimeout(timeout); timeout = setTimeout(later, wait); if (callNow) func.apply(context, args); }; }; let controller; let signal; var doSearch = debounce(function() { args = {'d': '/var/www/wsgi/cicjournal/webapp/search_index/xapian.db'} if (textinput.value) { args['q'] = textinput.value; if (controller !== undefined) { console.log('killing'); controller.abort(); } controller = new AbortController(); signal = controller.signal; let search_url = "https://cic.iacr.org/api/search" + "?" + new URLSearchParams(args); console.log(search_url); fetch(search_url, {signal}) .then((response) => response.json()) .then((data) => { console.log(data); let elem = document.getElementById('view'); if (elem) {elem.innerHTML = '';} if (data.results.length > 0) { document.getElementById('results').innerHTML = resultsTemplate(data); } else { document.getElementById('results').innerHTML = '<div class="p-3 shadow">no results</div>'; } controller = undefined; }).catch((error) => { console.log('error in fetch'); console.log(error); }); } else { console.log('no query'); } }, 500); // only after 250 ms. document.querySelectorAll('input').forEach((elem) => { elem.addEventListener('input', doSearch); }); </script> </body> </html>