Sublinear Secure Computation from New Assumptions

ePrint Report: Sublinear Secure Computation from New Assumptions

Elette Boyle, Geoffroy Couteau, Pierre Meyer

Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output. A long-running challenge is understanding the required communication complexity of such protocols---in particular, when communication can be sublinear in the circuit representation size of the desired function. For certain functions, such as Private Information Retrieval (PIR), this question extends to even sublinearity in the …

beyond challenge communication complexity computation computational compute eprint report function functions information input inputs protocols question report representation secret secure computation size techniques understanding