Counting Method for Multi-party Computation over Non-abelian Groups
From MaRDI portal
Publication:5502759
DOI10.1007/978-3-540-89641-8_12zbMath1362.94047MaRDI 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
graph coloring; random walk; multiparty computation; neighbor-avoiding walk; non-Abelian groups; passive adversary
94A60: Cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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.122 lattice
- Foundations of Cryptography
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable Secure Multiparty Computation