Artikel
Open Access
A subexponential construction of graph coloring for multiparty computation
-
Hassan Jameel Asghar
,
Yvo Desmedt
Veröffentlicht/Copyright:
23. Juli 2014
Received: 2013-10-11
Revised: 2014-6-26
Accepted: 2014-7-4
Published Online: 2014-7-23
Published in Print: 2014-12-1
© 2014 by De Gruyter
Artikel in diesem Heft
- Frontmatter
- Efficient computation of pairings on Jacobi quartic elliptic curves
- A subexponential construction of graph coloring for multiparty computation
- Quantum computation of discrete logarithms in semigroups
- On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
Schlagwörter für diesen Artikel
Multiparty computation;
graph coloring;
non-Abelian group;
planar graph
Creative Commons
BY-NC-ND 3.0
Artikel in diesem Heft
- Frontmatter
- Efficient computation of pairings on Jacobi quartic elliptic curves
- A subexponential construction of graph coloring for multiparty computation
- Quantum computation of discrete logarithms in semigroups
- On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
