OT-Combiners via Secure Computation

DOI10.1007/978-3-540-78524-8_22zbMath1162.94366OpenAlexW1487501992MaRDI QIDQ5445517

Eyal Kushilevitz, Jesper Buus Nielsen, Yuval Ishai, Danny Harnik

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_22

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Oblivious transfer in incomplete networks ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ On \(d\)-multiplicative secret sharing ⋮ More efficient oblivious transfer extensions ⋮ Error-Tolerant Combiners for Oblivious Primitives ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ 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 ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages ⋮ Network Oblivious Transfer ⋮ On the Power of Secure Two-Party Computation ⋮ Amplifying the security of functional encryption, unconditionally

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oblivious transfer and privacy amplification
• Security and composition of multiparty cryptographic protocols
• Error-Tolerant Combiners for Oblivious Primitives
• Robuster Combiners for Oblivious Transfer
• How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• Foundations of Cryptography
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Secure Computation from Random Error Correcting Codes
• Oblivious-Transfer Amplification
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography
• A Zero-One Law for Boolean Privacy
• On Robust Combiners for Private Information Retrieval and Other Primitives
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Scalable Secure Multiparty Computation
• Theory of Cryptography