Oblivious Transfer and Linear Functions
From MaRDI portal
Publication:5756629
DOI10.1007/11818175_26zbMATH Open1129.94018OpenAlexW1504931234MaRDI QIDQ5756629FDOQ5756629
Authors: Serge Fehr, Louis Salvail, Christian Schaffner, Ivan B. Damgård
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_26
Recommendations
Cited In (13)
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- Title not available (Why is that?)
- Statistically secure linear-rate dimension extension for oblivious affine function evaluation
- Oblivious Transfer Based on the McEliece Assumptions
- Oblivious transfer and \(n\)-variate linear function evaluation
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
- Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
- Oblivious transfers and intersecting codes
- Oblivious transfer and polynomial evaluation
- Title not available (Why is that?)
- Weak oblivious transfer from strong one-way functions
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)