一种关于离散根问题的完美零知识证明系统

A Perfect Zero-Knowledge Proof System for the Discrete Root Problem

本文提出了一种关于离散根问题的完美零知识证明系统 ,并且其零知识性不依赖于任何前提假设 .我们的工作提供了完美零知识证明系统以非平凡方式存在 (对于不在BPP中的语言存在 )

This paper presents a perfect zero knowledge proof system for a decision problem which is computationally equivalent to the Discrete Root Problem,and its zero knowledge property does not rely on any assumptions.Thus we provide additional evidence to the belief that perfect zero knowledge proof systems exist in a non trivial manner (i.e.,for language not in BPP).