Actively secure OT extension with optimal overhead
From MaRDI portal
(Redirected from Publication:3457136)
Recommendations
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead
- More efficient oblivious transfer extensions
- More efficient oblivious transfer extensions with security for malicious adversaries
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A new approach to practical active-secure two-party computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Improved OT extension for transferring short secrets
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
Cited in
(41)- Two-round MPC: information-theoretic and black-box
- An efficient structural attack on NIST submission DAGS
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Actively secure OT-extension from \(q\)-ary linear codes
- Blazing fast OT for three-round UC OT extension
- Actively secure setup for SPDZ
- Efficient constant-round MPC with identifiable abort and public verifiability
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Efficient, actively secure MPC with a dishonest majority: a survey
- More efficient oblivious transfer extensions
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- On the complexity of additively homomorphic UC commitments
- The simplest protocol for oblivious transfer
- Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Binary AMD circuits from secure multiparty computation
- Making private function evaluation safer, faster, and simpler
- Non-interactive secure 2PC in the offline/online and batch settings
- Improved private set intersection against malicious adversaries
- Multiparty generation of an RSA modulus
- PrORAM
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Actively secure garbled circuits with constant communication overhead in the plain model
- 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 Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- New proof systems and an OPRF from CSIDH
- The hardness of LPN over any integer ring and field for PCG applications
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Honest majority MPC with \(\tilde{O}(|C|)\) communication in Minicrypt
- On tweakable correlation robust hashing against key leakages
- Single-input functionality against a dishonest majority: practical and round-optimal
- Correction to: ``Actively secure setup for SPDZ
- Honest majority constant-round MPC with linear communication from one-way functions
- On the round complexity of OT extension
This page was built for publication: Actively secure OT extension with optimal overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457136)
