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

.

##
###
On the Cryptographic Complexity of the Worst Functions
[chapter]

2014
*
Lecture Notes in Computer Science
*

We study the complexity of realizing the "worst" functions in several standard models of information-theoretic cryptography. In particular, for the case of security against passive adversaries, we obtain the following main results. -OT complexity of secure two-party computation. Every function f : [N ] × [N ] → {0, 1} can be securely evaluated using O(N 2/3 ) invocations of an oblivious transfer oracle. A similar result holds for securely sampling a uniform pair of outputs from a set S ⊆ [N

doi:10.1007/978-3-642-54242-8_14
fatcat:q3ccfhvn5jea5fnlvvqoydjhau