Journal of mathematical cryptology | |
A subexponential construction of graph coloring for multiparty computation | |
article | |
Hassan Jameel Asghar1  Yvo Desmedt2  Josef Pieprzyk4  Ron Steinfeld5  | |
[1] National ICT Australia (NICTA);Department of Computer Science, University College London;Department of Computer Science, University of Texas at Dallas;School of Electrical Engineering and Computer Science, Science and Engineering Faculty, Queensland University of Technology;Clayton School of Information Technology, Faculty of Information Technology, Monash University | |
关键词: Multiparty computation; graph coloring; non-Abelian group; planar graph; | |
DOI : 10.1515/jmc-2013-0035 | |
学科分类:社会科学、人文和艺术(综合) | |
来源: De Gruyter | |
【 摘 要 】
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any t
CC BY|CC BY-NC-ND 【 授权许可】
【 预 览 】
Files
Size
Format
View
RO202107200005279ZK.pdf
393KB
PDF
download