An Efficient Protocol for Oblivious DFA Evaluation and Applications

DOI10.1007/978-3-642-27954-6_25zbMath1292.94116OpenAlexW1838911907MaRDI QIDQ2890023

Salman Niksefat, Babak Sadeghiyan, Payman Mohassel, Saeed Sadeghian

Publication date: 8 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_25

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Secure parameterized pattern matching ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer ⋮ Efficient and secure outsourced approximate pattern matching protocol ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

Uses Software

• TASTY

Cites Work

• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• An Efficient Protocol for Oblivious DFA Evaluation and Applications
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
• Text Search Protocols with Simulation Based Security
• Evaluating Branching Programs on Encrypted Data
• Fast Pattern Matching in Strings
• Fully homomorphic encryption using ideal lattices
• Advances in Cryptology - CRYPTO 2003
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

This page was built for publication: An Efficient Protocol for Oblivious DFA Evaluation and Applications