Distributing any Elliptic Curve Based Protocol: With an Application to MixNets
Distributing any Elliptic Curve Based Protocol: With an Application to MixNets
复制标题
分发任何基于椭圆曲线的协议：在 MixNet 上的应用
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Y. Alaoui
中科院分区：
文献类型：
--
作者：
N. Smart;Y. Alaoui
我们展示了如何在椭圆曲线群E（K）的p阶子群上执行全阈值n方主动安全MPC协议。这是通过在预处理模型（例如SPDZ）中利用（mathbb {F}_p）上的全阈值n方主动安全MPC协议，然后将来自该协议的Beaver三元组本地映射到椭圆曲线的等效三元组来完成的。这使我们能够将椭圆曲线上的任何（代数）一方协议转换为n方协议。作为一个例子，我们展示了如何将一个一般的（varSigma）协议在椭圆曲线和洗牌协议的安倍晋三到一个n方协议。后者的应用程序要求我们也给MPC协议，从一个通用的置换，这可能是独立的利益，在Waksman网络中的开关。
We show how to perform a full-threshold n-party actively secure MPC protocol over a subgroup of order p of an elliptic curve group E(K). This is done by utilizing a full-threshold n-party actively secure MPC protocol over (mathbb {F}_p) in the pre-processing model (such as SPDZ), and then locally mapping the Beaver triples from this protocol into equivalent triples for the elliptic curve. This allows us to transform essentially any (algebraic) one-party protocol over an elliptic curve, into an n-party one. As an example we show how to transform a general (varSigma )-protocol over elliptic curves and the shuffle protocol of Abe into an n-party protocol. This latter application requires us to also give an MPC protocol to derive the switches in a Waksman network from a generic permutation, which may be of independent interest.