On Secure Multi-party Computation in Black-Box Groups
From MaRDI portal
Publication:3612572
DOI10.1007/978-3-540-74143-5_33zbMath1215.94042MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
94A60: Cryptography
05C15: Coloring of graphs and hypergraphs
68M12: Network protocols
94A62: Authentication, digital signatures and secret sharing
Related Items
Counting Method for Multi-party Computation over Non-abelian Groups, 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