Efficient Multiparty Protocols via Log-Depth Threshold Formulae

DOI10.1007/978-3-642-40084-1_11zbMath1316.94066OpenAlexW2113241723MaRDI QIDQ2849395

Ran Raz, Peter Bro Miltersen, Yuval Ishai, Gil Cohen, Jonas Kölker, Ron D. Rothblum, Ivan B. Damgård

Publication date: 17 September 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_11

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Broadcast from Minicast Secure Against General Adversaries ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ On (Valiant’s) Polynomial-Size Monotone Formula for Majority ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Secure computation with low communication from cross-checking ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Optimal explicit small-depth formulas for the coin problem ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On the complexity of the clone membership problem ⋮ Random probing security: verification, composition, expansion and new constructions ⋮ Black-box transformations from passive to covert security with public verifiability

This page was built for publication: Efficient Multiparty Protocols via Log-Depth Threshold Formulae