On black-box complexity of universally composable security in the CRS model

Carmit Hazay; Muthuramakrishnan Venkitasubramaniam

doi:10.1007/978-3-662-48800-3_8

On black-box complexity of universally composable security in the CRS model

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

University of Rochester

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

9 Scopus citations

Abstract

In this work, we study the intrinsic complexity of blackbox Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: – Static UC Secure Computation. Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer. As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. – One-sided UC Secure Computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. – Adaptive UC Secure Computation. Designing adaptively secure UC commitment scheme assuming only public-key encryption with oblivious ciphertext generation. As a corollary we obtain the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption (as well as a variety of concrete assumptions). We remark that such a result was not known even under non-black-box constructions.

Original language	English
Title of host publication	Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Editors	Tetsu Iwata, Jung Hee Cheon
Publisher	Springer Verlag
Pages	183-209
Number of pages	27
ISBN (Print)	9783662487990
DOIs	https://doi.org/10.1007/978-3-662-48800-3_8
State	Published - 2015
Event	21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015 - Auckland, New Zealand Duration: 29 Nov 2015 → 3 Dec 2015

Publication series

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

Conference

Conference	21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015
Country/Territory	New Zealand
City	Auckland
Period	29/11/15 → 3/12/15

Bibliographical note

Publisher Copyright:
© International Association for Cryptologic Research 2015.

Funding

C. Hazay—Research partially supported by a grant from the Israel Ministry of Science and Technology (grant No. 3-10883). M. Venkitasubramaniam—Research supported by Google Faculty Research Grant and NSF Award CNS-1526377.

Funders	Funder number
National Science Foundation	CNS-1526377
Google
Ministry of science and technology, Israel	3-10883

Keywords

Black-box constructions
Oblivious transfer
UC commitments
UC secure computation

Access to Document

10.1007/978-3-662-48800-3_8

Cite this

Hazay, C., & Venkitasubramaniam, M. (2015). On black-box complexity of universally composable security in the CRS model. In T. Iwata, & J. H. Cheon (Eds.), Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 183-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9453). Springer Verlag. https://doi.org/10.1007/978-3-662-48800-3_8

Hazay, Carmit ; Venkitasubramaniam, Muthuramakrishnan. / On black-box complexity of universally composable security in the CRS model. Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Tetsu Iwata ; Jung Hee Cheon. Springer Verlag, 2015. pp. 183-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5f8d6c645f24425eb60ed7f4c54a9a37,

title = "On black-box complexity of universally composable security in the CRS model",

abstract = "In this work, we study the intrinsic complexity of blackbox Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: – Static UC Secure Computation. Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer. As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. – One-sided UC Secure Computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. – Adaptive UC Secure Computation. Designing adaptively secure UC commitment scheme assuming only public-key encryption with oblivious ciphertext generation. As a corollary we obtain the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption (as well as a variety of concrete assumptions). We remark that such a result was not known even under non-black-box constructions.",

keywords = "Black-box constructions, Oblivious transfer, UC commitments, UC secure computation",

author = "Carmit Hazay and Muthuramakrishnan Venkitasubramaniam",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015 ; Conference date: 29-11-2015 Through 03-12-2015",

year = "2015",

doi = "10.1007/978-3-662-48800-3_8",

language = "אנגלית",

isbn = "9783662487990",

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

publisher = "Springer Verlag",

pages = "183--209",

editor = "Tetsu Iwata and Cheon, {Jung Hee}",

booktitle = "Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

address = "גרמניה",

}

Hazay, C & Venkitasubramaniam, M 2015, On black-box complexity of universally composable security in the CRS model. in T Iwata & JH Cheon (eds), Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9453, Springer Verlag, pp. 183-209, 21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015, Auckland, New Zealand, 29/11/15. https://doi.org/10.1007/978-3-662-48800-3_8

On black-box complexity of universally composable security in the CRS model. / Hazay, Carmit; Venkitasubramaniam, Muthuramakrishnan.
Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Tetsu Iwata; Jung Hee Cheon. Springer Verlag, 2015. p. 183-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9453).

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

TY - GEN

T1 - On black-box complexity of universally composable security in the CRS model

AU - Hazay, Carmit

AU - Venkitasubramaniam, Muthuramakrishnan

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

PY - 2015

Y1 - 2015

N2 - In this work, we study the intrinsic complexity of blackbox Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: – Static UC Secure Computation. Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer. As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. – One-sided UC Secure Computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. – Adaptive UC Secure Computation. Designing adaptively secure UC commitment scheme assuming only public-key encryption with oblivious ciphertext generation. As a corollary we obtain the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption (as well as a variety of concrete assumptions). We remark that such a result was not known even under non-black-box constructions.

AB - In this work, we study the intrinsic complexity of blackbox Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings while focusing on achieving security in the common reference string (CRS) model. Our results involve the following: – Static UC Secure Computation. Designing the first static UC secure oblivious transfer protocol based on public-key encryption and stand-alone semi-honest oblivious transfer. As a corollary we obtain the first black-box constructions of UC secure computation assuming only two-round semi-honest oblivious transfer. – One-sided UC Secure Computation. Designing adaptive UC secure two-party computation with single corruptions assuming public-key encryption with oblivious ciphertext generation. – Adaptive UC Secure Computation. Designing adaptively secure UC commitment scheme assuming only public-key encryption with oblivious ciphertext generation. As a corollary we obtain the first black-box constructions of adaptive UC secure computation assuming only (trapdoor) simulatable public-key encryption (as well as a variety of concrete assumptions). We remark that such a result was not known even under non-black-box constructions.

KW - Black-box constructions

KW - Oblivious transfer

KW - UC commitments

KW - UC secure computation

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

U2 - 10.1007/978-3-662-48800-3_8

DO - 10.1007/978-3-662-48800-3_8

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

AN - SCOPUS:84952683741

SN - 9783662487990

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

SP - 183

EP - 209

BT - Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Iwata, Tetsu

A2 - Cheon, Jung Hee

PB - Springer Verlag

T2 - 21st International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2015

Y2 - 29 November 2015 through 3 December 2015

ER -

Hazay C, Venkitasubramaniam M. On black-box complexity of universally composable security in the CRS model. In Iwata T, Cheon JH, editors, Advances in Cryptology – ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2015. p. 183-209. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-48800-3_8

On black-box complexity of universally composable security in the CRS model

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this