The simplest protocol for oblivious transfer
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A new approach to practical active-secure two-party computation
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- Efficient oblivious transfer protocols
- Efficient secure two-party protocols. Techniques and constructions
- Extending oblivious transfer efficiently or -- how to get active security with constant cryptographic overhead
- High-performance multi-party computation for binary circuits based on oblivious transfer
- High-speed high-security signatures
- More efficient oblivious transfer extensions with security for malicious adversaries
- Public Key Cryptography - PKC 2006
- Public Key Cryptography – PKC 2004
- Robust Encryption
- Robust encryption, revisited
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
Cited in
(43)- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Efficient Oblivious Transfer in the Bounded-Storage Model
- Simple oblivious transfer protocols compatible with supersingular isogenies
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Twot-out-of-n oblivious transfer schemes with designated receiver
- Cut-and-choose bilateral oblivious transfer
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Network oblivious transfer
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Faster secure two-party computation in the single-execution setting
- Endemic oblivious transfer via random oracles, revisited
- Almost optimal oblivious transfer from QA-NIZK
- Algebraic adversaries in the universal composability framework
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Popping ``R-propping: breaking hardness assumptions for matrix groups over \(\mathbb{F}_{2^8}\)
- Composable oblivious pseudo-random functions via garbled circuits
- A new t-out-n oblivious transfer with low bandwidth
- scientific article; zbMATH DE number 2127887 (Why is no real title available?)
- Extending white-box cryptography based oblivious transfer protocol
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Batch-OT with optimal rate
- Batching base oblivious transfers
- Blazing fast OT for three-round UC OT extension
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Oblivious transfer using non-abelian groups
- Efficient oblivious transfer protocols
- scientific article; zbMATH DE number 1941258 (Why is no real title available?)
- ``The simplest protocol for oblivious transfer revisited
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- Improved OT extension for transferring short secrets
- More efficient oblivious transfer extensions
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Hybrid zero-knowledge from garbled circuits
- A new efficient protocol for k-out-of-n oblivious transfer
- Oblivious Transfer Based on Key Exchange
- Accelerating oblivious transfer with batch multi-exponentiation
- A Framework for Efficient and Composable Oblivious Transfer
- A Simple Protocol Whose Proof Isn't
This page was built for publication: The simplest protocol for oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946440)
