How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

DOI10.1007/978-3-540-74143-5_16zbMath1215.94076OpenAlexW1505716701MaRDI QIDQ3612555

Danny Harnik, Eyal Kushilevitz, Yuval Ishai

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)

Related Items (7)

Oblivious transfer in incomplete networks ⋮ 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 ⋮ Must the communication graph of MPC protocols be an expander? ⋮ OT-Combiners via Secure Computation ⋮ Network Oblivious Transfer

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