Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti; Pratik Sarkar; Xiao Wang

doi:10.1007/978-3-030-64840-4_10

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti^*, Pratik Sarkar, Xiao Wang

^*Corresponding author for this work

Computer Science

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

6 Scopus citations

Abstract

We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (CRS ) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption. It incurs O(1 ) exponentiations and sends O(1 ) group elements, whereas the state of the art requires O(κ²) exponentiations and communicates poly (κ) bits, where κ is the computational security parameter. Along the way, we obtain several other efficient UC-secure OT protocols under DDH:The most efficient yet two-round adaptive string-OT protocol assuming global programmable random oracle. Furthermore, the protocol can be made non-interactive in the simultaneous message setting, assuming random inputs for the sender.The first two-round string-OT with amortized constant exponentiations and communication overhead which is secure in the global observable random oracle model.The first two-round receiver equivocal string-OT in the CRS model that incurs constant computation and communication overhead. We also obtain the first non-interactive adaptive string UC-commitment in the CRS model which incurs a sublinear communication overhead in the security parameter. Specifically, we commit to polylog (κ) bits while communicating O(κ) bits. Moreover, it is additively homomorphic. We can also extend our results to the single CRS model where multiple sessions share the same CRS. As a corollary, we obtain a two-round adaptively secure MPC protocol in this model.

Original language	English (US)
Title of host publication	Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings
Editors	Shiho Moriai, Huaxiong Wang
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	277-308
Number of pages	32
ISBN (Print)	9783030648398
DOIs	https://doi.org/10.1007/978-3-030-64840-4_10
State	Published - 2020
Event	26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020 - Daejeon, Korea, Republic of Duration: Dec 7 2020 → Dec 11 2020

Publication series

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

Conference

Conference	26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020
Country/Territory	Korea, Republic of
City	Daejeon
Period	12/7/20 → 12/11/20

Funding

This work was supported by the IARPA ACHILLES project, the NSF MACS project and NSF grant CNS-1422965. The first author is a member of the Check Point Institute for Information Security.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-64840-4_10

Cite this

Canetti, R., Sarkar, P., & Wang, X. (2020). Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. In S. Moriai, & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings (pp. 277-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12493 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-64840-4_10

Canetti, Ran ; Sarkar, Pratik ; Wang, Xiao. / Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings. editor / Shiho Moriai ; Huaxiong Wang. Springer Science and Business Media Deutschland GmbH, 2020. pp. 277-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7a42fc165aa8464c99ceae109fcae0ca,

title = "Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security",

abstract = "We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (CRS ) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption. It incurs O(1 ) exponentiations and sends O(1 ) group elements, whereas the state of the art requires O(κ2) exponentiations and communicates poly (κ) bits, where κ is the computational security parameter. Along the way, we obtain several other efficient UC-secure OT protocols under DDH:The most efficient yet two-round adaptive string-OT protocol assuming global programmable random oracle. Furthermore, the protocol can be made non-interactive in the simultaneous message setting, assuming random inputs for the sender.The first two-round string-OT with amortized constant exponentiations and communication overhead which is secure in the global observable random oracle model.The first two-round receiver equivocal string-OT in the CRS model that incurs constant computation and communication overhead. We also obtain the first non-interactive adaptive string UC-commitment in the CRS model which incurs a sublinear communication overhead in the security parameter. Specifically, we commit to polylog (κ) bits while communicating O(κ) bits. Moreover, it is additively homomorphic. We can also extend our results to the single CRS model where multiple sessions share the same CRS. As a corollary, we obtain a two-round adaptively secure MPC protocol in this model.",

author = "Ran Canetti and Pratik Sarkar and Xiao Wang",

note = "Publisher Copyright: {\textcopyright} 2020, International Association for Cryptologic Research.; 26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020 ; Conference date: 07-12-2020 Through 11-12-2020",

year = "2020",

doi = "10.1007/978-3-030-64840-4_10",

language = "English (US)",

isbn = "9783030648398",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "277--308",

editor = "Shiho Moriai and Huaxiong Wang",

booktitle = "Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings",

address = "Germany",

}

Canetti, R, Sarkar, P & Wang, X 2020, Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. in S Moriai & H Wang (eds), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12493 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 277-308, 26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020, Daejeon, Korea, Republic of, 12/7/20. https://doi.org/10.1007/978-3-030-64840-4_10

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. / Canetti, Ran; Sarkar, Pratik; Wang, Xiao.
Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings. ed. / Shiho Moriai; Huaxiong Wang. Springer Science and Business Media Deutschland GmbH, 2020. p. 277-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12493 LNCS).

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

TY - GEN

T1 - Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

AU - Canetti, Ran

AU - Sarkar, Pratik

AU - Wang, Xiao

PY - 2020

Y1 - 2020

N2 - We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (CRS ) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption. It incurs O(1 ) exponentiations and sends O(1 ) group elements, whereas the state of the art requires O(κ2) exponentiations and communicates poly (κ) bits, where κ is the computational security parameter. Along the way, we obtain several other efficient UC-secure OT protocols under DDH:The most efficient yet two-round adaptive string-OT protocol assuming global programmable random oracle. Furthermore, the protocol can be made non-interactive in the simultaneous message setting, assuming random inputs for the sender.The first two-round string-OT with amortized constant exponentiations and communication overhead which is secure in the global observable random oracle model.The first two-round receiver equivocal string-OT in the CRS model that incurs constant computation and communication overhead. We also obtain the first non-interactive adaptive string UC-commitment in the CRS model which incurs a sublinear communication overhead in the security parameter. Specifically, we commit to polylog (κ) bits while communicating O(κ) bits. Moreover, it is additively homomorphic. We can also extend our results to the single CRS model where multiple sessions share the same CRS. As a corollary, we obtain a two-round adaptively secure MPC protocol in this model.

AB - We construct the most efficient two-round adaptively secure bit-OT in the Common Random String (CRS ) model. The scheme is UC secure under the Decisional Diffie-Hellman (DDH) assumption. It incurs O(1 ) exponentiations and sends O(1 ) group elements, whereas the state of the art requires O(κ2) exponentiations and communicates poly (κ) bits, where κ is the computational security parameter. Along the way, we obtain several other efficient UC-secure OT protocols under DDH:The most efficient yet two-round adaptive string-OT protocol assuming global programmable random oracle. Furthermore, the protocol can be made non-interactive in the simultaneous message setting, assuming random inputs for the sender.The first two-round string-OT with amortized constant exponentiations and communication overhead which is secure in the global observable random oracle model.The first two-round receiver equivocal string-OT in the CRS model that incurs constant computation and communication overhead. We also obtain the first non-interactive adaptive string UC-commitment in the CRS model which incurs a sublinear communication overhead in the security parameter. Specifically, we commit to polylog (κ) bits while communicating O(κ) bits. Moreover, it is additively homomorphic. We can also extend our results to the single CRS model where multiple sessions share the same CRS. As a corollary, we obtain a two-round adaptively secure MPC protocol in this model.

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

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

U2 - 10.1007/978-3-030-64840-4_10

DO - 10.1007/978-3-030-64840-4_10

M3 - Conference contribution

AN - SCOPUS:85097899400

SN - 9783030648398

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

SP - 277

EP - 308

BT - Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings

A2 - Moriai, Shiho

A2 - Wang, Huaxiong

PB - Springer Science and Business Media Deutschland GmbH

T2 - 26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020

Y2 - 7 December 2020 through 11 December 2020

ER -

Canetti R, Sarkar P, Wang X. Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security. In Moriai S, Wang H, editors, Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 277-308. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-64840-4_10

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Abstract

Publication series

Conference

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this