Publication: Highly efficient and re-executable private function evaluation with linear complexity
Files
Program
KU-Authors
KU Authors
Co-Authors
Bingöl, Muhammed Ali
Kiraz, Mehmet Sabr
Levi, Albert
Publication Date
Language
Type
Embargo Status
NO
Journal Title
Journal ISSN
Volume Title
Alternative Title
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 ith party Party(i). 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 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 reusablity feature. Our protocols achieve linear communication and computation complexities and a constant number of rounds which is at most three.
Source
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Computer science, Hardware and architecture, Computer science, information systems, Software engineering
Citation
Has Part
Source
IEEE Transactions on Dependable and Secure Computing
Book Series Title
Edition
DOI
10.1109/TDSC.2020.3009496