Round and Communication Balanced Protocols for Oblivious Evaluation of Finite State Machines
Institute of Technology, University of Washington Tacoma（华盛顿大学塔科马分校理工学院）；Faculty of Information Technology, Monash University（莫纳什大学信息技术学院）
英文摘要：
We propose protocols for obliviously evaluating finite-state machines, i.e., the evaluation is shared between the provider of the finite-state machine and the provider of the input string in such a manner that neither party learns the other's input, and the states being visited are hidden from both. For alphabet size $|Σ|$, number of states $|Q|$, and input length $n$, previous solutions have either required a number of rounds linear in $n$ or communication $Ω(n|Σ||Q|\log|Q|)$. Our solutions require 2 rounds with communication $O(n(|Σ|+|Q|\log|Q|))$. We present two different solutions to this problem, a two-party one and a setting with an untrusted but non-colluding helper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
