## Cryptology ePrint Archive: Report 2013/021

Rate-Limited Secure Function Evaluation

Özgür Dagdelen and Payman Mohassel and Daniele Venturi

Abstract: We introduce the notion of rate-limited secure function evaluation (RL-SFE). Loosely speaking, in an RL-SFE protocol participants can monitor and limit the number of distinct inputs (i.e., rate) used by their counterparts in multiple executions of an SFE, in a private and verifiable manner. The need for RL-SFE naturally arises in a variety of scenarios: e.g., it enables service providers to meter'' their customers' usage without compromising their privacy, or can be used to prevent oracle attacks against SFE constructions.

We consider three variants of RL-SFE providing different levels of security. As a stepping stone, we also formalize the notion of commit-first SFE (cf-SFE) wherein parties are committed to their inputs before each SFE execution. We provide compilers for transforming any cf-SFE protocol into each of the three RL-SFE variants. Our compilers are accompanied with simulation-based proofs of security in the standard model and show a clear tradeoff between the level of security offered and the overhead required. Moreover, motivated by the fact that in many client-server applications clients do not keep state, we also describe a general approach for transforming the resulting RL-SFE protocols into stateless ones.

As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first and instantiate efficient rate-limited variants of it.

Category / Keywords: foundations / secure function evaluation, secure metering, oracle attacks, oblivious polynomial evaluation

Original Publication (with major differences): IACR-PKC-2013

Date: received 13 Jan 2013, last revised 10 Mar 2016

Contact author: oezguer dagdelen at cased de

Available format(s): PDF | BibTeX Citation

Note: Full version.

Short URL: ia.cr/2013/021

[ Cryptology ePrint archive ]