scientific article; zbMATH DE number 1942420

zbMath1026.94527MaRDI QIDQ4409117

Rosario Gennaro, Eyal Kushilevitz, Tal Rabin, Yuval Ishai

Publication date: 30 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420178.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsround complexitysecure multiparty computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (18)

Broadcast-optimal two round MPC with an honest majority ⋮ Round-optimal black-box protocol compilers ⋮ On fully secure MPC with solitary output ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ On communication models and best-achievable security in two-round MPC ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ The round complexity of statistical MPC with optimal resiliency ⋮ On the exact round complexity of secure three-party computation ⋮ The Power of Anonymous Veto in Public Discussion ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ MPC with friends and foes ⋮ Broadcast-optimal two-round MPC

This page was built for publication: