On Secure Multi-party Computation in Black-Box Groups

DOI10.1007/978-3-540-74143-5_33zbMath1215.94042OpenAlexW1873383901MaRDI QIDQ3612572

Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang, Yvo G. 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

graph colouringplanar graphnon-Abelian groupmulti-party computationblack-box

Mathematics Subject Classification ID

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

Related Items (4)

Graph coloring applied to secure computation in non-abelian groups ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ Counting Method for Multi-party Computation over Non-abelian Groups

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