期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2012
卷号：2012
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：Yao's garbled circuit construction transforms a boolean circuit C:01n01m
into a ``garbled circuit'' C along with n pairs of k-bit keys, one for each
input bit, such that C together with the n keys
corresponding to an input x reveal C(x) and no additional information about x.
The garbled circuit construction is a central tool for constant-round secure computation and
has several other applications.
Motivated by these applications, we suggest an efficient arithmetic variant of Yao's original construction.
Our construction transforms an arithmetic circuit C:ZnZm over integers from a bounded (but possibly exponential)
range into a garbled circuit C along with n affine functions Li:ZZk such that C
together with the n integer vectors Li(xi) reveal C(x) and no additional information about x.
The security of our construction relies on the intractability of the learning with errors (LWE) problem.
