On Robust Combiners for Private Information Retrieval and Other Primitives

DOI10.1007/11818175_33zbMath1129.94030OpenAlexW2133848303MaRDI QIDQ5756626

Remo Meier, Bartosz Przydatek

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

zbMATH Keywords

cryptographic primitivesreductionsbit commitmentoblivious transferprivate information retrievalrobust combiners

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20)

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