Lower Bounds for Quantum Secure Function Evaluation Reductions

TL;DR

This paper establishes fundamental lower bounds on the efficiency of quantum secure function evaluation protocols, showing inherent limitations even with trusted randomness, in both asymptotic and non-asymptotic settings.

Contribution

It proves that secure implementation of non-trivial functions requires a minimum amount of resources, providing new lower bounds in quantum cryptography.

Findings

Bob can determine all function values from any correct, privacy-preserving implementation.

Lower bounds relate the efficiency of protocols to the entropy of trusted randomness.

Secure function evaluation inherently demands a minimum number of instances of cryptographic primitives.

Abstract

One-sided output secure function evaluation is a cryptographic primitive where the two mutually distrustful players, Alice and Bob, both have a private input to a bivariate function. Bob obtains the value of the function for the given inputs, while Alice receives no output. It is known that this primitive cannot be securely implemented if the two players only have access to noiseless classical and quantum communication. In this work, we first show that Bob can extract the function values for all his possible inputs from any implementation of a non-trivial function that is correct and preserves the privacy of Bob's input. Our result holds in the non-asymptotic setting where the players have finite resources and the error is a constant. Then we consider protocols for secure function evaluation in a setup where the two players have access to trusted distributed randomness as a resource. Building upon the first result, we prove a bound on the efficiency of such cryptographic reductions for any non-trivial function in terms of the conditional entropies of the trusted randomness. From this result, we can derive lower bounds on the number of instances of different variants of OT needed to securely implement a given function.