A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Secure Arithmetic Computation with Constant Computational Overhead
[chapter]

2017
*
Lecture Notes in Computer Science
*

We study the complexity of securely evaluating an arithmetic circuit over a finite field F in the setting of secure two-party computation with semi-honest adversaries. In all existing protocols, the number of arithmetic operations per multiplication gate grows either linearly with log |F| or polylogarithmically with the security parameter. We present the first protocol that only makes a constant (amortized) number of field operations per gate. The protocol uses the underlying field F as a black

doi:10.1007/978-3-319-63688-7_8
fatcat:7cecwsbkwfhbxdvyre3ljh45ou