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

DOI10.1007/978-3-540-89641-8_12MaRDI QIDQ5502759zbMATH OpenOpenAlexFDO

Authors Youming Qiao, Christophe Tartary

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 coloringmultiparty computationneighbor-avoiding walknon-Abelian groupspassive adversaryrandom walk

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

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

Cites work

• Foundations of Cryptography
• General secure multi-party computation from any linear secret-sharing scheme
• scientific article; zbMATH DE number 1583776 (Why is no real title available?)
• scientific article; zbMATH DE number 4051007 (Why is no real title available?)
• scientific article; zbMATH DE number 1024108 (Why is no real title available?)
• scientific article; zbMATH DE number 1842487 (Why is no real title available?)
• On Secure Multi-party Computation in Black-Box Groups
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation
• Self-avoiding walks and trails on the 3.12² lattice

Cited in

(3)

• Graph coloring applied to secure computation in non-abelian groups
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups
• A subexponential construction of graph coloring for multiparty computation

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

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