Cryptology ePrint Archive: Report 2017/415

Towards Practical PFE: An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates

Osman Bicer and Muhammed Ali Bingol and Mehmet Sabir Kiraz and Albert Levi

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 settings where an algorithm or a function itself needs to remain secret due to its confidential classification or intellectual property. In this work, 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 considerably improves the efficiency of both the underlying Oblivious Evaluation of Extended Permutation (OEP) and secure 2-party computation (2PC) protocol, 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).

Category / Keywords: cryptographic protocols / Private function evaluation, Secure 2-party computation, Communication complexity, Cryptographic protocol.

Date: received 14 May 2017, last revised 15 May 2017

Contact author: osmnbicr at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170515:142430 (All versions of this report)

Short URL: ia.cr/2017/415

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]