A subexponential construction of graph coloring for multiparty computation

DOI10.1515/JMC-2013-0035MaRDI QIDQ490341zbMATHOpenAlexWikidataFDO

Authors Hassan Jameel Asghar, Josef Pieprzyk, Ron Steinfeld, Yvo Desmedt

Publication date 22 January 2015

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://eprints.qut.edu.au/82448/1/82448.pdf

zbMATH Keywords

graph coloringplanar graphmultiparty computationnon-abelian group

Mathematics Subject Classification ID

Cryptography (94A60) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Graph coloring applied to secure computation in non-abelian groups
• On Secure Multi-party Computation in Black-Box Groups
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• Counting Method for Multi-party Computation over Non-abelian Groups
• Active security in multiparty computation over black-box groups

Cited in

(3)

• Graph coloring applied to secure computation in non-abelian groups
• 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: A subexponential construction of graph coloring for multiparty computation

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