Expand-and-Randomize: An Algebraic Approach to Secure Computation.
Expand-and-Randomize: An Algebraic Approach to Secure Computation.
复制标题
DOI：
10.3390/e23111461
复制
发表时间：
2021-11-04
期刊：
影响因子：
--
通讯作者：
Sun H
中科院分区：
文献类型：
--
作者：
Zhao Y;Sun H
我们考虑最小模型中的安全计算问题，其中 Alice 和 Bob 各自持有一个输入，并希望在 Carol 处安全地计算其输入的函数，而不透露有关输入的任何其他信息。对于这个最小的安全计算问题，我们提出了一种由两个步骤构建的新颖的编码方案。首先，要计算的函数被扩展，以便在可能泄漏附加信息的同时可以恢复它。其次，对扩展函数应用随机化步骤，从而保护泄漏的信息。我们用两种代数结构——有限域和整数模环——来实现这种扩展和随机化编码方案，其中扩展步骤是通过加法运算实现的，随机化步骤是通过各自代数结构上的乘法运算实现的。
We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs. For this minimal secure computation problem, we propose a novel coding scheme built from two steps. First, the function to be computed is expanded such that it can be recovered while additional information might be leaked. Second, a randomization step is applied to the expanded function such that the leaked information is protected. We implement this expand-and-randomize coding scheme with two algebraic structures—the finite field and the modulo ring of integers, where the expansion step is realized with the addition operation and the randomization step is realized with the multiplication operation over the respective algebraic structures.