Efficient Garbling from a Fixed-Key Blockcipher

• Published in: 2013 IEEE Symposium on Security and Privacy pp. 478 - 492
• Main Authors: Bellare, Mihir, Hoang, Viet Tung, Keelveedhi, Sriram, Rogaway, Phillip
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-05-2013
• Subjects: Cryptography; Games; Garbled circuits; garbling schemes; Logic gates; multiparty computation; Protocols; random-permutation model; Semantics; timing study; Wires; Yao's protocol
• ISBN: 9781467361668; 1467361666
• ISSN: 1081-6011; 2375-1207
• DOI: 10.1109/SP.2013.39

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 Just Garble system, which implements our schemes. Just Garble 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.