Usama Habib Chaudhry

Mr. Usama Habib Chaudhry


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
15 May 2024 in Arabian Journal for Science and Engineering
Verified
Journal Article
Closed access
PDF file
RARazi Arshad
Razi Arshad
MJMUDASSAR JALIL
MUDASSAR JALIL
WIWaheed Iqbal
Waheed Iqbal
UCUsama Habib Chaudhry
Usama Habib Chaudhry

19 December 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
UCUsama Habib Chaudhry
Usama Habib Chaudhry
RARazi Arshad
Razi Arshad
AKAyesha Khalid
Ayesha Khalid
IRIndranil Gosh Ray
Indranil Gosh Ray
Mehdi HussainMehdi Hussain
Mehdi Hussain
With the emergence of blockchain and smart contracts, traditional digital applications 1 such as identity management, supply chain management, banking and finance etc. are expected 2 to be transformed into Decentralized Applications (DApps). Blockchain interoperability is a new 3 and exciting aspect of blockchain technology that is quickly gaining popularity in many industries. 4 However, the widespread use of blockchains has not yet been achieved because DApps running on the 5 blockchain using smart contracts require access to authentic off-chain data. Users are more conscious 6 of their personal data privacy and consequently are more reluctant to share their data, posing a 7 challenge in the adoption of DApps. To solve this challenge, we present a novel quantum-resistant, 8 data authentication and zero-knowledge proof scheme named zk-DASTARK. Based on our proposed 9 scheme, we present a novel framework which can be used to feed authenticated off-chain data to 10 DApps without compromising user data privacy. Our proposed framework is quite efficient against 11 well-known off-chain data authentication frameworks. The proposed framework is implemented on 12 state-of-the-art quantum-resistant IOTA Blockchain and is highly efficient as it takes approximately 13 60 ms to generate a proof and approximately 10 ms to verify a proof.