Institutional Repository
| computational soundness about formal encryption in the presence of secret shares and key cycles | |
| Lei Xinfeng; Xue Rui; Yu Ting | |
| 2011 | |
| Conference Name | 13th International Conference on Information and Communications Security, ICICS 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 29-41 |
| Conference Date | November 2 |
| Conference Place | Beijing, China |
| 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 |
| 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.; 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. |
| Keyword | Computation Theory Cryptography |
| Sponsorship | National Natural Science Foundation of China (NNSFC); The Microsoft Corporation; Beijing Tip Technology Corporation; Trusted Computing Group (TCG) |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16209 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment