Oblivious Transfer and Linear Functions
From MaRDI portal
Publication:5756629
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 2085197 (Why is no real title available?)
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- Statistically secure linear-rate dimension extension for oblivious affine function evaluation
- Weak oblivious transfer from strong one-way functions
- Equational security proofs of oblivious transfer protocols
- Oblivious transfer and \(n\)-variate linear function evaluation
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Oblivious transfers and intersecting codes
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- scientific article; zbMATH DE number 826067 (Why is no real title available?)
- Oblivious Transfer Based on the McEliece Assumptions
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Oblivious transfer and polynomial evaluation
This page was built for publication: Oblivious Transfer and Linear Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756629)