Asharov, Gilad ; Lindell, Yehuda ; Schneider, Thomas ; Zohner, Michael (2013)
More Efficient Oblivious Transfer and Extensions for Faster Secure Computation.
In: CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
doi: 10.1145/2508859.2516738
Buchkapitel, Bibliographie

Kurzbeschreibung (Abstract)

Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography. In this work we present optimizations and efficient implementations of OT and OT extensions in the semi-honest model. We propose a novel OT protocol with security in the standard model and improve OT extensions with respect to communication complexity, computation complexity, and scalability. We also provide specific optimizations of OT extensions that are tailored to the secure computation protocols of Yao and Goldreich-Micali-Wigderson and reduce the communication complexity even further. We experimentally verify the efficiency gains of our protocols and optimizations. By applying our implementation to current secure computation frameworks, we can securely compute a Levenshtein distance circuit with 1.29 billion AND gates at a rate of 1.2 million AND gates per second. Moreover, we demonstrate the importance of correctly implementing OT within secure computation protocols by presenting an attack on the FastGC framework.

Typ des Eintrags:	Buchkapitel
Erschienen:	2013
Autor(en):	Asharov, Gilad ; Lindell, Yehuda ; Schneider, Thomas ; Zohner, Michael
Art des Eintrags:	Bibliographie
Titel:	More Efficient Oblivious Transfer and Extensions for Faster Secure Computation
Sprache:	Englisch
Publikationsjahr:	November 2013
Verlag:	ACM
Buchtitel:	CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Veranstaltungsdatum:	04.11.2013-08.11.2013
DOI:	10.1145/2508859.2516738
URL / URN:	https://encrypto.de/papers/ALSZ13.pdf
Kurzbeschreibung (Abstract):	Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography. In this work we present optimizations and efficient implementations of OT and OT extensions in the semi-honest model. We propose a novel OT protocol with security in the standard model and improve OT extensions with respect to communication complexity, computation complexity, and scalability. We also provide specific optimizations of OT extensions that are tailored to the secure computation protocols of Yao and Goldreich-Micali-Wigderson and reduce the communication complexity even further. We experimentally verify the efficiency gains of our protocols and optimizations. By applying our implementation to current secure computation frameworks, we can securely compute a Levenshtein distance circuit with 1.29 billion AND gates at a rate of 1.2 million AND gates per second. Moreover, we demonstrate the importance of correctly implementing OT within secure computation protocols by presenting an attack on the FastGC framework.
Fachbereich(e)/-gebiet(e):	20 Fachbereich Informatik LOEWE LOEWE > LOEWE-Zentren Zentrale Einrichtungen LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Fachbereich Informatik > EC SPRIDE 20 Fachbereich Informatik > EC SPRIDE > Engineering Cryptographic Protocols (am 01.03.18 aufgegangen in Praktische Kryptographie und Privatheit)
Hinterlegungsdatum:	02 Dez 2013 17:30
Letzte Änderung:	31 Jul 2024 07:42
PPN:
Export:	BibTeXMODSHTML CitationEP3 XMLJSONSimple MetadataT2T_XMLRDF+XMLEndNoteIBW_RDAMultiline CSVDublin CoreASCII CitationAtom
Suche nach Titel in:	TUfind oder in Google

Verfügbare Versionen dieses Eintrags

• More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. (deposited 11 Nov 2013 13:36)
  • More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. (deposited 02 Dez 2013 17:30) [Gegenwärtig angezeigt]

Frage zum Eintrag

Optionen (nur für Redakteure)

Redaktionelle Details anzeigen