Graph coloring applied to secure computation in non-abelian groups

DOI10.1007/s00145-011-9104-3zbMath1278.94046OpenAlexW1590063586WikidataQ59484974 ScholiaQ59484974MaRDI QIDQ1928772

Ron Steinfeld, Christophe Tartary, Xiaoming Sun, Josef Pieprzyk, Huaxiong Wang, Andrew Chi-Chih Yao, Yvo G. Desmedt

Publication date: 4 January 2013

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

Full work available at URL: http://link.springer.com/article/10.1007%2Fs00145-011-9104-3

zbMATH Keywords

graph coloringword problemplanar graphpercolation theorymultiparty computationnon-abelian groupblack-box operations

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coloring of graphs and hypergraphs (05C15) Special aspects of infinite or finite groups (20F99) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group-based cryptography
• Critical exponents for two-dimensional percolation
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• How to share a secret
• Percolation Processes: Lower Bounds for the Critical Probability
• Percolation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• Scalable and Unconditionally Secure Multiparty Computation
• On Secure Multi-party Computation in Black-Box Groups
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Foundations of Cryptography
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Algorithms and Computation
• Theory of Cryptography

This page was built for publication: Graph coloring applied to secure computation in non-abelian groups