Computationally secure pattern matching in the presence of malicious adversaries

DOI10.1007/S00145-013-9147-8zbMath1297.94075OpenAlexW2162113290MaRDI QIDQ744607

Carmit Hazay, Tomas Toft

Publication date: 25 September 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9147-8

zbMATH Keywords

pattern matchingmalicious adversarysimulation-based securitysecure two-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Efficient and secure outsourced approximate pattern matching protocol

Uses Software

• SCiFI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient secure two-party protocols. Techniques and constructions
• Security and composition of multiparty cryptographic protocols
• An Efficient Protocol for Oblivious DFA Evaluation and Applications
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• 5PM: Secure Pattern Matching
• Secure Database Commitments and Universal Arguments of Quasi Knowledge
• Compressed representations of sequences and full-text indexes
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
• Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• Sub-linear, Secure Comparison with Two Non-colluding Parties
• A fast string searching algorithm
• Proofs of Restricted Shuffles
• 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
• Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Space/time trade-offs in hash coding with allowable errors
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Information Security and Cryptology - ICISC 2005

This page was built for publication: Computationally secure pattern matching in the presence of malicious adversaries