Blazing fast OT for three-round UC OT extension

DOI10.1007/978-3-030-45388-6_11OpenAlexW3021321836MaRDI QIDQ2055696

Yanyan Li

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_11

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (6)

Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Batching base oblivious transfers ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security

Cites Work

• Unnamed Item
• Unnamed Item
• On the round complexity of OT extension
• ``The simplest protocol for oblivious transfer revisited
• The wonderful world of global random oracles
• Equational security proofs of oblivious transfer protocols
• A New Approach to Practical Active-Secure Two-Party Computation
• The Simplest Protocol for Oblivious Transfer
• More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
• Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
• Actively Secure OT Extension with Optimal Overhead
• A Framework for Efficient and Composable Oblivious Transfer
• Advances in Cryptology - CRYPTO 2003
• Low cost constant round MPC combining BMR and oblivious transfer

This page was built for publication: Blazing fast OT for three-round UC OT extension