Actively Secure OT Extension with Optimal Overhead
From MaRDI portal
Publication:3457136
DOI10.1007/978-3-662-47989-6_35zbMath1375.94138OpenAlexW2275295769MaRDI QIDQ3457136
Marcel Keller, Emmanuela Orsini, Peter Scholl
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2015/546
Related Items
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Two-round MPC: information-theoretic and black-box ⋮ An efficient structural attack on NIST submission DAGS ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ More efficient oblivious transfer extensions ⋮ The Simplest Protocol for Oblivious Transfer ⋮ PrORAM ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Oblivious transfer with constant computational overhead ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Batching base oblivious transfers ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Blazing fast OT for three-round UC OT extension ⋮ Actively secure setup for SPDZ ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Multiparty generation of an RSA modulus ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings
Cites Work
- Improved OT Extension for Transferring Short Secrets
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
