Pinkas, Benny ; Schneider, Thomas ; Smart, Nigel P. ; Williams, Stephen C. (2009)
Secure Two-Party Computation is Practical.
15. Advances in Cryptology -- ASIACRYPT 2009. Tokyo, Japan (06.12.2009-10.12.2009)
doi: 10.1007/978-3-642-10366-7_15
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few implementations with which to test various ideas. This has led to a number of optimisations being proposed which are quite restricted in their application. In this paper we describe an implementation of the two-party case, using Yao’s garbled circuits, and present various algorithmic protocol improvements. These optimisations are analysed both theoretically and empirically, using experiments of various adversarial situations. Our experimental data is provided for reasonably large circuits, including one which performs an AES encryption, a problem which we discuss in the context of various possible applications.
Typ des Eintrags: | Konferenzveröffentlichung |
---|---|
Erschienen: | 2009 |
Autor(en): | Pinkas, Benny ; Schneider, Thomas ; Smart, Nigel P. ; Williams, Stephen C. |
Art des Eintrags: | Bibliographie |
Titel: | Secure Two-Party Computation is Practical |
Sprache: | Englisch |
Publikationsjahr: | Dezember 2009 |
Ort: | Berlin |
Verlag: | Springer |
Buchtitel: | Advances in Cryptology – ASIACRYPT 2009 |
Veranstaltungstitel: | 15. Advances in Cryptology -- ASIACRYPT 2009 |
Veranstaltungsort: | Tokyo, Japan |
Veranstaltungsdatum: | 06.12.2009-10.12.2009 |
DOI: | 10.1007/978-3-642-10366-7_15 |
URL / URN: | https://encrypto.de/papers/PSSW09.pdf |
Kurzbeschreibung (Abstract): | Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few implementations with which to test various ideas. This has led to a number of optimisations being proposed which are quite restricted in their application. In this paper we describe an implementation of the two-party case, using Yao’s garbled circuits, and present various algorithmic protocol improvements. These optimisations are analysed both theoretically and empirically, using experiments of various adversarial situations. Our experimental data is provided for reasonably large circuits, including one which performs an AES encryption, a problem which we discuss in the context of various possible applications. |
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:43 |
Letzte Änderung: | 31 Jul 2024 09:09 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
Frage zum Eintrag |
Optionen (nur für Redakteure)
Redaktionelle Details anzeigen |