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 $|\Sigma|$, number of states $|Q|$, and input length $n$, previous solutions have either required a number of rounds linear in $n$ or communication $\Omega(n|\Sigma||Q|\log|Q|)$. Our solutions require 2 rounds with communication $O(n(|\Sigma|+|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.
翻译：我们提议了不留意评估有限国家机器的程序,即,评估由有限国家机器的提供者和输入字符串的提供者共同进行,其方式是,双方都不学习对方的投入,而且所访问的国家两者都隐藏。对于字母大小$@Sigma ⁇ $、国家数$$$和输入长度$n,以前的解决办法要么需要若干轮线性线性以美元计算,要么需要通信$\Omega(n ⁇ Sigma ⁇ log ⁇ )$。我们的解决办法需要用2轮通信$(n)\\\\Sigma ⁇ ç ⁇ log}$(n)来解决这个问题。我们提出了两种不同的解决方案,一种是双方一,一种是不可信但非混杂的帮助器。
相关内容
Alphabet is mostly a collection of companies. This newer Google is a bit slimmed down, with the companies that are pretty far afield of our main internet products contained in Alphabet instead.https://abc.xyz/
微信扫码咨询专知VIP会员