Efficient Oblivious Evaluation Protocol and Conditional Disclosure of Secrets for DFA

ePrint Report: Efficient Oblivious Evaluation Protocol and Conditional Disclosure of Secrets for DFA

Kittiphop Phalakarn, Nuttapong Attrapadung, Kanta Matsuura

In oblivious finite automata evaluation, one party holds a private automaton, and the other party holds a private string of characters. The objective is to let the parties know whether the string is accepted by the automaton or not, while keeping their inputs secret. The applications include DNA searching, pattern matching, and more. Most of the previous works are based on …

characters disclosure eprint report evaluation oblivious party private protocol report secrets