Welcome to the resource topic for 2016/695
Title:
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation
Authors: Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, 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.
ePrint: https://eprint.iacr.org/2016/695
Talk: https://www.youtube.com/watch?v=K5MUbtHFqH0
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .