Secure parameterized pattern matching
From MaRDI portal
Publication:2663480
DOI10.1016/J.INS.2020.02.046zbMath1458.68291OpenAlexW3007164656MaRDI QIDQ2663480
Behrouz Tork Ladani, Hamid Mala, M. Zarezadeh
Publication date: 19 April 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.02.046
simulation-based securitysecure computationprivacy-preservingparameterized pattern matchingsecure pattern matchingUC-secure
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient parameterized string matching
- Efficient secure two-party protocols. Techniques and constructions
- Generalization of a suffix tree for RNA structural pattern matching
- Parameterized pattern matching: Algorithms and applications
- Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
- An Efficient Protocol for Oblivious DFA Evaluation and Applications
- 5PM: Secure Pattern Matching
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Number-theoretic constructions of efficient pseudo-random functions
- Text Search Protocols with Simulation Based Security
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Fast Pattern Matching in Strings
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Information Security and Cryptology - ICISC 2005
This page was built for publication: Secure parameterized pattern matching
