Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Improved Garbled Circuit: Free XOR Gates and Applications

Vladimir KolesnikovContact Information and Thomas SchneiderContact Information

(1)  Bell Laboratories, 600 Mountain Ave. Murray Hill, NJ 07974, USA
(2)  Horst Görtz Institute for IT-Security, Ruhr-University Bochum, Germany
Abstract
We present a new garbled circuit construction for two-party secure function evaluation (SFE). In our one-round protocol, XOR gates are evaluated “for free”, which results in the corresponding improvement over the best garbled circuit implementations (e.g. Fairplay [19]).
We build permutation networks [26] and Universal Circuits (UC) [25] almost exclusively of XOR gates; this results in a factor of up to 4 improvement (in both computation and communication) of their SFE. We also improve integer addition and equality testing by factor of up to 2.
We rely on the Random Oracle (RO) assumption. Our constructions are proven secure in the semi-honest model.

Contact Information Vladimir Kolesnikov
Email: kolesnikov@research.bell-labs.com

Contact Information Thomas Schneider
Email: thomas.schneider@trust.rub.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
1 newer article

  1. Kolesnikov, Vladimir (2009) Advances and impact of secure function evaluation. Bell Labs Technical Journal 14(3)
    [CrossRef]
Remote Address: 38.107.191.114 • Server: mpweb20
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)