An efficient protocol for oblivious DFA evaluation and applications

DOI10.1007/978-3-642-27954-6_25MaRDI QIDQ2890023zbMATH OpenOpenAlexFDO

Authors Payman Mohassel, Salman Niksefat, S. Sadeghian, Babak Sadeghiyan

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)

Recommendations

• Oblivious DFA evaluation on joint input and its applications
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Automata evaluation and text search protocols with simulation-based security
• Text search protocols with simulation based security
• Computationally secure pattern matching in the presence of malicious adversaries

Cites work

• A proof of security of Yao's protocol for two-party computation
• Advances in Cryptology - CRYPTO 2003
• An efficient protocol for oblivious DFA evaluation and applications
• Computationally secure pattern matching in the presence of malicious adversaries
• Efficient oblivious transfer protocols
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Evaluating Branching Programs on Encrypted Data
• Fast Pattern Matching in Strings
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• Text search protocols with simulation based security

Cited in

(9)

• Efficient and secure outsourced approximate pattern matching protocol
• Oblivious DFA evaluation on joint input and its applications
• Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
• Secure parameterized pattern matching
• An efficient protocol for oblivious DFA evaluation and applications
• Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
• Computationally secure pattern matching in the presence of malicious adversaries

Describes a project that uses

Uses Software

• TASTY

This page was built for publication: An efficient protocol for oblivious DFA evaluation and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890023)