Counting Method for Multi-party Computation over Non-abelian Groups

DOI10.1007/978-3-540-89641-8_12zbMath1362.94047OpenAlexW2109904811MaRDI QIDQ5502759

Christophe Tartary, Youming Qiao

Publication date: 9 January 2009

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89641-8_12

zbMATH Keywords

graph coloringrandom walkmultiparty computationneighbor-avoiding walknon-Abelian groupspassive adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• On Secure Multi-party Computation in Black-Box Groups
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Self-avoiding walks and trails on the 3.12² lattice
• Foundations of Cryptography
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting Method for Multi-party Computation over Non-abelian Groups