How to Garble Arithmetic Circuits

SIAM Journal on Computing, Volume 43, Issue 2, 2014, Pages 905-929.

Cited by: 65|Bibtex|Views23|Links
EI
Keywords:
arithmetic circuitaffine functionbit keyadditional informationefficient arithmetic variantMore(14+)

Abstract:

Yao's garbled circuit construction transforms a boolean circuit $C:\{0,1\}^n\to\{0,1\}^m$ into a ``garbled circuit'' $\hat{C}$ along with $n$ pairs of $k$-bit keys, one for each input bit, such that $\hat{C}$ together with the $n$ keys corresponding to an input $x$ reveal $C(x)$ and no additional information about $x$. The garbled circuit...More

Code:

Data:

Your rating :
0

 

Tags
Comments