Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
verfasst von : Huafei Zhu
Erschienen in: Information Security Practice and Experience
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
It is a well-known result in the asynchronous model that no standard public-key encryption schemes tolerates adaptive adversaries in the universally composable framework. This paper provides a compiler technique that converts standard public-key encryptions tolerating non-adaptive and non-composable adversaries into interactive public-key encryptions tolerating adaptive and composable adversaries. The idea behind our compiler is that − a sender and a receiver interactively generate a mixed commitment on the fly. The generated mixed commitment is then used to set up a non-committing encryption channel between the sender and receiver on which arbitrary-many bits of messages are communicated. We show that the proposed interactive public-key encryption scheme realizes the uc-security in the presence of adaptive adversaries (i.e., the resulting interactive public-key encryption scheme tolerates adaptive and composable adversaries) assuming that the underlying mixed commitment scheme is secure in the common reference model.