Paper 2018/515 Original: eprint.iacr.org/2018/515 ↗
Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2020-07-13: last updated
- 2018-05-27: published
- Short URL
- https://ia.cr/2018/515
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/515,
author = {Osman Bicer and Muhammed Ali Bingol and Mehmet Sabir Kiraz and Albert Levi},
title = {Highly Efficient and Re-executable Private Function Evaluation with Linear Complexity},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/515},
year = {2018},
url = {https://eprint.iacr.org/2018/515}
}