Abstract
In this chapter, we mainly use a variant of ElGamal encryption to introduce how to prove the security of encryption schemes under computational hardness assumptions. The basic scheme is called the hashed ElGamal scheme [1]. The twin ElGamal scheme and the iterated ElGamal scheme are from [29] and [55], respectively, and introduce two totally different approaches for addressing the reduction loss of finding a correct solution from hash queries. The ElGamal encryption scheme with CCA security is introduced using the Fujisaki-Okamoto transformation [42]. The given schemes and/or proofs may be different from the original ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Guo, F., Susilo, W., Mu, Y. (2018). Public-Key Encryption with Random Oracles. In: Introduction to Security Reduction. Springer, Cham. https://doi.org/10.1007/978-3-319-93049-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-93049-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93048-0
Online ISBN: 978-3-319-93049-7
eBook Packages: Computer ScienceComputer Science (R0)