Oblivious TLS via Multi-party Computation

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

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.

Original languageEnglish
Title of host publicationTopics in Cryptology-CT-RSA 2021 - Cryptographers’ Track at the RSA Conference, Proceedings
EditorsKenneth G. Paterson
Number of pages24
PublisherSpringer
Publication date2021
Pages51-74
DOIs
Publication statusPublished - 2021
EventRSA Conference Cryptographers’ Track, CT-RSA 2021 -
Duration: 17 May 202120 May 2021

Conference

ConferenceRSA Conference Cryptographers’ Track, CT-RSA 2021
Period17/05/202120/05/2021
SeriesLecture Notes in Computer Science
Volume12704
ISSN0302-9743

Fingerprint

Dive into the research topics of 'Oblivious TLS via Multi-party Computation'. Together they form a unique fingerprint.

Cite this