On Robust Combiners for Private Information Retrieval and Other Primitives
From MaRDI portal
Publication:5756626
DOI10.1007/11818175_33zbMath1129.94030OpenAlexW2133848303MaRDI QIDQ5756626
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_33
cryptographic primitivesreductionsbit commitmentoblivious transferprivate information retrievalrobust combiners
Related Items (8)
Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ Error-Tolerant Combiners for Oblivious Primitives ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ OT-Combiners via Secure Computation ⋮ Obfuscation Combiners ⋮ Authenticated Byzantine Generals in Dual Failure Model
This page was built for publication: On Robust Combiners for Private Information Retrieval and Other Primitives