Efficient string matching: an aid to bibliographic search
Communications of the ACM
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Average case analysis of the Boyer-Moore algorithm
Random Structures & Algorithms
Privacy preserving error resilient dna searching through oblivious automata
Proceedings of the 14th ACM conference on Computer and communications security
Secure Hamming Distance Based Computation and Its Applications
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Robust and fast pattern matching for intrusion detection
INFOCOM'10 Proceedings of the 29th conference on Information communications
SCiFI - A System for Secure Face Identification
SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
Secure text processing with applications to private DNA matching
Proceedings of the 17th ACM conference on Computer and communications security
Accelerating DNA analysis applications on GPU clusters
SASP '10 Proceedings of the 2010 IEEE 8th Symposium on Application Specific Processors (SASP)
Efficient and secure generalized pattern matching via fast fourier transform
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Countering GATTACA: efficient and secure testing of fully-sequenced human genomes
Proceedings of the 18th ACM conference on Computer and communications security
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
In this paper we consider the problem of secure pattern matching that allows single-character wildcards and substring matching in the malicious stand-alone setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general than traditionally considered and includes non-binary alphabets, non-binary Hamming distance and non-binary substring matching.5PM is the first secure expressive pattern matching protocol designed to optimize round complexity by carefully specifying the entire protocol round by round. 5PM requires only eight rounds in the malicious static corruptions model. In the malicious model, 5PM requires O((m+n)k2) communication complexity and O(m+n) encryptions, where m is the pattern length and n is the text length. Further, 5PM can hide pattern size with no asymptotic additional costs in either computation or bandwidth.