Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Composition Implies Adaptive Security in Minicrypt
verfasst von : Krzysztof Pietrzak
Erschienen in: Advances in Cryptology - EUROCRYPT 2006
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
To prove that a secure key-agreement protocol exists one must at least show
P
≠
NP
. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom functions is secure against at least two adaptive queries must falsify the decisional Diffie-Hellman assumption, a standard assumption from public-key cryptography. Hence proving any of this two seemingly unrelated statements would require a significant breakthrough. We show that
at least one
of the two statements is true.
To our knowledge this gives the first
positive
cryptographic result (namely that composition implies some weak adaptive security) which holds in
Minicrypt
, but not in
Cryptomania
, i.e. under the assumption that one-way functions exist, but public-key cryptography does not.