Institutional Login
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
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Improved Garbled Circuit: Free XOR Gates and Applications
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 5126/2009
Book
Automata, Languages and Programming
DOI
10.1007/978-3-540-70583-3
Copyright
2009
ISBN
978-3-540-70582-6
DOI
10.1007/978-3-540-70583-3_40
Pages
486-498
Subject Collection
Computer Science
SpringerLink Date
Saturday, July 05, 2008
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (448.6 KB)
Free Preview
Improved Garbled Circuit: Free XOR Gates and Applications
Vladimir Kolesnikov
1
and Thomas Schneider
2
(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.
Vladimir
Kolesnikov
Email:
kolesnikov@research.bell-labs.com
Thomas
Schneider
Email:
thomas.schneider@trust.rub.de
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Referenced by
1 newer article
Kolesnikov, Vladimir (2009) Advances and impact of secure function evaluation.
Bell Labs Technical Journal
14(3)
[CrossRef]
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.114 • Server: mpweb20
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)