Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)

DOI10.1007/978-3-642-40084-1_11MaRDI QIDQ2849395zbMATH OpenOpenAlexFDO

Authors Gil Cohen, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, 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)

Recommendations

• scientific article; zbMATH DE number 176564
• Concrete efficiency improvements for multiparty garbling with an honest majority
• scientific article; zbMATH DE number 1808209
• Perfectly-Secure MPC with Linear Communication Complexity
• scientific article; zbMATH DE number 2009981

Cited in

(21)

• Circuits and multi-party protocols
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• Secure computation with low communication from cross-checking
• 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
• Efficient information-theoretic multi-party computation over non-commutative rings
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
• Broadcast from minicast secure against general adversaries
• A hierarchy theorem for interactive proofs of proximity
• Multiparty karchmer: wigderson games and threshold circuits
• Multiparty Karchmer-Wigderson games and threshold circuits
• On (Valiant’s) Polynomial-Size Monotone Formula for Majority
• On the computational overhead of MPC with dishonest majority
• Doubly efficient interactive proofs over infinite and non-commutative rings
• Optimal explicit small-depth formulas for the coin problem
• How to share an NP statement or combiners for zero-knowledge proofs
• NIZK amplification via leakage-resilient secure computation
• Towards simpler sorting networks and monotone circuits for majority

This page was built for publication: Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)

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