Provably secure Rabin-p cryptosystem in hybrid setting

Citation

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).

Abstract / Synopsis

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.

Download File

Preview

PDF (Abstract)
Provably secure Rabin-p cryptosystem in hybrid setting.pdf
Download (34kB) | Preview

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Science Institute for Mathematical Research
DOI Number:	10.1063/1.4952481
Publisher:	AIP Publishing
Keywords:	Hybrid cryptosystem; Rabin-p cryptosystem; Security
Depositing User:	Nabilah Mustapa
Date Deposited:	08 Sep 2017 17:41
Last Modified:	08 Sep 2017 17:41
Altmetrics:	http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1063/1.4952481
URI:	http://psasir.upm.edu.my/id/eprint/57191
Statistic Details:	View Download Statistic

Actions (login required)

View Item