Then, there exists an interactive proof for a language L ∈ NP that is weak zero-knowledge but not (strong) zero-knowledge. Motivated by this ...
確定! 回上一頁