Efficient 4-round zero-knowledge proof system for NP

2002Computer Science被引 1

摘要

A 4-round zero-knowledge interactive proof system for NP (Non-deterministic Polynomial) is presented when assuming the existence of one-way permutations and collision-free hash functions. This construction is more efficient than the original construction of 5-round zero-knowledge proof system for NP. The critical tools used in this paper are: zap, hash-based commitment scheme and non-interactive zero-knowledge.

引用本文（GB/T 7714）

Yunlei Zhao. Efficient 4-round zero-knowledge proof system for NP[J]. 未知来源, 2002.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。