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: | 软件所图书馆_会议论文
|
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.
|
|
|