More efficient oblivious transfer extensions with security for malicious adversaries

Gilad Asharov; Yehuda Lindell; Thomas Schneider; Michael Zohner

doi:10.1007/978-3-662-46800-5_26

More efficient oblivious transfer extensions with security for malicious adversaries

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

68 Scopus citations

Abstract

Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious transfer protocols is becoming more evident. Oblivious transfer extensions are protocols that enable a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (CRYPTO 2003) presented an OT extension protocol for which the cost of each OT (beyond the base-OTs) is just a few hash function operations. In the malicious setting, Nielsen et al. (CRYPTO 2012) presented an efficient OT extension protocol for the setting of active adversaries, that is secure in the random oracle model. In this work, we present an OT extension protocol for the setting of malicious adversaries that is more efficient and uses less communication than previous works. In addition, our protocol can be proven secure in both the random oracle model, and in the standard model with a type of correlation robustness. Given the importance of OT in many secure computation protocols, increasing the efficiency of OT extensions is another important step forward to making secure computation practical.

Original language	English
Title of host publication	Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Editors	Marc Fischlin, Elisabeth Oswald
Publisher	Springer Verlag
Pages	673-701
Number of pages	29
ISBN (Print)	9783662467992
DOIs	https://doi.org/10.1007/978-3-662-46800-5_26
State	Published - 2015
Event	34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015 - Sofia, Bulgaria Duration: 26 Apr 2015 → 30 Apr 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9056
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015
Country/Territory	Bulgaria
City	Sofia
Period	26/04/15 → 30/04/15

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2015.

Funding

This work was partially supported by the European Union’s Seventh Framework Program (FP7/2007-2013) grant agreement n. 609611 (PRACTICE). The first author is supported by the Israeli Centers of Research Excellence (I-CORE) Program (Center No. 4/11). The second is supported by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC consolidators grant agreement n. 615172 (HIPS). The third and fourth authors are supported by the DFG as part of project E3 within the CRC 1119 CROSSING, by the German Federal Ministry of Education and Research (BMBF) within EC SPRIDE, and by the Hessian LOEWE excellence initiative within CASED.

Funders	Funder number
Deutsche Forschungsgemeinschaft
EC SPRIDE
European Commission
Seventh Framework Programme	609611, FP/2007-2013
European Commission	615172
Deutsche Forschungsgemeinschaft
Bundesministerium für Bildung und Forschung
Israeli Centers for Research Excellence	4/11

Keywords

Concrete efficiency
Oblivious transfer extensions
Secure computation

Access to Document

10.1007/978-3-662-46800-5_26

Cite this

Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2015). More efficient oblivious transfer extensions with security for malicious adversaries. In M. Fischlin, & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 673-701). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9056). Springer Verlag. https://doi.org/10.1007/978-3-662-46800-5_26

Asharov, Gilad ; Lindell, Yehuda ; Schneider, Thomas et al. / More efficient oblivious transfer extensions with security for malicious adversaries. Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. editor / Marc Fischlin ; Elisabeth Oswald. Springer Verlag, 2015. pp. 673-701 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{31a4a6b5081647898dcc782576023c1a,

title = "More efficient oblivious transfer extensions with security for malicious adversaries",

abstract = "Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious transfer protocols is becoming more evident. Oblivious transfer extensions are protocols that enable a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (CRYPTO 2003) presented an OT extension protocol for which the cost of each OT (beyond the base-OTs) is just a few hash function operations. In the malicious setting, Nielsen et al. (CRYPTO 2012) presented an efficient OT extension protocol for the setting of active adversaries, that is secure in the random oracle model. In this work, we present an OT extension protocol for the setting of malicious adversaries that is more efficient and uses less communication than previous works. In addition, our protocol can be proven secure in both the random oracle model, and in the standard model with a type of correlation robustness. Given the importance of OT in many secure computation protocols, increasing the efficiency of OT extensions is another important step forward to making secure computation practical.",

keywords = "Concrete efficiency, Oblivious transfer extensions, Secure computation",

author = "Gilad Asharov and Yehuda Lindell and Thomas Schneider and Michael Zohner",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015 ; Conference date: 26-04-2015 Through 30-04-2015",

year = "2015",

doi = "10.1007/978-3-662-46800-5_26",

language = "אנגלית",

isbn = "9783662467992",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "673--701",

editor = "Marc Fischlin and Elisabeth Oswald",

booktitle = "Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

address = "גרמניה",

}

Asharov, G , Lindell, Y, Schneider, T & Zohner, M 2015, More efficient oblivious transfer extensions with security for malicious adversaries. in M Fischlin & E Oswald (eds), Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9056, Springer Verlag, pp. 673-701, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015, Sofia, Bulgaria, 26/04/15. https://doi.org/10.1007/978-3-662-46800-5_26

More efficient oblivious transfer extensions with security for malicious adversaries. / Asharov, Gilad ; Lindell, Yehuda; Schneider, Thomas et al.
Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. ed. / Marc Fischlin; Elisabeth Oswald. Springer Verlag, 2015. p. 673-701 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9056).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - More efficient oblivious transfer extensions with security for malicious adversaries

AU - Asharov, Gilad

AU - Lindell, Yehuda

AU - Schneider, Thomas

AU - Zohner, Michael

N1 - Publisher Copyright: © International Association for Cryptologic Research 2015.

PY - 2015

Y1 - 2015

N2 - Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious transfer protocols is becoming more evident. Oblivious transfer extensions are protocols that enable a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (CRYPTO 2003) presented an OT extension protocol for which the cost of each OT (beyond the base-OTs) is just a few hash function operations. In the malicious setting, Nielsen et al. (CRYPTO 2012) presented an efficient OT extension protocol for the setting of active adversaries, that is secure in the random oracle model. In this work, we present an OT extension protocol for the setting of malicious adversaries that is more efficient and uses less communication than previous works. In addition, our protocol can be proven secure in both the random oracle model, and in the standard model with a type of correlation robustness. Given the importance of OT in many secure computation protocols, increasing the efficiency of OT extensions is another important step forward to making secure computation practical.

AB - Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two party and multi-party computation. As secure computation becomes more practical, the need for practical large scale oblivious transfer protocols is becoming more evident. Oblivious transfer extensions are protocols that enable a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (CRYPTO 2003) presented an OT extension protocol for which the cost of each OT (beyond the base-OTs) is just a few hash function operations. In the malicious setting, Nielsen et al. (CRYPTO 2012) presented an efficient OT extension protocol for the setting of active adversaries, that is secure in the random oracle model. In this work, we present an OT extension protocol for the setting of malicious adversaries that is more efficient and uses less communication than previous works. In addition, our protocol can be proven secure in both the random oracle model, and in the standard model with a type of correlation robustness. Given the importance of OT in many secure computation protocols, increasing the efficiency of OT extensions is another important step forward to making secure computation practical.

KW - Concrete efficiency

KW - Oblivious transfer extensions

KW - Secure computation

UR - http://www.scopus.com/inward/record.url?scp=84942673513&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46800-5_26

DO - 10.1007/978-3-662-46800-5_26

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84942673513

SN - 9783662467992

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 673

EP - 701

BT - Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

A2 - Fischlin, Marc

A2 - Oswald, Elisabeth

PB - Springer Verlag

T2 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2015

Y2 - 26 April 2015 through 30 April 2015

ER -

Asharov G , Lindell Y, Schneider T, Zohner M. More efficient oblivious transfer extensions with security for malicious adversaries. In Fischlin M, Oswald E, editors, Advances in Cryptology – EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag. 2015. p. 673-701. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-46800-5_26

More efficient oblivious transfer extensions with security for malicious adversaries

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this