We present the design and implementation of a compiler that automatically generates protocols that perform two-party computations. The input to our protocol is the specification of a computation with secret inputs (e.g., a signature algorithm) expressed using operations in the field Zq of integers modulo a prime q and in the multiplicative subgroup of order q in Z*p for q|p-1 with generator g. The output of our compiler is an implementation of each party in a two-party protocol to perform the same computation securely, i.e., so that both parties can together compute the function but neither can alone. The protocols generated by our compiler are provably secure, in that their strength can be reduced to that of the original cryptographic computation via simulation arguments. Our compiler can be applied to various cryptographic primitives (e.g., signature schemes, encryption schemes, oblivious transfer protocols) and other protocols that employ a trusted party (e.g.,key retrieval, key distribution).
展开▼
机译：我们介绍了编译器的设计和实现，该编译器会自动生成执行两方计算的协议。我们协议的输入是使用秘密输入（例如，签名算法）的计算规范，该秘密输入使用整数Z的域Z q 中的运算以质数q为模，并且以阶q的乘法子组表示用生成器g对q | p-1在Z * p 中。我们的编译器的输出是两方协议中各方的实现，以安全地执行相同的计算，即，使双方可以一起计算函数，但不能单独计算。由我们的编译器生成的协议可证明是安全的，因为可以通过仿真参数将其强度降低到原始密码计算的强度。我们的编译器可以应用于各种加密原语（例如，签名方案，加密方案，遗忘的传输协议）和采用受信任方的其他协议（例如，密钥检索，密钥分发）。
展开▼
