Actively secure OT extension with optimal overhead
From MaRDI portal
Publication:3457136
DOI10.1007/978-3-662-47989-6_35zbMATH Open1375.94138OpenAlexW2275295769MaRDI QIDQ3457136FDOQ3457136
Authors: 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
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 new approach to practical active-secure two-party computation
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Improved OT Extension for Transferring Short Secrets
Cited In (32)
- Efficient, actively secure MPC with a dishonest majority: a survey
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings
- Attaining GOD beyond honest majority with friends and foes
- Oblivious transfer with constant computational overhead
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- The hardness of LPN over any integer ring and field for PCG applications
- Multiparty generation of an RSA modulus
- The Simplest Protocol for Oblivious Transfer
- PrORAM
- Two-round MPC: information-theoretic and black-box
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Improved Private Set Intersection Against Malicious Adversaries
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Better security-efficiency trade-offs in permutation-based two-party computation
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- On the Complexity of Additively Homomorphic UC Commitments
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Batching base oblivious transfers
- Blazing fast OT for three-round UC OT extension
- Binary AMD Circuits from Secure Multiparty Computation
- New proof systems and an OPRF from CSIDH
- Efficient constant-round MPC with identifiable abort and public verifiability
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Making Private Function Evaluation Safer, Faster, and Simpler
- More efficient oblivious transfer extensions
- Actively secure setup for SPDZ
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
- An efficient structural attack on NIST submission DAGS
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Actively secure garbled circuits with constant communication overhead in the plain model
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)
