中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
computational soundness about formal encryption in the presence of secret shares and key cycles
Author: Lei Xinfeng ; Xue Rui ; Yu Ting
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 13th International Conference on Information and Communications Security, ICICS 2011
Conference Date: November 2
Issued Date: 2011
Conference Place: Beijing, China
Keyword: Computation theory ; Cryptography
Indexed Type: EI ; SPRINGER
ISSN: 0302-9743
ISBN: 9783642252426
Department: (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
Sponsorship: National Natural Science Foundation of China (NNSFC); The Microsoft Corporation; Beijing Tip Technology Corporation; Trusted Computing Group (TCG)
Abstract: 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.
English Abstract: 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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16209
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Lei Xinfeng,Xue Rui,Yu Ting. computational soundness about formal encryption in the presence of secret shares and key cycles[C]. 见:13th International Conference on Information and Communications Security, ICICS 2011. Beijing, China. November 2.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Lei Xinfeng]'s Articles
[Xue Rui]'s Articles
[Yu Ting]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Lei Xinfeng]‘s Articles
[Xue Rui]‘s Articles
[Yu Ting]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace