首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Reduction zero-knowledge
Authors:ZHAO Yunlei  DENG Xiaotie  LEE CH  ZHU Hong
Institution:1. Department of Computer Science,Fudan University,Shanghai 200433,China;Department of Computer Science,City University of Hong Kong,Hong Kong,China
2. Department of Computer Science,City University of Hong Kong,Hong Kong,China
3. Department of Computer Science,Fudan University,Shanghai 200433,China
Abstract:The nature of zero-knowledge is re-examined and the evidence for the following belief is shown:the classic simulation based definitions of zero-knowledge(simulation zero-knowledge)may be somewhat too strong to include some "nice" protocols in which the malicious verifier seems to learn nothing but we do not know how to construct a zero-knowledge simulator for it.To overcome this problem a new relaxation of zero-knowledge,reduction zero-knowledge,is introduced.It is shown that reduction zero-knowledge just lies between simulation zero-knowledge and witness indistinguishability.Under the assumption of existence of one-way permutations a 4-round public-coin reduction zero-knowledge proof system for NP is presented and in practice this protocol works in 3 rounds since the first verifier's message can be fixed once and for all.
Keywords:zero-knowledge  non-interactive zero-knowledge  bit commitment  zap  witness indistinguishability
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《自然科学进展(英文版)》浏览原始摘要信息
点击此处可从《自然科学进展(英文版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号