Paper 2013/426 Original: eprint.iacr.org/2013/426 ↗
Efficient Garbling from a Fixed-Key Blockcipher
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-07-02: last updated
- 2013-07-02: published
- Short URL
- https://ia.cr/2013/426
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/426,
author = {Mihir Bellare and Viet Tung Hoang and Sriram Keelveedhi and Phillip Rogaway},
title = {Efficient Garbling from a Fixed-Key Blockcipher},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/426},
year = {2013},
url = {https://eprint.iacr.org/2013/426}
}