Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming
复制标题
I 类设计，III 类运行：使用整数编程的快速且可扩展的双线性类型转换
DOI：
10.1007/978-3-662-53015-3_14
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Miyako Ohkubo
中科院分区：
文献类型：
--
作者：
Masayuki Abe;Fumitaka Hoshino;Miyako Ohkubo
双线性类型转换是指将设计在以危险曲线为实例的对称群上的密码体制转换为运行在更安全、更有效的非对称群上的密码体制。本文介绍一种新的类型转换方法--IPConvusing 0-1 Programming。它使用广泛可用的IP求解器进行实例化，可以立即转换现有的复杂方案，并且可以处理涉及一千多个变量和数百个配对的大规模方案。这种快速且可扩展的方法为设计非对称双线性群上的加密方案提供了一种新方法。也就是说，设计者的工作，而不太关心计算的不对称性，但转换后的计划运行良好的非对称设置。我们展示了转换辅助设计的有用性，提出了一些反直观的例子，转换后的DLIN为基础的Groth-Sahai证明比手动构建的基于SXDH的证明更紧凑。
Bilinear type conversion is to convert cryptographic schemes designed over symmetric groups instantiated with imperilled curves into ones that run over more secure and efficient asymmetric groups. In this paper we introduce a novel type conversion method calledIPConvusing 0–1 Integer Programming. Instantiated with a widely available IP solver, it instantly converts existing intricate schemes, and can process large-scale schemes that involves more than a thousand variables and hundreds of pairings.Such a quick and scalable method allows a new approach in designing cryptographic schemes over asymmetric bilinear groups. Namely, designers work without taking much care about asymmetry of computation but the converted scheme runs well in the asymmetric setting. We demonstrate the usefulness of conversion-aided design by presenting somewhat counter-intuitive examples where converted DLIN-based Groth-Sahai proofs are more compact than manually built SXDH-based proofs.