Cryptology ePrint Archive: Report 2016/695

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation

Ivan DamgŚrd and Jesper Buus Nielsen and Michael Nielsen and Samuel Ranellucci

Abstract: We propose a new protocol, nicknamed TinyTable, for maliciously secure 2-party computation in the preprocessing model. One version of the protocol is useful in practice and allows, for instance, secure AES encryption with latency about 1ms and amortized time about 0.5 $\mu$s per AES block on a fast cloud set-up. Another version is interesting from a theoretical point of view: we achieve a maliciously and unconditionally secure 2-party protocol in the preprocessing model for computing a Boolean circuit, where both the communication complexity and preprocessed data size needed is $O(s)$ where $s$ is the circuit size, while the computational complexity is $O(k^\epsilon s)$ where $k$ is the statistical security parameter and $\epsilon <1$ is a constant. For general circuits with no assumption on their structure, this is the best asymptotic performance achieved so far in this model.

Category / Keywords: implementation / secure two-party computation

Date: received 12 Jul 2016, last revised 28 Mar 2017

Contact author: jbn at cs au dk

Available format(s): PDF | BibTeX Citation

Note: Some typos were fixed.

Version: 20170328:150113 (All versions of this report)

Short URL: ia.cr/2016/695

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]