Graph Design for Secure Multiparty Computation over Non-Abelian Groups

DOI10.1007/978-3-540-89255-7_3zbMath1206.94093OpenAlexW2105250218MaRDI QIDQ3600363

Andrew Chi-Chih Yao, Xiaoming Sun, Christophe Tartary

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_3

zbMATH Keywords

graph coloringpercolation theorynon-abelian groupsmultiparty computationpassive adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Graph coloring applied to secure computation in non-abelian groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• Percolation Processes: Lower Bounds for the Critical Probability
• Percolation
• 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
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation