Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts

ePrint Report: Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts

David Heath, Vladimir Kolesnikov, Lucien K. L. Ng

Garbled Circuit (GC) is a basic technique for practical secure computation. GC handles Boolean circuits; it consumes significant network bandwidth to transmit encoded gate truth tables, each of which scales with the computational security parameter $\kappa$. GC optimizations that reduce bandwidth consumption are valuable.


It is natural to consider a generalization of Boolean two-input one-output gates (represented by $4$-row one-column lookup …

bandwidth basic computation eprint report network report secure computation tables truth vladimir