Sharifah Yasin

Dr. Sharifah Yasin

Faculty Computer Science and Information Technology, Universiti Putra Malaysia
+1
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 April 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Hassan Mansur HussienHassan Mansur Hussien
Hassan Mansur Hussien
SYSharifah Yasin
Sharifah Yasin
NUNur Izura Udzir
Nur Izura Udzir
MNMohd Izuan Hafez Ninggal
Mohd Izuan Hafez Ninggal
Blockchain technology provides a tremendous opportunity to transform current personal health record (PHR) systems into a decentralised network infrastructure. However, such technology possesses some drawbacks, such as issues in privacy and storage capacity. Given its transparency and decentralised features, medical data are visible to everyone on the network and are inappropriate for certain medical applications. By contrast, storing vast medical data, such as patient medical history, laboratory tests, X-rays, and MRIs, significantly affect the repository storage of blockchain. This study bridges the gap between PHRs and blockchain technology by offloading the vast medical data into the InterPlanetary File System (IPFS) storage and establishing an enforced cryptographic authorisation and access control scheme for outsourced encrypted medical data. The access control scheme is constructed on the basis of the new lightweight cryptographic concept named smart contract-based attribute-based searchable encryption (SC-ABSE). This newly cryptographic primitive is developed by extending ciphertext-policy attribute-based encryption (CP-ABE) and searchable symmetric encryption (SSE) and by leveraging the technology of smart contracts to achieve the following: (1) efficient and secure fine-grained access control of outsourced encrypted data, (2) confidentiality of data by eliminating trusted private key generators, and (3) multikeyword searchable mechanism. Based on decisional bilinear Diffie–Hellman hardness assumptions (DBDH) and discrete logarithm (DL) problems, the rigorous security indistinguishability analysis indicates that SC-ABSE is secure against the chosen-keyword attack (CKA) and keyword secrecy (KS) in the standard model. In addition, user collusion attacks are prevented, and the tamper-proof resistance of data is ensured. Furthermore, security validation is verified by simulating a formal verification scenario using Automated Validation of Internet Security Protocols and Applications (AVISPA), thereby unveiling that SC-ABSE is resistant to man-in-the-middle (MIM) and replay attacks. The experimental analysis utilised real-world datasets to demonstrate the efficiency and utility of SC-ABSE in terms of computation overhead, storage cost and communication overhead. The proposed scheme is also designed and developed to evaluate throughput and latency transactions using a standard benchmark tool known as Caliper. Lastly, simulation results show that SC-ABSE has high throughput and low latency, with an ultimate increase in network life compared with traditional healthcare systems.

26 July 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RTReema Ahmed Abdalla Bin Thabit
Reema Ahmed Abdalla Bin Thabit
NUNur Izura Udzir
Nur Izura Udzir
SYSharifah Yasin
Sharifah Yasin
AAAziah Asmawi
Aziah Asmawi
NRNuur Alifah Roslan
Nuur Alifah Roslan
RDRoshidi Din
Roshidi Din
Protecting sensitive information transmitted via public channels is a significant issue faced by governments, militaries, organizations, and individuals. Steganography protects the secret information by concealing it in a transferred object such as video, audio, image, text, network, or DNA. As text uses low bandwidth, it is commonly used by Internet users in their daily activities, resulting a vast amount of text messages sent daily as social media posts and documents. Accordingly, text is the ideal object to be used in steganography, since hiding a secret message in a text makes it difficult for the attacker to detect the hidden message among the massive text content on the Internet. Language’s characteristics are utilized in text steganography. Despite the richness of the Arabic language in linguistic characteristics, only a few studies have been conducted in Arabic text steganography. To draw further attention to Arabic text steganography prospects, this paper reviews the classifications of these methods from its inception. For analysis, this paper presents a comprehensive study based on the key evaluation criteria (i.e., capacity, invisibility, robustness, and security). It opens new areas for further research based on the trends in this field.

9 December 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
AGAmir Hamzah Abd Ghafar
Amir Hamzah Abd Ghafar
MAMUHAMMAD REZAL KAMEL ARIFFIN
MUHAMMAD REZAL KAMEL ARIFFIN
SYSharifah Yasin
Sharifah Yasin
SSSiti Hasana Sapar
Siti Hasana Sapar
The CRT-RSA cryptosystem is the most widely adopted RSA variant in digital applications. It exploits the properties of the Chinese remainder theorem (CRT) to elegantly reduce the size of the private keys. This significantly increases the efficiency of the RSA decryption algorithm. Nevertheless, an attack on RSA may also be applied to this RSA variant. One of the attacks is called partially known private key attack, that relies on the assumption that the adversary has knowledge of partial bits regarding RSA private keys. In this paper, we mount this type of attack on CRT-RSA. By using partial most significant bits (MSBs) of one of the RSA primes, p or q and its corresponding private exponent, d, we obtain an RSA intermediate. The intermediate is derived from p−1 and RSA public key, e. The analytical and novel reason on the success of our attack is that once the adversary has obtained the parameters: approximation of private exponent d˜p, approximation of p, p˜ and the public exponent e where d˜p,p˜,e=Nα/2 where 0<α≤1/4 such that |dp−d˜p|,|p−p˜|<N1−α2 and has determined the largest prime of p−1e, it will enable the adversary to factor the RSA modulus N=pq. Although the parameter space to find the prime factor is large, we show that one can adjust its “success appetite” by applying prime-counting function properties. By comparing our method with contemporary partial key attacks on CRT-RSA, upon determining a suitable predetermined “success appetite” value, we found out that our method required fewer bits of the private keys in order to factor N.

31 August 2015 in International Journal on Communications Antenna and Propagation (IRECAP)
Verified
Journal Article
Closed access
PDF file
MBMohsen Bafandehkar
Mohsen Bafandehkar
SYSharifah Yasin
Sharifah Yasin
RMRamlan Mahmod
Ramlan Mahmod
Elliptic Curve Cryptosystem (ECC) is a type of public key cryptography (PKC) based on the algebraic structure of elliptic curve over finite fields. In mid 80s Neal Koblitz and Victor Miller independently proposed the use of elliptic curves in cryptography. For a smaller key size, ECC is able to provide same level of security with RSA. This feature made ECC one of the most popular PKC algorithms today. Scalar multiplication is known as the fundamental operation in ECC algorithm and protocols. The efficiency of ECC is critically depends on efficiency of scalar multiplication operation. Scalar multiplication involves with three levels of computations: scalar arithmetic, point arithmetic and field arithmetic. Improving the first two levels will lead to significant increment in efficiency of scalar multiplication. Scalar arithmetic level can improve by employing an enhanced scalar recoding algorithm that can reduce the Hamming weight or de-crease the number of operations in the scalar representation process. This paper reviews some of the recoding algorithms and techniques. Copyright © 2015 Praise Worthy Prize - All rights reserved.

1 November 2016 in Journal of Computer Science
Verified
Journal Article
Open access
PDF file
MBMohsen Bafandehkar
Mohsen Bafandehkar
SYSharifah Yasin
Sharifah Yasin
RMRamlan Mahmod
Ramlan Mahmod
The most expensive and time-consuming operation in Elliptic curve cryptosystem is scalar multiplication operation. Optimization of scalar multiplication will substantially enhance the ECC performance. Scalar multiplication can be improved by using an enhanced scalar recoding algorithm that can decrease the number of operations in the scalar representation process. The objective of this research is to introduce an efficient design and implementation of {0,1,3}-NAF scalar recoding algorithm by applying block method technique. The base algorithm has a complex look up table. With block method application on base algorithm, a complex look up table is undesired. Instead a fix look up table is introduced with less computation required for recoding. The Big-O notation is used to measure the complexity and (µs) used to evaluate the running time of base and proposed algorithm.