Cryptology ePrint Archive: Report 2018/515

Highly Efficient and Reusable Private Function Evaluation with Linear Complexity

Osman Bicer and Muhammed Ali Bingol and Mehmet Sabir Kiraz and Albert Levi

Abstract: Private function evaluation aims to securely compute a function f (x_1 , . . ., x_n ) without leaking any information other than what is revealed by the output, where f is a private input of one of the parties (say Party_1) and x_i is a private input of the i-th party Party_i. In this work, we propose a novel and secure two-party private function evaluation (2PFE) scheme based on DDH assumption. Our scheme introduces a reusability feature that significantly improves the state-of-the-art. Accordingly, our scheme has two variants, one is utilized in the first evaluation of the function f, and the other is utilized in its subsequent evaluations. To the best of our knowledge, this is the first and most efficient special purpose PFE scheme that enjoys a reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.

Category / Keywords: cryptographic protocols / Private function evaluation, Secure 2-party computation, Communication complexity, Cryptographic protocol

Date: received 23 May 2018, last revised 10 Sep 2018

Contact author: obicer17 at ku edu tr

Available format(s): PDF | BibTeX Citation

Version: 20180910:203230 (All versions of this report)

Short URL: ia.cr/2018/515


[ Cryptology ePrint archive ]