Paper 2009/411
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider
Abstract
We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for addition, subtraction, multiplication, and comparison functions. Our circuits for subtraction and comparison are approximately two times smaller (in terms of garbled tables) than previous constructions. This implies corresponding computation and communication improvements in SFE of functions using our efficient building blocks. The techniques rely on recently proposed ``free XOR'' GC technique. Further, we present concrete and detailed improved GC protocols for the problem of secure integer comparison, and related problems of auctions, minimum selection, and minimal distance. Performance improvement comes both from building on our efficient basic blocks and several problem-specific GC optimizations. We provide precise cost evaluation of our constructions, which serves as a baseline for future protocols.
Note: Updated Table 2.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Full version of the CANS 2009 paper.
- Keywords
- Secure ComputationGarbled CircuitMillionaires ProblemAuctionsMinimum Distance
- Contact author(s)
- thomas schneider @ crisp-da de
- History
- 2017-12-08: last of 7 revisions
- 2009-09-01: received
- See all versions
- Short URL
- https://ia.cr/2009/411
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/411,
author = {Vladimir Kolesnikov and Ahmad-Reza Sadeghi and Thomas Schneider},
title = {Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/411},
year = {2009},
url = {https://eprint.iacr.org/2009/411}
}
