Skip to main navigation Skip to search Skip to main content

Oblivious TLS via Multi-party Computation

Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
EditorsKenneth Patterson
Place of PublicationCham
PublisherSpringer
Pages51-74
ISBN (Electronic)9783030755393
ISBN (Print)9783030755386
DOIs
Publication statusPublished - 11 May 2021
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12704
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

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

Cite this