Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
verfasst von : Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup
Erschienen in: Public Key Cryptography – PKC 2010
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
This paper proposes practical chosen-ciphertext secure public-key encryption systems that are provably secure under the
computational
Diffie-Hellman assumption, in the standard model. Our schemes are conceptually simpler and more efficient than previous constructions. We also show that in bilinear groups the size of the public-key can be shrunk from
n
to
$2\sqrt{n}$
group elements, where
n
is the security parameter.