Error-Tolerant Combiners for Oblivious Primitives

DOI10.1007/978-3-540-70583-3_38zbMath1155.94382OpenAlexW1580656816MaRDI QIDQ3519523

Jürg Wullschleger, Bartosz Przydatek

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_38

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Error-Tolerant Combiners for Oblivious Primitives ⋮ OT-Combiners via Secure Computation

Cites Work

• Unnamed Item
• Cascade ciphers: The importance of being first
• How to share a secret
• Error-Tolerant Combiners for Oblivious Primitives
• Oblivious Transfer Is Symmetric
• Robuster Combiners for Oblivious Transfer
• On the Reversibility of Oblivious Transfer
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Oblivious-Transfer Amplification
• OT-Combiners via Secure Computation
• Oblivious Polynomial Evaluation
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography
• Theory of Cryptography
• On Robust Combiners for Private Information Retrieval and Other Primitives

This page was built for publication: Error-Tolerant Combiners for Oblivious Primitives