computational soundness about formal encryption in the presence of secret shares and key cycles

ISCAS OpenIR

	computational soundness about formal encryption in the presence of secret shares and key cycles
	Lei Xinfeng; Xue Rui; Yu Ting
	2011
会议名称	13th International Conference on Information and Communications Security, ICICS 2011
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	29-41
会议日期	November 2
会议地点	Beijing, China
收录类别	EI ; SPRINGER
ISSN	0302-9743
ISBN	9783642252426
部门归属	(1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China; (2) Department of Computer Science North Carolina State University United States
摘要	The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway[1]. Recent work considers the scenario in which secret sharing is needed, and separately, the scenario when key cycles are present. The novel technique is the use of a co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of formal encryption in the presence of both key cycles and secret shares at the same time, which is a non-trivial extension of former approaches. © 2011 Springer-Verlag.; The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway[1]. Recent work considers the scenario in which secret sharing is needed, and separately, the scenario when key cycles are present. The novel technique is the use of a co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of formal encryption in the presence of both key cycles and secret shares at the same time, which is a non-trivial extension of former approaches. © 2011 Springer-Verlag.
关键词	Computation Theory Cryptography
主办者	National Natural Science Foundation of China (NNSFC); The Microsoft Corporation; Beijing Tip Technology Corporation; Trusted Computing Group (TCG)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16209
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Lei Xinfeng,Xue Rui,Yu Ting. computational soundness about formal encryption in the presence of secret shares and key cycles[C],2011:29-41.