Practical Protocols to Verifiably and Implicitly Ask Hidden Problems to Powerful Computing Servers

一种称为iraikeisan的交互计算技术，或对相对强大的服务器的可验证隐式请求，对于加快解决相对较弱的客户端拥有的秘密计算问题非常有用。在这个项目中，我们介绍了一种通用的Iraikeisan方法，它将给出关于NC-约简(或日志空间约简)的可验证P-完全问题的容易构造的方法论，例如线性规划问题的专用计算工具。主要结果包括：通用可验证隐式询问理论，线性规划问题的求解协议，基于(1)和(2)的实现。通过这个项目，我们得出结论：如果在将原始问题转化为要解决的问题时规模的扩大不是很严重，那么所提出的方法将是非常有效和实用的。

A class of interactive computation techniques called iraikeisan, or verifiable implicit asking to relatively powerful servers, is very useful to speed up solving secret computational problems owned by relatively powerless clients. In this project we introduced an approach for general purpose iraikeisan which will give methodology of readily constructing verifiable P-complete problems with respect to NC-reduction (or, log-space reduction), such as Linear programming problems, with special-purpose computing facility for them.Principal results include :A theory of general purpose verifiable implicit asking,A protocol for asking Linear Programming Problems,ImPlementation based on (1) and (2).Through this project we reached the conclusion that if the expansion of sizes when transforming the original problem to be solved could be not severe the proposed approach would be very effective and practical.