We derive algorithms for efficient secure numerical and logical operations in the semi-honest model ensuring statistical or perfect security for secure multi-party computation (MPC). To derive our algorithms for trigo...
详细信息
We derive algorithms for efficient secure numerical and logical operations in the semi-honest model ensuring statistical or perfect security for secure multi-party computation (MPC). To derive our algorithms for trigonometric functions, we use basic mathematical laws in combination with properties of the additive encryption scheme, ie. linear secret sharing, in a novel way for the JOS scheme [23]. For division and logarithm, we use a new approach to compute a Taylor series at a fixed point for all numbers. Our empirical evaluation yields speed-ups for local computation of more than a factor of 100 for some operations compared to the state-of-the-art. (C) 2017 Elsevier Ltd. All rights reserved.
client-server models enable computations to be hosted remotely on quantum servers. We present a novel protocol for realizing this task, with practical advantages when using technology feasible in the near term. client...
详细信息
client-server models enable computations to be hosted remotely on quantum servers. We present a novel protocol for realizing this task, with practical advantages when using technology feasible in the near term. client tasks are realized as linear combinations of operations implemented by the server, where the linear coefficients are hidden from the server. We report on an experimental demonstration of our protocol using linear optics, which realizes linear combination of two single-qubit operations by a remote single-qubit control. In addition, we explain when our protocol can remain efficient for larger computations, as well as some ways in which privacy can be maintained using our protocol.
A client wishes to outsource computation on confidential data to a network of servers. He does not trust a single server, but believes that multiple servers do not collude. To solve this problem we introduce a new sch...
详细信息
ISBN:
(纸本)9789897581960
A client wishes to outsource computation on confidential data to a network of servers. He does not trust a single server, but believes that multiple servers do not collude. To solve this problem we introduce a new scheme called JOS for perfect security in the semi-honest model that naturally requires at least three parties. It differs from classical secure multi-party computation (MPC) through three points: (i) a client-server setting, where all inputs and outputs are only known to the client;(ii) the use of three parties, where one party serves merely as "helper" for computation, but does not store any shares of a secret;(iii) distinct use of the distributive and associative nature of well-known linear encryption schemes to derive our protocols. We improve on the total amount of communication needed to compute both an AND and a multiplication compared to all prior schemes (even two party protocols), while matching round complexity or requiring only one more round. For big-data analysis, network bandwidth is often the most severe limitation, thus minimizing the amount of communication is essential. Therefore, we make an important step towards making MPC more practical. We also reduce the total amount of storage needed (eg. in a database setting) compared to all prior schemes using three parties. Our local computation requirements lag behind non-encrypted computation by less than an order of magnitude per party, while improving on other schemes, ie. GRR, by several orders of magnitude.
暂无评论