| 本文已被：浏览 4699次 下载 6535次 |
码上扫一扫！ |
|
|
| 基于可重随机化混淆电路的可验证计算 |
|
赵青松1,2,3, 曾庆凯1,2, 刘西蒙4,5, 徐焕良3
|
|
1.计算机软件新技术国家重点实验室(南京大学), 江苏 南京 210023;2.南京大学 计算机科学与技术系, 江苏 南京 210023;3.南京农业大学 信息科技学院, 江苏 南京 210095;4.福州大学 数学与计算机科学学院, 福建 福州 350117;5.School of Information Systems, Singapore Management University, Singapore 178902, Singapore
|
|
| 摘要: |
| Yao的混淆电路可用于客户端将函数计算外包给服务器，并可验证其正确性.然而，混淆电路仅能使用1次.Gennaro等人组合使用全同态加密和混淆电路，可实现客户端和服务器在多次输入上重用混淆电路.但是，所有已知的全同态加密在效率的提高上似乎仍有很大的空间，并且需要较强的困难性假设.另一方面，Gennaro等人的方案只能在敌手不能对客户端发起任何数量的验证查询这种较弱的模型下被证明是安全的.部分同态加密的困难性假设要弱于全同态加密，虽然只支持数量有限的同态操作，但比全同态加密运行速度更快、更加紧凑.提出了一个使用加同态加密的可验证计算方案.它基于DDH假设，能够容忍任意数量的恶意验证查询，采用的主要技术是可重随机化的混淆电路.该技术可以实现重随机化的混淆电路分布与原有的混淆电路分布在计算上是不可区分的.另外，也给出了一种使用可重随机化的混淆电路构造密码转置防火墙方案，称为可重用密码转置防火墙.也就是说，混淆电路可生成1次，接下来，密码转置防火墙可安全地重随机化和重用多次. |
| 关键词: 可验证计算 可重随机化混淆电路 同态加密 密码转置防火墙 |
| DOI：10.13328/j.cnki.jos.005585 |
| 分类号: |
| 基金项目:国家自然科学基金（61772266，61572248，61431008，61702105） |
|
| Verifiable Computation Using Re-randomizable Garbled Circuits |
|
ZHAO Qing-Song1,2,3, ZENG Qing-Kai1,2, LIU Xi-Meng4,5, XU Huan-Liang3
|
|
1.State Key Laboratory for Novel Software Technology(Nanjing University), Nanjing 210023, China;2.Department of Computer Science and Technology, Nanjing University, Nanjing 210023, China;3.College of Information Science and Technology, Nanjing Agricultural University, Nanjing 210095, China;4.College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350117, China;5.School of Information Systems, Singapore Management University, Singapore 178902, Singapore
|
| Abstract: |
| Yao's garbled circuit allows a client to outsource a function computation to a server with verifiablity. Unfortunately, the garbled circuit suffers from a one-time usage. The combination of fully homomorphic encryption (FHE) and garbled circuits enables the client and the server to reuse the garbled circuit with multiple inputs (Gennaro et al.). However, there still seems to be a long way to go for improving the efficiency of all known FHE schemes and it need much stronger security assumption. On the other hand, the construction is only proven to be secure in a weaker model where an adversary can not issue any number of verification queries to the client. Somewhat homomorphic encryption schemes, whose assumptions are much weaker than the FHE schemes, support a limited number of homomorphic operations. However, they can be much faster and more compact than the FHE schemes. In this work, a verifiable computation scheme is presented which can tolerate any number of malicious verification queries with additively homomorphic encryption. The proposed technique comes from the construction of re-randomizable garbled circuits in which the distribution of the original garbled circuit is computationally indistinguishable from the re-randomized garbled circuit. The proposed scheme is based on the decisional Diffie-Hellman (DDH) assumption. A technique solution is also given to construct cryptographic reverse firewalls, which is called reusable cryptographic reverse firewalls, using re-randomizable garbled circuits. Namely, the solution allows garbled circuits to be generated once and then securely re-randomized for many times on cryptographic reverse firewalls. |
| Key words: verifiable computation re-randomizable garbled circuit homomorphic encryption cryptographic reverse firewall |
