Robuster Combiners for Oblivious Transfer

DOI10.1007/978-3-540-70936-7_22zbMath1129.94031OpenAlexW2143222367MaRDI QIDQ3596394

Bartosz Przydatek, Remo Meier, Jürg Wullschleger

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_22

zbMATH Keywords

oblivious transferrobust combinersweak oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Oblivious transfer in incomplete networks ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secure Computation from Leaky Correlated Randomness ⋮ One-time programs from commodity hardware ⋮ Error-Tolerant Combiners for Oblivious Primitives ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ OT-Combiners via Secure Computation ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages ⋮ Network Oblivious Transfer ⋮ Obfuscation Combiners ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ Amplifying the security of functional encryption, unconditionally

This page was built for publication: Robuster Combiners for Oblivious Transfer