Oblivious TLS via multi-party computation

DOI10.1007/978-3-030-75539-3_3OpenAlexW3157404677MaRDI QIDQ826241

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

Publication date: 20 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_3

Mathematics Subject Classification ID

Cryptography (94A60) Computer system organization (68Mxx)

Related Items (2)

Oblivious TLS via multi-party computation ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications

Cites Work

• Oblivious TLS via multi-party computation
• A cryptographic analysis of the TLS 1.3 handshake protocol
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Semi-homomorphic Encryption and Multiparty Computation
• Cryptographic Extraction and Key Derivation: The HKDF Scheme
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
• Public Key Cryptography - PKC 2006
• Low cost constant round MPC combining BMR and oblivious transfer

This page was built for publication: Oblivious TLS via multi-party computation