Highly efficient and re-executable private function evaluation with linear complexity

Warning The system is temporarily closed to updates for reporting purpose.

Biçer, Osman and Bingöl, Muhammed Ali and Kiraz, Mehmet Sabır and Levi, Albert (2020) Highly efficient and re-executable private function evaluation with linear complexity. IEEE Transactions on Dependable and Secure Computing . ISSN 1545-5971 (Print) 1941-0018 (Online) Published Online First http://dx.doi.org/10.1109/TDSC.2020.3009496

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/TDSC.2020.3009496


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 Party1) 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 the 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 initial execution 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 2PFE scheme that enjoys a reusability feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.

Item Type:Article
ID Code:40580
Deposited By:Albert Levi
Deposited On:22 Sep 2020 19:04
Last Modified:22 Sep 2020 19:04

Repository Staff Only: item control page