Article A subexponential construction of graph coloring for multiparty computation
Hassan Jameel Asghar, Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld
2014
Asghar, Hassan Jameel, Desmedt, Yvo, Pieprzyk, Josef and Steinfeld, Ron. "A subexponential construction of graph coloring for multiparty computation" Journal of Mathematical Cryptology, vol. 8, no. 4, 2014, pp. 363-403. https://doi.org/10.1515/jmc-2013-0035
Asghar, H., Desmedt, Y., Pieprzyk, J. & Steinfeld, R. (2014). A subexponential construction of graph coloring for multiparty computation. Journal of Mathematical Cryptology, 8(4), 363-403. https://doi.org/10.1515/jmc-2013-0035
Asghar, H., Desmedt, Y., Pieprzyk, J. and Steinfeld, R. (2014) A subexponential construction of graph coloring for multiparty computation. Journal of Mathematical Cryptology, Vol. 8 (Issue 4), pp. 363-403. https://doi.org/10.1515/jmc-2013-0035
Asghar, Hassan Jameel, Desmedt, Yvo, Pieprzyk, Josef and Steinfeld, Ron. "A subexponential construction of graph coloring for multiparty computation" Journal of Mathematical Cryptology 8, no. 4 (2014): 363-403. https://doi.org/10.1515/jmc-2013-0035
Asghar H, Desmedt Y, Pieprzyk J, Steinfeld R. A subexponential construction of graph coloring for multiparty computation. Journal of Mathematical Cryptology. 2014;8(4): 363-403. https://doi.org/10.1515/jmc-2013-0035
Copied to clipboard