Oblivious TLS via multi-party computation
type: Item
instance of: scholarly article
title: Oblivious TLS via multi-party computation
DOI: 10.1007/978-3-030-75539-3_3
author: Damiano Abram
author: Peter Scholl
author: Sven Trieflinger
author: Ivan B. Damgård
publication date: 2021-12-20T00:00:00Z
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7449872
MaRDI profile type: Publication
full work available at URL: 978-3-030-75539-3 3
OpenAlex ID: W3157404677
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Public Key Cryptography - PKC 2006
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: A cryptographic analysis of the TLS 1.3 handshake protocol
cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Cryptographic Extraction and Key Derivation: The HKDF Scheme
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
description: scientific article; zbMATH DE number 7449872