Some Constant-Round Zero-Knowledge Protocols

The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2010 (1), p.7-12
Main Author: LIU Hanwu LIN Dongdai
Format: Article
Language:English
Subjects:
复杂性
密码协议
零知识
验证程序
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zeroknowledge protocols is a very important efficiency consideration, and in general it is desirable to have zeroknowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the verifier and use the method to construct some constant round honest-verifier zero-knowledge protocols. The notion of honest-verifier zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.
ISSN:1022-4653