Paper 2010/467
Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles
Xinfeng Lei, Rui Xue, and Ting Yu
Abstract
The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway. 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.
Note: Some typos are fixed.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- key cyclessecret sharingcomputational soundness
- Contact author(s)
- leixinfeng @ is iscas ac cn
- History
- 2010-12-20: last of 3 revisions
- 2010-09-08: received
- See all versions
- Short URL
- https://ia.cr/2010/467
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/467,
author = {Xinfeng Lei and Rui Xue and Ting Yu},
title = {Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/467},
year = {2010},
url = {https://eprint.iacr.org/2010/467}
}
