Computationally secure pattern matching in the presence of malicious adversaries

Keyphrases

• Malicious Adversary 100%
• Secure Pattern Matching 100%
• Pattern Matching 50%
• Communication Cost 50%
• Polynomial Time 50%
• Adversary 50%
• Matching Problem 50%
• Hamming Distance 50%
• Constant Rounds 50%
• Two-party 50%
• Round Complexity 50%
• Wildcard 50%
• Full Simulation 50%
• Semantically Secure 50%
• Computation Cost 50%
• ElGamal Encryption 50%

Computer Science

• Pattern Matching 100%
• Malicious Adversary 100%
• Communication Cost 33%
• Wildcard 33%
• Elgamal Encryption 33%
• Computation Cost 33%
• Polynomial Time 33%
• Hamming Distance 33%