Abstract
In the field of modern cryptography, public key cryptography is widely used in various application scenarios in cyberspace. At present, a large number of public key schemes have been presented, but security proof of which has always been a difficulty. Furthermore, there is no corresponding work to introduce the idea of security proof of it currently. We usually only grasp several concept of security proof of public key schemes, but is difficult to clarify the whole logic of it. This paper overview the proof idea of public key schemes, and helps us understand why we need to introduce security model, how to prove the security of public key scheme through contradiction, how to generate a simulated scheme from an example of the hard problem based on which the real scheme is designed, and the difficulties of security proof. Finally, through specific examples, we can better understand the proof idea of public key schemes, and help us design more safer scheme in the field of public key cryptography.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Guo, F., Susilo, W., Mu, Y.: Introduction to Security Reduction. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-319-93049-7
Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press (2014). https://www.crcpress.com/Introduction-to-Modern-Cryptography-Second-Edition/Katz-Lindell/p/book/9781466570269
Bagherzandi, A., Azimian, K., Mohajeri, J., Salmasizadeh, M.: Relations between semantic security and indistinguishability against CPA, non-adaptive CCA and adaptive CCA in comparison based framework. CoRR, vol. abs/cs/0508110 (2005). http://arxiv.org/abs/cs/0508110
Boneh, D., Shoup, V.: A graduate course in applied cryptography (2020). http://toc.cryptobook.us/book.pdf
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45682-1_30
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194–209 (1988). https://doi.org/10.1137/0217013
Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054851
Zhen, Z., et al.: Brief introduction to the study of public-key scheme construction and its security proof. J. Cryptol. Res. 12(27), 1001–1013 (2017)
Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0055717
Durrett, R.: Probability: Theory and Examples, 4th edn. Cambridge University Press, Cambridge (2010). https://doi.org/10.1017/CBO9780511779398
Acknowledgment
We thank the editor and the associate editor for their time and efforts to deal with our manuscript.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, C., Bai, W., Huo, S., Shi, L. (2023). Survey of Security Proof of Public-Key Scheme. In: Barolli, L. (eds) Advances in Intelligent Networking and Collaborative Systems. INCoS 2023. Lecture Notes on Data Engineering and Communications Technologies, vol 182. Springer, Cham. https://doi.org/10.1007/978-3-031-40971-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-031-40971-4_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-40970-7
Online ISBN: 978-3-031-40971-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)