.png){kind=icon}
.png){kind=icon}
Return
Highly Efficient and Re-Executable Private Function Evaluation With Linear Complexity
.png){kind=icon}
OA
AI
DOI：10.1109/TDSC.2020.3009496.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Private function evaluation
secure 2-party computation
communication complexity
cryptographic protocol
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K
View more organizations