Oblivious TLS via multi-party computation (Q826241)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Oblivious TLS via multi-party computation	scientific article

Statements

scholarly article

0 references

Oblivious TLS via multi-party computation (English)

0 references

0 references

0 references

Sven Trieflinger

0 references

Ivan B. Damgård

0 references

publication date

20 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-75539-3_3

0 references

Oblivious TLS via multi-party computation

0 references

Semi-homomorphic Encryption and Multiparty Computation

0 references

Public Key Cryptography - PKC 2006

0 references

Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits

0 references

Multiparty Computation from Somewhat Homomorphic Encryption

0 references

A cryptographic analysis of the TLS 1.3 handshake protocol

0 references

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

0 references

Low cost constant round MPC combining BMR and oblivious transfer

0 references

Cryptographic Extraction and Key Derivation: The HKDF Scheme

0 references

A New Approach to Practical Active-Secure Two-Party Computation

0 references

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables

0 references

Identifiers

10.1007/978-3-030-75539-3_3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:826241

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q826241&oldid=38019443"