Cryptology ePrint Archive: Report 2010/467

Computational Soundness about Formal Encryption in the Presence of Secret Shares and Key Cycles

Xinfeng Lei and 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.

Category / Keywords: foundations / key cycles, secret sharing, computational soundness

Date: received 3 Sep 2010, last revised 19 Dec 2010

Contact author: leixinfeng at is iscas ac cn

Available format(s): PDF | BibTeX Citation

Note: Some typos are fixed.

Version: 20101220:030726 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]