中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
concurrently non-malleable black-box zero knowledge in the bare public-key model

文献类型:会议论文

作者Deng Yi ; Di Crescenzo Giovanni ; Lin Dongdai ; Feng Dengguo
出版日期2009
会议名称4th International Computer Science Symposium
会议日期AUG 18-23,
会议地点Novosibirsk, RUSSIA
关键词Linguistics Query languages
英文摘要In this paper we study the possibility of reducing the setup assumptions under which concurrent non-malleable zero knowledge protocol can be realized. A natural model choice is the bare public-key (BPK) model of 6, a model with very minimal setup assumptions. Our main contribution is to show in this model the following about constant-round concurrent non-malleable black-box zero-knowledge arguments. - They can be constructed from any one-way function for any language in NP. Here, our construction takes 5 rounds, and we can reduce it to a round (round-optimal) argument under existence of one-way permutations. - Under number-theoretic assumptions, they admit a time-efficient instantiation for some specific NP languages (e.g., all languages having efficient Sigma protocols, for which we can implement our construction using only O(1) modular exponentiations). Compared to the non-black-box construct ion in a concurrent work of OPV, ICALP 2008 in this model, our protocol (even the construction from one-way function) is significantly more time- and round-efficient and can be based on more general assumptions.
会议主办者Russian Fdn Bas Res, Yandex
会议录Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版者COMPUTER SCIENCE - THEORY AND APPLICATIONS
会议录出版地HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN号0302-9743
ISBN号978-3-642-03350-6
源URL[http://124.16.136.157/handle/311060/8334]  
专题软件研究所_信息安全国家重点实验室_会议论文
推荐引用方式
GB/T 7714
Deng Yi,Di Crescenzo Giovanni,Lin Dongdai,et al. concurrently non-malleable black-box zero knowledge in the bare public-key model[C]. 见:4th International Computer Science Symposium. Novosibirsk, RUSSIA. AUG 18-23,.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。