论文标题
扩展与随机化：确保计算的代数方法
Expand-and-Randomize: An Algebraic Approach to Secure Computation
论文作者
论文摘要
我们在最小模型中考虑了安全的计算问题，在该模型中，爱丽丝和鲍勃各自拥有输入，并希望安全地计算其在卡罗尔的输入函数，而无需揭示有关输入的任何其他信息。对于这个最小的安全计算问题，我们提出了一种从两个步骤构建的新颖编码方案。首先，扩展了要计算的函数，以便可以在可能泄漏其他信息的同时恢复它。其次，将随机步骤应用于扩展的函数，以保护泄漏的信息得到保护。我们使用两个代数结构（有限场和整数环）实现了此扩展和随机化的编码方案，其中通过加法操作实现了扩展步骤，并且在相应代数结构上使用乘法操作实现了随机步骤。
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.
