TY - GEN
T1 - Computational soundness about formal encryption in the presence of secret shares and key cycles
AU - Lei, Xinfeng
AU - Xue, Rui
AU - Yu, Ting
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=81055147838&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25243-3_3
DO - 10.1007/978-3-642-25243-3_3
M3 - Conference contribution
AN - SCOPUS:81055147838
SN - 9783642252426
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 29
EP - 41
BT - Information and Communications Security - 13th International Conference, ICICS 2011, Proceedings
T2 - 13th International Conference on Information and Communications Security, ICICS 2011
Y2 - 23 November 2011 through 26 November 2011
ER -