The Simplest Oblivious Transfer Protocol
summary
Claim: a minimal UC‑secure oblivious transfer construction in the random oracle model built from a Diffie‑Hellman trick plus a tiny non‑committing, robust one‑time‑pad style encryption. Protocol uses 5 exponentiations and sends two group elements + two ciphertexts. Proof extracts choice bits via oracle queries; keys must be honestly generated and ROM caveats apply. Reference implementation on elliptic curves runs about 300 microseconds per OT and amortizes to ~100 microseconds over 200 OTs.
AI-written summary · about
chapters (4)
- 0:00Start
- 4:57Diffie-Hellman Key Exchange
- 6:48Oblivious Transfer
- 11:39Implementation & "CryptoEngineering"
related talks
44mIOP based Zero-Knowledge Proofs
26mConstant-Time Callees with Variable-Time Callers
27mDifferentially Oblivious Turing Machines
22mScalable Zero-Knowledge Protocols From Vector-OLE
30mKEYNOTE Building Succinct Arguments from Ideal Hash Functions
23mUniversal Composability is Robust Compilation
40mWillow: Secure Aggregation with One-Shot Clients
52mDiscrete Log based Zero-Knowledge Proofs