A two-round honest-verifier zero-knowledge protocol |
| |
| Authors: | LIU HanWu & LIN DongDai The State Key Laboratory of Information Security |
| |
| Affiliation: | LIU HanWu 1,2 & LIN DongDai 1 1 The State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Sciences,Beijing 100190,China,2 Graduate University of the Chinese Academy of Sciences,Beijing 100049 |
| |
| Abstract: | Since the concept of zero-knowledge protocols was introduced, it has attracted a lot of attention and in turn showed significant effect on the development of cryptography, complexity theory and other areas. The round complexity of a zero-knowledge protocol is a very important efficiency consideration, and it is required to be as small as possible. Generally, it is desirable to have zero-knowledge protocols with constant numbers of rounds. Goldreich and Oren proved that only languages in BPP have one-round a... |
| |
| Keywords: | proof system argument system zero-knowledge witness indistinguishability black-box one-way permutation commitment scheme zap |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
