Provably secure Rabin-p cryptosystem in hybrid setting

In this work, we design an efficient and provably secure hybrid cryptosystem depicted by a combination of the Rabin-p cryptosystem with an appropriate symmetric encryption scheme. We set up a hybrid structure which is proven secure in the sense of indistinguishable against the chosen-ciphertext atta...

Full description

Bibliographic Details
Main Authors: Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal
Format: Conference or Workshop Item
Language:English
Published: AIP Publishing 2016
Online Access:http://psasir.upm.edu.my/id/eprint/57191/
http://psasir.upm.edu.my/id/eprint/57191/1/Provably%20secure%20Rabin-p%20cryptosystem%20in%20hybrid%20setting.pdf
_version_ 1848853296260841472
author Asbullah, Muhammad Asyraf
Kamel Ariffin, Muhammad Rezal
author_facet Asbullah, Muhammad Asyraf
Kamel Ariffin, Muhammad Rezal
author_sort Asbullah, Muhammad Asyraf
building UPM Institutional Repository
collection Online Access
description In this work, we design an efficient and provably secure hybrid cryptosystem depicted by a combination of the Rabin-p cryptosystem with an appropriate symmetric encryption scheme. We set up a hybrid structure which is proven secure in the sense of indistinguishable against the chosen-ciphertext attack. We presume that the integer factorization problem is hard and the hash function that modeled as a random function.
first_indexed 2025-11-15T10:51:43Z
format Conference or Workshop Item
id upm-57191
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T10:51:43Z
publishDate 2016
publisher AIP Publishing
recordtype eprints
repository_type Digital Repository
spelling upm-571912017-09-08T09:41:49Z http://psasir.upm.edu.my/id/eprint/57191/ Provably secure Rabin-p cryptosystem in hybrid setting Asbullah, Muhammad Asyraf Kamel Ariffin, Muhammad Rezal In this work, we design an efficient and provably secure hybrid cryptosystem depicted by a combination of the Rabin-p cryptosystem with an appropriate symmetric encryption scheme. We set up a hybrid structure which is proven secure in the sense of indistinguishable against the chosen-ciphertext attack. We presume that the integer factorization problem is hard and the hash function that modeled as a random function. AIP Publishing 2016 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/57191/1/Provably%20secure%20Rabin-p%20cryptosystem%20in%20hybrid%20setting.pdf Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2016) Provably secure Rabin-p cryptosystem in hybrid setting. In: 2nd International Conference on Mathematical Sciences and Statistics (ICMSS2016), 26-28 Jan. 2016, Kuala Lumpur, Malaysia. (pp. 1-10). 10.1063/1.4952481
spellingShingle Asbullah, Muhammad Asyraf
Kamel Ariffin, Muhammad Rezal
Provably secure Rabin-p cryptosystem in hybrid setting
title Provably secure Rabin-p cryptosystem in hybrid setting
title_full Provably secure Rabin-p cryptosystem in hybrid setting
title_fullStr Provably secure Rabin-p cryptosystem in hybrid setting
title_full_unstemmed Provably secure Rabin-p cryptosystem in hybrid setting
title_short Provably secure Rabin-p cryptosystem in hybrid setting
title_sort provably secure rabin-p cryptosystem in hybrid setting
url http://psasir.upm.edu.my/id/eprint/57191/
http://psasir.upm.edu.my/id/eprint/57191/
http://psasir.upm.edu.my/id/eprint/57191/1/Provably%20secure%20Rabin-p%20cryptosystem%20in%20hybrid%20setting.pdf