Nurshazwani Muhamad Mahfuz

dblp:441/3961 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-8855-3173ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 61% Blockchain and cryptocurrency security · 30% Cryptographic protocols and secure computation · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
1.012026
Quantum-Resistant Privacy and Auditing for Blockchain: A Lattice-Based Approach With Composable Security · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic primitives and cryptanalysis
post-quantum cryptography
1.012026
Quantum-Resistant Privacy and Auditing for Blockchain: A Lattice-Based Approach With Composable Security · IEEE Trans. Dependable Secur. Comput. 2026
Blockchain and cryptocurrency security
privacy-preserving blockchain
1.012026
Quantum-Resistant Privacy and Auditing for Blockchain: A Lattice-Based Approach With Composable Security · IEEE Trans. Dependable Secur. Comput. 2026
Cryptographic protocols and secure computation › composable security
universally composable security
0.312026
Quantum-Resistant Privacy and Auditing for Blockchain: A Lattice-Based Approach With Composable Security · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

shared randomness · 1.0off-chain caching · 1.0lattice trapdoor sampling · 1.0
YearPublicationVenuePosition
2026 Quantum-Resistant Privacy and Auditing for Blockchain: A Lattice-Based Approach With Composable Security
abstract
Privacy-preserving blockchain systems in regulated financial environments must simultaneously satisfy transaction confidentiality and regulatory compliance requirements. Existing schemes predominantly rely on elliptic curve cryptography, rendering them vulnerable to Harvest Now, Decrypt Later (HNDL) attacks posed by quantum computing advances. This paper proposes L-HCPM (Lattice-based Hybrid Cryptographic Protocol Model), a privacy-preserving blockchain protocol based on lattice cryptography that achieves both post-quantum security and regulatory auditability. The core contribution is the LT-Share (Lattice Trapdoor Shared Randomness) mechanism, which leverages GPV08/MP12 lattice trapdoor sampling to generate shared randomness between users and regulators, enabling regulators to independently decrypt transactions without user cooperation. To address the non-reproducibility of Peikert randomized sampling under the UTXO model, we introduce an off-chain caching architecture to ensure sampling consistency. We further extend the Universal Composability (UC) framework by introducing a hybrid adversary model, formally proving the secure composability of quantum-secure and classical-secure components. Experimental evaluation based on a complete prototype system demonstrates that post-quantum cryptographic overhead accounts for only 0.17% of end-to-end latency, with Gas consumption ranging from 337 K to 686 K, and regulatory decryption achieving 100% success rate, validating the practical feasibility of post-quantum security upgrades.
Nurshazwani Muhamad Mahfuz
IEEE Trans. Dependable Secur. Comput.2