Error-Tolerant Combiners for Oblivious Primitives
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 549858 (Why is no real title available?)
- Cascade ciphers: The importance of being first
- Error-Tolerant Combiners for Oblivious Primitives
- How to share a secret
- OT-Combiners via Secure Computation
- Oblivious Polynomial Evaluation
- Oblivious Transfer Is Symmetric
- Oblivious-Transfer Amplification
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- On the Reversibility of Oblivious Transfer
- Robuster Combiners for Oblivious Transfer
- Theory of Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
Cited in
(8)- On Robust Combiners for Private Information Retrieval and Other Primitives
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Resource-efficient OT combiners with active security
- Secure computation from leaky correlated randomness
- OT-Combiners via Secure Computation
- Error-Tolerant Combiners for Oblivious Primitives
- Robuster Combiners for Oblivious Transfer
- On Robust Combiners for Oblivious Transfer and Other Primitives
This page was built for publication: Error-Tolerant Combiners for Oblivious Primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519523)
