An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates
| dc.cclicence | CC-BY-NC | en |
| dc.contributor.author | Bingol, Muhammed Ali | en |
| dc.contributor.author | Bicer, O. | en |
| dc.contributor.author | Kiraz, Mehmet Sabir | en |
| dc.contributor.author | Levi, A. | en |
| dc.date.acceptance | 2018-11-29 | en |
| dc.date.accessioned | 2019-02-14T12:23:09Z | |
| dc.date.available | 2019-02-14T12:23:09Z | |
| dc.date.issued | 2018-12-24 | |
| dc.description | The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link. | en |
| dc.description.abstract | Private function evaluation (PFE) is a special case of secure multi-party computation (MPC), where the function to be computed is known by only one party. PFE is useful in several real-life applications where an algorithm or a function itself needs to remain secret for reasons such as protecting intellectual property or security classification level. In this paper, we focus on improving 2-party PFE based on symmetric cryptographic primitives. In this respect, we look back at the seminal PFE framework presented by Mohassel and Sadeghian at Eurocrypt’13. We show how to adapt and utilize the well-known half gates garbling technique (Zahur et al., Eurocrypt’15) to their constant-round 2-party PFE scheme. Compared to their scheme, our resulting optimization significantly improves the efficiency of both the underlying Oblivious Evaluation of Extended Permutation (OEP) and secure 2-party computation (2PC) protocols, and yields a more than 40% reduction in overall communication cost (the computation time is also slightly decreased and the number of rounds remains unchanged). | en |
| dc.funder | N/A | en |
| dc.identifier.citation | Bingol, M.A., Bicer, O., Kiraz, M.S., Levi, A. (2018) An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates. The Computer Journal, 62 (4), pp. 598-613 | en |
| dc.identifier.doi | https://doi.org/10.1093/comjnl/bxy136 | |
| dc.identifier.uri | http://hdl.handle.net/2086/17550 | |
| dc.language.iso | en | en |
| dc.peerreviewed | Yes | en |
| dc.projectid | N/A | en |
| dc.publisher | Oxford University Press | en |
| dc.subject | Cryptographic protocol | en |
| dc.subject | Private function evaluation | en |
| dc.subject | Secure multi-party computation | en |
| dc.subject | Communication and computation | en |
| dc.title | An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates | en |
| dc.type | Article | en |