Cryptology ePrint Archive: Report 2017/1109

EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation

Nishanth Chandran and Divya Gupta and Aseem Rastogi and Rahul Sharma and Shardul Tripathi

Abstract: We present EZPC: a secure two-party computation (2PC) framework that generates efficient 2PC protocols from high-level, easy-to-write, programs. EZPC provides formal correctness and security guarantees while maintaining performance and scalability. Previous language frameworks, such as CBMC-GC, ObliVM, SMCL, and Wysteria, generate protocols that use either arithmetic or boolean circuits exclusively. Our compiler is the first to generate protocols that combine both arithmetic sharing and garbled circuits for better performance. We empirically demonstrate that the protocols generated by our framework match or outperform (up to 19x) recent works that provide hand-crafted protocols for various functionalities such as secure prediction and matrix factorization.

Category / Keywords: cryptographic protocols / Secure Computation, secure machine learning prediction

Date: received 13 Nov 2017

Contact author: divyagupta iitd at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20171120:141536 (All versions of this report)

Short URL: ia.cr/2017/1109

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]