Kolesnikov, Vladimir ; Sadeghi, Ahmad-Reza ; Schneider, Thomas (2009)
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima.
8. International Conference on Cryptology And Network Security (CANS'09). Kanazawa, Japan (12.12.2009-14.12.2009)
doi: 10.1007/978-3-642-10433-6_1
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2009 |
| Autor(en): | Kolesnikov, Vladimir ; Sadeghi, Ahmad-Reza ; Schneider, Thomas |
| Art des Eintrags: | Bibliographie |
| Titel: | Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima |
| Sprache: | Englisch |
| Publikationsjahr: | Dezember 2009 |
| Ort: | Berlin |
| Verlag: | Springer |
| Buchtitel: | Cryptology and Network Security |
| Veranstaltungstitel: | 8. International Conference on Cryptology And Network Security (CANS'09) |
| Veranstaltungsort: | Kanazawa, Japan |
| Veranstaltungsdatum: | 12.12.2009-14.12.2009 |
| DOI: | 10.1007/978-3-642-10433-6_1 |
| URL / URN: | https://encrypto.de/papers/KSS09.pdf |
| Kurzbeschreibung (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. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik Zentrale Einrichtungen 20 Fachbereich Informatik > EC SPRIDE 20 Fachbereich Informatik > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.18 aufgegangen in Praktische Kryptographie und Privatheit) |
| Hinterlegungsdatum: | 25 Jun 2012 13:44 |
| Letzte Änderung: | 31 Jul 2024 09:28 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum