M A Manazir Ahsan

M A Manazir Ahsan


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
7 May 2018 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Closed access
MAM A Manazir Ahsan
M A Manazir Ahsan
AWAinuddin Wahid Abdul Wahab
Ainuddin Wahid Abdul Wahab
MIMohd Yamani Idna Idris
Mohd Yamani Idna Idris
SKSuleman Khan
Suleman Khan
EBEric Bachura
Eric Bachura
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
User activity logs can be a valuable source of information in cloud forensic investigations; hence, ensuring the reliability and integrity of such logs is crucial. Most existing solutions for secure logging are designed for conventional systems rather than the complexity of a cloud environment. In this paper, we propose the Cloud Log Assuring Soundness and Secrecy (CLASS) process as an alternative scheme for the securing of logs in a cloud environment. In CLASS, logs are encrypted using the individual user's public key so that only the user is able to decrypt the content. In order to prevent unauthorized modification of the log, we generate proof of past log (PPL) using Rabin's fingerprint and Bloom filter. Such an approach reduces verification time significantly. Findings from our experiments deploying CLASS in OpenStack demonstrate the utility of CLASS in a real-world context.

30 June 2018 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
MAM A Manazir Ahsan
M A Manazir Ahsan
IAIHSAN ALI
IHSAN ALI
MIMohd Yamani Idna Idris
Mohd Yamani Idna Idris
MIMuhammad Imran
Muhammad Imran
MSMuhammad Shoaib
Muhammad Shoaib

15 May 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
MAM A Manazir Ahsan
M A Manazir Ahsan
MIMohd Yamani Idna Idris
Mohd Yamani Idna Idris
AWAinuddin Wahid Abdul Wahab
Ainuddin Wahid Abdul Wahab
IAIHSAN ALI
IHSAN ALI
AKAssoc. Prof. Dr. Khan
Assoc. Prof. Dr. Khan
ARAtiq Ur Rahman
Atiq Ur Rahman
Cloud computing is intensifying the necessity for searchable encryption (SE) for data protection in cloud storage. SE encrypts data to preserve its confidentiality while offering a secure search facility on the encrypted data. Typical index-based SEs in data sharing scenarios can effectively search secure keyword indexes. However, due to the smaller size of the keyword space, SEs using a public key are susceptible to a Keyword Guessing Attack (KGA) and other statistical information leakage. In this paper, for secure search in a data sharing scenario, we propose Random Searchable enCryption (RanSCrypt) that adds randomness to a transformed keyword to increase its space and aspires to make it irreversible. At the core of the mechanism, two keywords are garbled with randomness, still enabling another party to determine if the two garbled keywords (RanSCrypt’s terms REST and Trapdoor) are the same or not without knowing the actual keywords. As SE in a public key setting suffers from vulnerability to KGA, RanSCrypt transfers into a symmetric key setting with minimum overhead and without losing the features of a data sharing scenario. RanSCrypt also adulterates the search result to add perplexity and provides full control of access only to the data receiver. The receiver can cull out the erroneous results from the search result locally. Finally, we introduce a new type of attack on SE, namely, the Keyword Luring Attack (KLA), and show that RanSCrypt is safe from KLA attack due to adulteration of the result. Our security analysis proves RanSCrypt is invulnerable against KGA and leaks no information.

29 August 2018 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
MAM A Manazir Ahsan
M A Manazir Ahsan
IAIHSAN ALI
IHSAN ALI
MIMohd Yamani Idna Idris
Mohd Yamani Idna Idris
MIMuhammad Imran
Muhammad Imran
MSMuhammad Shoaib
Muhammad Shoaib