OT-Combiners via Secure Computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- scientific article; zbMATH DE number 1842487 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Zero-One Law for Boolean Privacy
- Advances in Cryptology - CRYPTO 2003
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Error-Tolerant Combiners for Oblivious Primitives
- Foundations of Cryptography
- General secure multi-party computation from any linear secret-sharing scheme
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Oblivious transfer and privacy amplification
- 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
- Robuster Combiners for Oblivious Transfer
- Scalable Secure Multiparty Computation
- Secure Computation from Random Error Correcting Codes
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
Cited in
(24)- On Robust Combiners for Private Information Retrieval and Other Primitives
- On \(d\)-multiplicative secret sharing
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- On the complexity of additively homomorphic UC commitments
- Oblivious transfer in incomplete networks
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Resource-efficient OT combiners with active security
- Network oblivious transfer
- Secure computation from leaky correlated randomness
- On perfectly secure 2PC in the OT-hybrid model
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- High-performance multi-party computation for binary circuits based on oblivious transfer
- On the Power of Secure Two-Party Computation
- Combiners for functional encryption, unconditionally
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- Amplifying the security of functional encryption, unconditionally
- Error-Tolerant Combiners for Oblivious Primitives
- Robuster Combiners for Oblivious Transfer
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Stochastic secret sharing with 1-bit shares and applications to MPC
- More efficient oblivious transfer extensions
- On the power of secure two-party computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Secret Sharing Schemes with Algebraic Properties and Applications
This page was built for publication: OT-Combiners via Secure Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445517)
