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

Bicer, Osman and Bingöl, Muhammed Ali and Kiraz, Mehmet Sabr and Levi, Albert (2022) Highly efficient and re-executable private function evaluation with linear complexity. IEEE Transactions on Dependable and Secure Computing, 19 (2). pp. 835-847. ISSN 1545-5971 (Print) 1941-0018 (Online)

This is the latest version of this item.

Full text not available from this repository. (Request a copy)


Private function evaluation aims to securely compute a function f(x_1, x_n)f(x1,...,xn) without leaking any information other than what is revealed by the output, where ff is a private input of one of the parties (say Party_1Party1) and x_ixi is a private input of the iith party Party_iPartyi. In this article, 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 ff, 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 reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.
Item Type: Article
Uncontrolled Keywords: communication complexity; cryptographic protocol; Private function evaluation; secure 2-party computation
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Albert Levi
Date Deposited: 23 Aug 2022 10:54
Last Modified: 23 Aug 2022 10:54
URI: https://research.sabanciuniv.edu/id/eprint/44110

Available Versions of this Item

Actions (login required)

View Item
View Item