Computational soundness about formal encryption in the presence of secret shares and key cycles

Xinfeng Lei, Rui Xue, Ting Yu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages29-41
Number of pages13
Volume7043 LNCS
DOIs
Publication statusPublished - 17 Nov 2011
Externally publishedYes
Event13th International Conference on Information and Communications Security, ICICS 2011 - Beijing, China
Duration: 23 Nov 201126 Nov 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7043 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th International Conference on Information and Communications Security, ICICS 2011
CountryChina
CityBeijing
Period23/11/1126/11/11

Fingerprint

Soundness
Encryption
Cryptography
Coinduction
Cycle
Scenarios
Secret Sharing
Theorem
Knowledge

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lei, X., Xue, R., & Yu, T. (2011). Computational soundness about formal encryption in the presence of secret shares and key cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7043 LNCS, pp. 29-41). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7043 LNCS). https://doi.org/10.1007/978-3-642-25243-3_3

Computational soundness about formal encryption in the presence of secret shares and key cycles. / Lei, Xinfeng; Xue, Rui; Yu, Ting.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7043 LNCS 2011. p. 29-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7043 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lei, X, Xue, R & Yu, T 2011, Computational soundness about formal encryption in the presence of secret shares and key cycles. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7043 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7043 LNCS, pp. 29-41, 13th International Conference on Information and Communications Security, ICICS 2011, Beijing, China, 23/11/11. https://doi.org/10.1007/978-3-642-25243-3_3
Lei X, Xue R, Yu T. Computational soundness about formal encryption in the presence of secret shares and key cycles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7043 LNCS. 2011. p. 29-41. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-25243-3_3
Lei, Xinfeng ; Xue, Rui ; Yu, Ting. / Computational soundness about formal encryption in the presence of secret shares and key cycles. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7043 LNCS 2011. pp. 29-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{323a63d71a2e484894624ab65964c091,
title = "Computational soundness about formal encryption in the presence of secret shares and key cycles",
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.",
author = "Xinfeng Lei and Rui Xue and Ting Yu",
year = "2011",
month = "11",
day = "17",
doi = "10.1007/978-3-642-25243-3_3",
language = "English",
isbn = "9783642252426",
volume = "7043 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "29--41",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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/11/17

Y1 - 2011/11/17

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

UR - http://www.scopus.com/inward/citedby.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

VL - 7043 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 29

EP - 41

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -