Aarhus Universitets segl

English

Du er her: AU » Om AU » Organisation » Oblivious TLS via Multi-party Computation

Om AU

Oblivious TLS via Multi-party Computation

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Standard

Oblivious TLS via Multi-party Computation. / Abram, Damiano; Damgård, Ivan; Scholl, Peter et al.
Topics in Cryptology – CT-RSA 2021. red. / Kenneth G. Paterson. Springer, 2021. s. 51-74 (Lecture Notes in Computer Science, Bind 12704).

Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review

Harvard

Abram, D, Damgård, I, Scholl, P & Trieflinger, S 2021, Oblivious TLS via Multi-party Computation. i KG Paterson (red.), Topics in Cryptology – CT-RSA 2021. Springer, Lecture Notes in Computer Science, bind 12704, s. 51-74, RSA Conference Cryptographers’ Track, CT-RSA 2021, 17/05/2021. https://doi.org/10.1007/978-3-030-75539-3_3

APA

Abram, D., Damgård, I., Scholl, P., & Trieflinger, S. (2021). Oblivious TLS via Multi-party Computation. I K. G. Paterson (red.), Topics in Cryptology – CT-RSA 2021 (s. 51-74). Springer. Lecture Notes in Computer Science Bind 12704 https://doi.org/10.1007/978-3-030-75539-3_3

CBE

Abram D, Damgård I, Scholl P, Trieflinger S. 2021. Oblivious TLS via Multi-party Computation. Paterson KG, red. I Topics in Cryptology – CT-RSA 2021. Springer. s. 51-74. (Lecture Notes in Computer Science, Bind 12704). https://doi.org/10.1007/978-3-030-75539-3_3

MLA

Abram, Damiano et al. "Oblivious TLS via Multi-party Computation". Paterson, Kenneth G. (redaktører). Topics in Cryptology – CT-RSA 2021. Springer. (Lecture Notes in Computer Science, Bind 12704). 2021, 51-74. https://doi.org/10.1007/978-3-030-75539-3_3

Vancouver

Abram D, Damgård I, Scholl P, Trieflinger S. Oblivious TLS via Multi-party Computation. I Paterson KG, red., Topics in Cryptology – CT-RSA 2021. Springer. 2021. s. 51-74. (Lecture Notes in Computer Science, Bind 12704). doi: 10.1007/978-3-030-75539-3_3

Author

Abram, Damiano ; Damgård, Ivan ; Scholl, Peter et al. / Oblivious TLS via Multi-party Computation. Topics in Cryptology – CT-RSA 2021. red. / Kenneth G. Paterson. Springer, 2021. s. 51-74 (Lecture Notes in Computer Science, Bind 12704).

Bibtex

@inproceedings{d97cf757330f475398ce12c881087766,
title = "Oblivious TLS via Multi-party Computation",
abstract = "In this paper, we describe Oblivious TLS: an MPC protocol that we prove UC secure against a majority of actively corrupted parties. The protocol securely implements TLS 1.3. Thus, any party P who runs TLS can communicate securely with a set of servers running Oblivious TLS; P does not need to modify anything, or even be aware that MPC is used. Applications of this include communication between servers who offer MPC services and clients, to allow the clients to easily and securely provide inputs or receive outputs. Also, an organization could use Oblivious TLS to improve in-house security while seamlessly connecting to external parties. Our protocol runs in the preprocessing model, and we did a preliminary non-optimized implementation of the on-line phase. In this version, the hand-shake completes in about 1 s. Based on implementation results from other work, performance of the record protocol using the standard AES-GCM can be expected to achieve an online throughput of about 3 MB/s.",
author = "Damiano Abram and Ivan Damg{\aa}rd and Peter Scholl and Sven Trieflinger",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; RSA Conference Cryptographers{\textquoteright} Track, CT-RSA 2021 ; Conference date: 17-05-2021 Through 20-05-2021",
year = "2021",
doi = "10.1007/978-3-030-75539-3_3",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "51--74",
editor = "Paterson, {Kenneth G.}",
booktitle = "Topics in Cryptology – CT-RSA 2021",
address = "Netherlands",

}

RIS

TY - GEN

T1 - Oblivious TLS via Multi-party Computation

AU - Abram, Damiano

AU - Damgård, Ivan

AU - Scholl, Peter

AU - Trieflinger, Sven

N1 - Publisher Copyright: © 2021, Springer Nature Switzerland AG.

PY - 2021

Y1 - 2021

N2 - In this paper, we describe Oblivious TLS: an MPC protocol that we prove UC secure against a majority of actively corrupted parties. The protocol securely implements TLS 1.3. Thus, any party P who runs TLS can communicate securely with a set of servers running Oblivious TLS; P does not need to modify anything, or even be aware that MPC is used. Applications of this include communication between servers who offer MPC services and clients, to allow the clients to easily and securely provide inputs or receive outputs. Also, an organization could use Oblivious TLS to improve in-house security while seamlessly connecting to external parties. Our protocol runs in the preprocessing model, and we did a preliminary non-optimized implementation of the on-line phase. In this version, the hand-shake completes in about 1 s. Based on implementation results from other work, performance of the record protocol using the standard AES-GCM can be expected to achieve an online throughput of about 3 MB/s.

AB - In this paper, we describe Oblivious TLS: an MPC protocol that we prove UC secure against a majority of actively corrupted parties. The protocol securely implements TLS 1.3. Thus, any party P who runs TLS can communicate securely with a set of servers running Oblivious TLS; P does not need to modify anything, or even be aware that MPC is used. Applications of this include communication between servers who offer MPC services and clients, to allow the clients to easily and securely provide inputs or receive outputs. Also, an organization could use Oblivious TLS to improve in-house security while seamlessly connecting to external parties. Our protocol runs in the preprocessing model, and we did a preliminary non-optimized implementation of the on-line phase. In this version, the hand-shake completes in about 1 s. Based on implementation results from other work, performance of the record protocol using the standard AES-GCM can be expected to achieve an online throughput of about 3 MB/s.

U2 - 10.1007/978-3-030-75539-3_3

DO - 10.1007/978-3-030-75539-3_3

M3 - Article in proceedings

T3 - Lecture Notes in Computer Science

SP - 51

EP - 74

BT - Topics in Cryptology – CT-RSA 2021

A2 - Paterson, Kenneth G.

PB - Springer

T2 - RSA Conference Cryptographers’ Track, CT-RSA 2021

Y2 - 17 May 2021 through 20 May 2021

ER -