Cryptology ePrint Archive: Report 2013/426

Efficient Garbling from a Fixed-Key Blockcipher

Mihir Bellare and Viet Tung Hoang and Sriram Keelveedhi and Phillip Rogaway

Abstract: We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per garbled-gate evaluation. On the theoretical side, we justify the security of these methods in the random-permutation model, where parties have access to a public random permutation. On the practical side, we provide the JustGarble system, which implements our schemes. JustGarble evaluates moderate-sized garbled-circuits at an amortized cost of 23.2 cycles per gate (7.25 nsec), far faster than any prior reported results.

Category / Keywords: cryptographic protocols / Garbled circuit, garbling scheme, multiparty computation, protocol efficiency, random-permutation model, Yao's protocol

Publication Info: The proceedings version of this paper appears in IEEE Security and Privacy 2013. This is the full version.

Date: received 30 Jun 2013

Contact author: tvhoang at ucdavis edu

Available format(s): PDF | BibTeX Citation

Version: 20130702:190036 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]