Blazing fast OT for three-round UC OT extension
type: Item
instance of: scholarly article
title: Blazing fast OT for three-round UC OT extension
DOI: 10.1007/978-3-030-45388-6_11
author: Yanyan Li
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436976
MaRDI profile type: Publication
full work available at URL: 978-3-030-45388-6 11
OpenAlex ID: W3021321836
cites work: More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
cites work: Q4228503
cites work: The wonderful world of global random oracles
cites work: The Simplest Protocol for Oblivious Transfer
cites work: ``The simplest protocol for oblivious transfer'' revisited
cites work: On the round complexity of OT extension
cites work: Low cost constant round MPC combining BMR and oblivious transfer
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q5750403
cites work: Actively Secure OT Extension with Optimal Overhead
cites work: Equational security proofs of oblivious transfer protocols
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
cites work: A Framework for Efficient and Composable Oblivious Transfer
Recommended article: A Unified Framework for UC from Only OT
Recommended article: Triply adaptive UC NIZK
Recommended article: Three steps to accelerated expansion
Recommended article: UC Spaces Revisited
Recommended article: Super-Fast 3-Ruling Sets.
Recommended article: On the round complexity of OT extension
Recommended article: Fast Track to Forcing
Recommended article: Fast FAST
Recommended article: Q4474169
description: scientific article; zbMATH DE number 7436976