Welcome to the resource topic for 2010/467
Title:
Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles
Authors: Xinfeng Lei, Rui Xue, 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.
ePrint: https://eprint.iacr.org/2010/467
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .