Perfectly-Secure Multiplication for Any t < n/3

DOI10.1007/978-3-642-22792-9_14zbMath1287.94045OpenAlexW99790955MaRDI QIDQ5199194

Tal Rabin, Gilad Asharov, Yehuda Lindell

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience

This page was built for publication: Perfectly-Secure Multiplication for Any t < n/3