Robuster Combiners for Oblivious Transfer
From MaRDI portal
Recommendations
Cited in
(20)- Oblivious transfer in incomplete networks
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Resource-efficient OT combiners with active security
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Amplifying the security of functional encryption, unconditionally
- More efficient oblivious transfer extensions
- Network oblivious transfer
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation combiners
- Authenticated Byzantine generals in dual failure model
- Secure computation from leaky correlated randomness
- Error-Tolerant Combiners for Oblivious Primitives
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- scientific article; zbMATH DE number 5532062 (Why is no real title available?)
- On Robust Combiners for Oblivious Transfer and Other Primitives
- OT-Combiners via Secure Computation
- On Robust Combiners for Private Information Retrieval and Other Primitives
- One-time programs from commodity hardware
- Combining oblivious pseudorandom functions
- Robust non-interactive zero-knowledge combiners
This page was built for publication: Robuster Combiners for Oblivious Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596394)