首页|Round-optimal zero-knowledge proofs of knowledge for NP

Round-optimal zero-knowledge proofs of knowledge for NP

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are nonconstant-round.Whether there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open problem.This paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round (black-box) zero-knowledge proofs of knowledge for the HC (hamiltonian cycle) problem.By the recent result of Katz,our second construction which reiies on the existence of claw-free functions has optimal round complexity (5-round) assuming the polynomial hierarchy does not collapse.

zero-knowledge proofsproofs of knowledgeblack-box simulationconstant-round

LI HongDa、FENG DengGuo、LI Bao、XUE HaiXia

展开 >

State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences,Beijing 100049, China

State Key Lab of Information Security, Institute of software of Chinese Academy of Sciences,Beijing 100080, China

国家重点基础研究发展规划(973计划)国家重点基础研究发展规划(973计划)国家自然科学基金National High-Tech Research & Development Plan of ChinaStrategic Priority Program of Chinese Academy of Sciences

2007CB3112022007CB311201609701392006AA01Z427XDA06010702

2012

10.1007/s11432-011-4379-4

中国科学:信息科学(英文版)
中国科学院

中国科学:信息科学(英文版)

SCI
影响因子：0.715
ISSN：1674-733X
年,卷(期)：2012.55(11)
  • 16