On Robust Combiners for Private Information Retrieval and Other Primitives

DOI10.1007/11818175_33MaRDI QIDQ5756626zbMATH OpenOpenAlexFDO

Authors 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

bit commitmentcryptographic primitivesoblivious transferprivate information retrievalreductionsrobust combiners

Mathematics Subject Classification ID

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

Recommendations

• On Robust Combiners for Oblivious Transfer and Other Primitives
• Robuster Combiners for Oblivious Transfer
• Error-Tolerant Combiners for Oblivious Primitives
• OT-Combiners via Secure Computation
• Resource-efficient OT combiners with active security

Cited in

(14)

• Secure computation using leaky correlations (asymptotically optimal constructions)
• Robust information-theoretic private information retrieval
• Obfuscation combiners
• Authenticated Byzantine generals in dual failure model
• Secure computation from leaky correlated randomness
• Error-Tolerant Combiners for Oblivious Primitives
• Robuster Combiners for Oblivious Transfer
• Compression from Collisions, or Why CRHF Combiners Have a Long Output
• On Robust Combiners for Oblivious Transfer and Other Primitives
• OT-Combiners via Secure Computation
• Random oracle combiners: breaking the concatenation barrier for collision-resistance
• Random oracle combiners: Merkle-Damgård style
• Combining oblivious pseudorandom functions
• Robust non-interactive zero-knowledge combiners

This page was built for publication: On Robust Combiners for Private Information Retrieval and Other Primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756626)