Journal
2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP)
Volume -, Issue -, Pages 478-492Publisher
IEEE
DOI: 10.1109/SP.2013.39
Keywords
Garbled circuits; garbling schemes; multiparty computation; random-permutation model; timing study; Yao's protocol
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available