检索结果-南通市图书馆

Round-optimal zero-knowledge proofs of knowledge for NP

Science china(information sciences) 2012年第11期55卷 2473-2484页

作者： LI HongDa1,FEng DengGuo2,LI Bao1 & XUE HaiXia1 1state key lab of information security,Graduate University of chinese academy of sciences,beij.ng 100049,china 2state key lab of information security,institute of software of chinese academy of sciences,beij.ng 100080,china 1. state key lab of information security Graduate University of Chinese Academy of Sciences Beijing 100049 China2. State Key Lab of Information Security Institute of software of Chinese Academy of Sciences Beijing 100080 China

It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are *** there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open *** paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round(black-box) zero-knowledge proofs of knowledge for the HC(hamiltonian cycle) *** the recent result of Katz,our second construction which relies on the existence of claw-free functions has optimal round complexity(5-round) assuming the polynomial hierarchy does not collapse.

关键词： zero-knowledge proofs proofs of knowledge black-box simulation constant-round

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Nondegenerative ML-sequences over ring Z/(2~e)

引用

chinese Science Bulletin 1999年第17期44卷 1557-1561页

作者： YAng Junhui and ZHAI Qibininstitute of software , chinese academy of sciences , beij.ng 100080, china state key laboratory of information security , beij.ng 100080, china chinese Acad Sci Inst Software Beijing 100080 Peoples R China state key lab Informat Secur Beijing 100080 Peoples R China

The so-called quasi-period of an ML-sequence has been introduced. It is noted that an ML-sequence may degenerate in the sense that it has the quasi-period shorter than its period, and the problem of constructing the n... 详细信息

关键词： nondegenerate ML-sequence quasi-period.

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A new one-bit diFFerence collision attack on HAVAL-128

引用

Science china(information sciences) 2012年第11期55卷 2521-2529页

作者： ZHAng WenYing1,2,3,LI YanYan1 & WU Lei1 1School of information Science and Engineering,Shandong Normal University,Jinan 250014,china 2state key lab of information security,institute of information Engineering,chinese academy of sciences,beij.ng 100093,china 3Shandong Provincial key laboratory for Novel Distributed Computer software Technology,Jinan 250014,china 1. School of information Science and Engineering Shandong Normal University Jinan 250014 China2. State Key Lab of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China3. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 250014 China

In this paper,we give a new fast attack on *** attack includes many present methods of constructing hash ***,we present a neighborhood *** propose a new difference path different from the previous *** conclusion is that,when the output of each step satisfies our condition,the message m can collide with m'= m + Δm,where Δm =(0,0,0,0,231,0,...,0).There is only one bit difference between m and m'.Two pairs of collision examples for HAVAL-128 are *** order to improve the probability of collision,we use four tricks of message *** attack's running time is less than 225.83 2-pass HAVAL computations,which is the best result for one-bit collision of HAVAL so far.

关键词： cryptography hash function HAVAL-128 collision message modification

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Leakproof secret sharing protocols with applications to group identification scheme

引用

Science china(information sciences) 2012年第5期55卷 1172-1185页

作者： TAng ChunMing 1,2 & GAO ShuHong 3 1 School of Mathematics and information Science,Guangzhou University,Guangzhou 510006,china 2 state key laboratory of information security,institute of software Science,chinese academy of sciences,beij.ng 100049,china 3 Department of Mathematical sciences,Clemson University,SC 29634,USA 1. School of Mathematics and information Science Guangzhou University Guangzhou 510006 China2. State Key Laboratory of Information Security Institute of Software Science Chinese Academy of Sciences Beijing 100049 China3. Department of Mathematical Sciences Clemson University Clemson SC 29634 USA

In a traditional (t,n)-threshold secret sharing scheme,t or more honest participants can reconstruct the secret *** the reconstruction process,the individual shares and the secret key K are revealed,hence K is shared once *** this paper,we firstly give the definition of leakproof secret sharing scheme which is composed of a distribution protocol and a proof protocol,then propose two leakproof secret sharing protocols,a computationally secure protocol and an information-theoretically secure *** our protocols,t or more participants can jointly prove that they hold the secret K by using a multi-prover zero-knowledge argument of *** a result,the secret K will be shared for as many times as ***,each participant can detect the dealer in the distribution protocol from cheating,and any verifier can prevent non-qualified set of participants in proof protocol from *** an example of the practical impact of our work we use our techniques to construct group identification schemes with zero-knowledge.

关键词： secret sharing leakproof secret sharing multi-prover zero-knowledge argument proof of knowl-edge group identification scheme

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Enhancing Trusted Computing Platform security with Compliance Validation

Enhancing Trusted Computing Platform Security with Complianc...

引用

中国电子学会第十五届信息论学术年会暨第一届全国网络编码学术年会

作者： CUI Qi~(1,2) SHI Wenchang~(2,3) 1.institute of software,chinese academy of Science beij.ng 100080 2.Craduate University,chinese academy of Science beij.ng 100080 3.MOE DEKE key lab,Renmin University of china beij.ng 100080

The Trusted Computing Group (TCG) has defined specifications for Trusted Computing,but criteria on compliance testing are still not *** is important that the design and implementation of TPM and other components follow the specifi- cations,as incompliance may lead to crucial security *** paper enhances the current model of chain of trust by con- structing a chain of compliance alongside.A primitive case study shows that the chain of compliance solidifies the trustworthiness of computing platforms by verifying the conformance of their components.

关键词： information security trusted computing Trusted Computing Croup(TCG) compliance

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：