Structure of Computation and the Possibility of Individual Reduction

摘要：

The Problem Theorem:If X holds,then Y(X) is secure.the only known universal/constructive reduction:(E)R(A)A:If A breaks X,then R breaks Y.the security requirement(individual/existential reduction):(A)A(E)RA:If A breaks X,then RA breaks Y.Why ask for individual reductions?Possible to conduct individual reduction?Yes,but need to use some common structure shared by all possible Adversaries.

作者: Yi Deng

作者单位: State Key Lab.of Information security,CAS

会议类型: 国内会议

会议名称: 2017年安全协议进展国际会议

会议地点: 西安

会议语种:英文

页码: 1-40

在线出版日期: 2017-09-01（万方平台首次上网日期，不代表论文的发表时间）