How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

DOI10.1007/978-3-540-74143-5_16MaRDI QIDQ3612555zbMATH OpenOpenAlexFDO

Authors D. Harnik, Yuval Ishai, Eyal Kushilevitz

Publication date 10 March 2009

Published in Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74143-5_16

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Network oblivious transfer
• More efficient oblivious transfer extensions
• Founding Cryptography on Oblivious Transfer – Efficiently
• Oblivious-Transfer Amplification
• OT-Combiners via Secure Computation

Cited in

(8)

• Oblivious transfer in incomplete networks
• Network oblivious transfer
• OT-Combiners via Secure Computation
• Must the communication graph of MPC protocols be an expander?
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• SCALES. MPC with small clients and larger ephemeral servers
• How to recover a secret with O(n) additions
• Weakly super-invertible matrices and constant communication dishonest majority MPC

This page was built for publication: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

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