On Secure Multi-party Computation in Black-Box Groups

DOI10.1007/978-3-540-74143-5_33MaRDI QIDQ3612572zbMATH OpenOpenAlexWikidataFDO

Authors Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang, Yvo Desmedt

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_33

zbMATH Keywords

black-boxgraph colouringmulti-party computationnon-Abelian groupplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Active security in multiparty computation over black-box groups
• Round-efficient black-box construction of composable multi-party computation
• Round-efficient black-box construction of composable multi-party computation
• Multiparty Computations in Non-private Environments
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• scientific article; zbMATH DE number 1583776
• Secure multiparty computation of approximations
• Applying secure multi-party computation in practice
• Secure multi-party computation in large networks

Cited in

(9)

• Round-efficient black-box construction of composable multi-party computation
• Graph coloring applied to secure computation in non-abelian groups
• Active security in multiparty computation over black-box groups
• Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• scientific article; zbMATH DE number 1942426 (Why is no real title available?)
• A subexponential construction of graph coloring for multiparty computation
• Counting Method for Multi-party Computation over Non-abelian Groups
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation

This page was built for publication: On Secure Multi-party Computation in Black-Box Groups

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