-
Uddannelse
Find uddannelse
Studievejledning
Kvalitet
- Forskning
-
Samarbejde
Virksomheder
Kommuner og regioner
Gymnasier
Myndigheder
-
Om AU
Organisation
Kontakt
Om AU
- Organisation
- Ledelse
- Strategi
- AU i tal
- AU's historie
- Internationalt samarbejde
- Bæredygtighed
- Campus 2.0
- Diversitet og ligestilling
- Ledige stillinger
- Presse
- Kontakt
Oblivious TLS via Multi-party Computation
Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
DOI
- https://doi.org/10.1007/978-3-030-75539-3_3
Forlagets udgivne version
- Damiano Abram
- Ivan Damgård
- Peter Scholl
- Sven Trieflinger, Robert Bosch GmbH
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.
| Originalsprog | Engelsk |
|---|---|
| Titel | Topics in Cryptology – CT-RSA 2021 |
| Redaktører | Kenneth G. Paterson |
| Antal sider | 24 |
| Forlag | Springer |
| Udgivelsesår | 2021 |
| Sider | 51-74 |
| DOI | |
| Status | Udgivet - 2021 |
| Begivenhed | RSA Conference Cryptographers’ Track, CT-RSA 2021 - Varighed: 17 maj 2021 → 20 maj 2021 |
Konference
| Konference | RSA Conference Cryptographers’ Track, CT-RSA 2021 |
|---|---|
| Periode | 17/05/2021 → 20/05/2021 |
| Serietitel | Lecture Notes in Computer Science |
|---|---|
| Vol/bind | 12704 |
| ISSN | 0302-9743 |
Bibliografisk note
Funding Information:
Acknowledgments. We would like to thank Douglas Stebila and the anonymous reviewers for valuable feedback which helped to improve the paper, as well as Roberto Zunino for suggestions and comments on Damiano Abram’s master’s thesis. The work of Sven Trieflinger and Damiano Abram was funded by Robert Bosch GmbH. Ivan Damgård was supported by the European Research Council (ERC) under the European Unions’s Horizon 2020 research and innovation programme under grant agreement No 669255 (MPCPRO). Peter Scholl was supported by a starting grant from the Aarhus University Research Foundation.
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
Se relationer på Aarhus Universitet Citationsformater
ID: 229110677